./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product49_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product49_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 712263c6c933aaef268a48b623f3b4ee6fd9ad4b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:54:24,940 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:54:24,942 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:54:24,962 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:54:24,963 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:54:24,964 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:54:24,965 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:54:24,967 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:54:24,968 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:54:24,969 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:54:24,970 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:54:24,971 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:54:24,971 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:54:24,972 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:54:24,974 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:54:24,974 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:54:24,975 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:54:24,977 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:54:24,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:54:24,980 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:54:24,982 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:54:24,983 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:54:24,985 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:54:24,985 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:54:24,986 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:54:24,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:54:24,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:54:24,988 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:54:24,989 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:54:24,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:54:24,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:54:24,994 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:54:24,994 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:54:24,995 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:54:24,998 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:54:24,998 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:54:24,999 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:54:25,028 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:54:25,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:54:25,029 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:54:25,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:54:25,030 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:54:25,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:54:25,030 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:54:25,030 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:54:25,031 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:54:25,031 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:54:25,031 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:54:25,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:54:25,031 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:54:25,031 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:54:25,032 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:54:25,032 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:54:25,032 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:54:25,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:54:25,032 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:54:25,033 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:54:25,033 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:54:25,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:54:25,033 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:54:25,033 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:54:25,033 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:54:25,034 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:54:25,034 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:54:25,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:54:25,034 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 712263c6c933aaef268a48b623f3b4ee6fd9ad4b [2019-01-12 14:54:25,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:54:25,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:54:25,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:54:25,105 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:54:25,105 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:54:25,106 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product49_true-unreach-call_false-termination.cil.c [2019-01-12 14:54:25,167 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa73a9b7b/3fdab4cfe9c2483087b484f854004cd4/FLAG32a9655f2 [2019-01-12 14:54:25,720 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:54:25,721 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product49_true-unreach-call_false-termination.cil.c [2019-01-12 14:54:25,735 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa73a9b7b/3fdab4cfe9c2483087b484f854004cd4/FLAG32a9655f2 [2019-01-12 14:54:26,022 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa73a9b7b/3fdab4cfe9c2483087b484f854004cd4 [2019-01-12 14:54:26,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:54:26,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:54:26,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:54:26,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:54:26,032 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:54:26,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bfca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26, skipping insertion in model container [2019-01-12 14:54:26,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:54:26,096 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:54:26,543 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:54:26,557 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:54:26,681 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:54:26,826 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:54:26,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26 WrapperNode [2019-01-12 14:54:26,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:54:26,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:54:26,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:54:26,829 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:54:26,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:54:26,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:54:26,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:54:26,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:54:26,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:54:26,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:54:26,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:54:26,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:54:26,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:54:27,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:54:27,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:54:27,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:54:27,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:54:28,565 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:54:28,566 INFO L286 CfgBuilder]: Removed 156 assue(true) statements. [2019-01-12 14:54:28,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:54:28 BoogieIcfgContainer [2019-01-12 14:54:28,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:54:28,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:54:28,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:54:28,572 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:54:28,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:54:26" (1/3) ... [2019-01-12 14:54:28,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d0ec18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:54:28, skipping insertion in model container [2019-01-12 14:54:28,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26" (2/3) ... [2019-01-12 14:54:28,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d0ec18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:54:28, skipping insertion in model container [2019-01-12 14:54:28,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:54:28" (3/3) ... [2019-01-12 14:54:28,578 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product49_true-unreach-call_false-termination.cil.c [2019-01-12 14:54:28,587 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:54:28,593 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:54:28,607 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:54:28,640 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:54:28,640 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:54:28,641 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:54:28,641 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:54:28,642 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:54:28,642 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:54:28,642 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:54:28,643 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:54:28,643 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:54:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-01-12 14:54:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:54:28,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:28,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:28,682 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:28,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:28,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1641629540, now seen corresponding path program 1 times [2019-01-12 14:54:28,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:28,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:28,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:28,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:28,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:28,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:28,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:54:28,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:54:28,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:54:28,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:54:28,964 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 2 states. [2019-01-12 14:54:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:28,998 INFO L93 Difference]: Finished difference Result 228 states and 347 transitions. [2019-01-12 14:54:28,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:54:29,000 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:54:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:29,021 INFO L225 Difference]: With dead ends: 228 [2019-01-12 14:54:29,021 INFO L226 Difference]: Without dead ends: 113 [2019-01-12 14:54:29,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:54:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-12 14:54:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-12 14:54:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-12 14:54:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2019-01-12 14:54:29,071 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 16 [2019-01-12 14:54:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:29,072 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2019-01-12 14:54:29,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:54:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2019-01-12 14:54:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:54:29,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:29,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:29,074 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:29,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:29,074 INFO L82 PathProgramCache]: Analyzing trace with hash 594872643, now seen corresponding path program 1 times [2019-01-12 14:54:29,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:29,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:29,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:29,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:29,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:29,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:54:29,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:29,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:29,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:29,252 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand 3 states. [2019-01-12 14:54:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:29,291 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2019-01-12 14:54:29,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:29,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:54:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:29,294 INFO L225 Difference]: With dead ends: 113 [2019-01-12 14:54:29,294 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 14:54:29,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 14:54:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 14:54:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 14:54:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-01-12 14:54:29,302 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-01-12 14:54:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:29,303 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-01-12 14:54:29,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-01-12 14:54:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:54:29,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:29,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:29,305 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:29,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:29,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1404483435, now seen corresponding path program 1 times [2019-01-12 14:54:29,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:29,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:29,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:29,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:29,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:29,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:54:29,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:29,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:29,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:29,456 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 3 states. [2019-01-12 14:54:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:29,476 INFO L93 Difference]: Finished difference Result 88 states and 130 transitions. [2019-01-12 14:54:29,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:29,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-12 14:54:29,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:29,478 INFO L225 Difference]: With dead ends: 88 [2019-01-12 14:54:29,478 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 14:54:29,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 14:54:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 14:54:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 14:54:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2019-01-12 14:54:29,486 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 22 [2019-01-12 14:54:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:29,486 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2019-01-12 14:54:29,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:29,488 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2019-01-12 14:54:29,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:54:29,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:29,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:29,490 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:29,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:29,490 INFO L82 PathProgramCache]: Analyzing trace with hash -764351347, now seen corresponding path program 1 times [2019-01-12 14:54:29,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:29,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:29,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:29,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:29,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:29,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:54:29,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:29,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:29,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:29,611 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 3 states. [2019-01-12 14:54:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:29,739 INFO L93 Difference]: Finished difference Result 109 states and 158 transitions. [2019-01-12 14:54:29,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:29,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:54:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:29,742 INFO L225 Difference]: With dead ends: 109 [2019-01-12 14:54:29,742 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 14:54:29,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:29,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 14:54:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-01-12 14:54:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 14:54:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2019-01-12 14:54:29,756 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 24 [2019-01-12 14:54:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:29,756 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 93 transitions. [2019-01-12 14:54:29,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2019-01-12 14:54:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:54:29,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:29,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:29,759 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash -805303330, now seen corresponding path program 1 times [2019-01-12 14:54:29,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:29,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:29,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:54:29,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:29,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:29,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:29,864 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. Second operand 5 states. [2019-01-12 14:54:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:30,067 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2019-01-12 14:54:30,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:54:30,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:54:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:30,070 INFO L225 Difference]: With dead ends: 175 [2019-01-12 14:54:30,070 INFO L226 Difference]: Without dead ends: 115 [2019-01-12 14:54:30,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:54:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-12 14:54:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-01-12 14:54:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-12 14:54:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2019-01-12 14:54:30,082 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 30 [2019-01-12 14:54:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:30,083 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2019-01-12 14:54:30,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2019-01-12 14:54:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:54:30,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:30,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:30,086 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:30,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1857207713, now seen corresponding path program 1 times [2019-01-12 14:54:30,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:30,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:30,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:30,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:30,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:30,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:30,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:54:30,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:30,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:30,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:30,341 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand 5 states. [2019-01-12 14:54:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:30,681 INFO L93 Difference]: Finished difference Result 253 states and 355 transitions. [2019-01-12 14:54:30,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:54:30,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:54:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:30,685 INFO L225 Difference]: With dead ends: 253 [2019-01-12 14:54:30,685 INFO L226 Difference]: Without dead ends: 187 [2019-01-12 14:54:30,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:54:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-12 14:54:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 115. [2019-01-12 14:54:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-12 14:54:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 155 transitions. [2019-01-12 14:54:30,722 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 155 transitions. Word has length 30 [2019-01-12 14:54:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:30,722 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 155 transitions. [2019-01-12 14:54:30,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 155 transitions. [2019-01-12 14:54:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:54:30,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:30,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:30,726 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:30,727 INFO L82 PathProgramCache]: Analyzing trace with hash -150608481, now seen corresponding path program 1 times [2019-01-12 14:54:30,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:30,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:30,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:31,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:31,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:54:31,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:31,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:31,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:31,040 INFO L87 Difference]: Start difference. First operand 115 states and 155 transitions. Second operand 5 states. [2019-01-12 14:54:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:31,796 INFO L93 Difference]: Finished difference Result 247 states and 339 transitions. [2019-01-12 14:54:31,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:54:31,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:54:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:31,800 INFO L225 Difference]: With dead ends: 247 [2019-01-12 14:54:31,800 INFO L226 Difference]: Without dead ends: 245 [2019-01-12 14:54:31,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:54:31,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-12 14:54:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 115. [2019-01-12 14:54:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-12 14:54:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2019-01-12 14:54:31,821 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 31 [2019-01-12 14:54:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:31,821 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2019-01-12 14:54:31,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2019-01-12 14:54:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:54:31,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:31,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:31,825 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:31,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:31,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1088820762, now seen corresponding path program 1 times [2019-01-12 14:54:31,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:31,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:31,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:31,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:31,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:54:31,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:54:31,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:54:31,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:54:31,995 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 4 states. [2019-01-12 14:54:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:32,104 INFO L93 Difference]: Finished difference Result 250 states and 335 transitions. [2019-01-12 14:54:32,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:54:32,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-12 14:54:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:32,108 INFO L225 Difference]: With dead ends: 250 [2019-01-12 14:54:32,108 INFO L226 Difference]: Without dead ends: 141 [2019-01-12 14:54:32,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-12 14:54:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 100. [2019-01-12 14:54:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-12 14:54:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2019-01-12 14:54:32,134 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 31 [2019-01-12 14:54:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:32,135 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2019-01-12 14:54:32,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:54:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2019-01-12 14:54:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:54:32,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:32,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:32,142 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:32,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:32,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1346986200, now seen corresponding path program 1 times [2019-01-12 14:54:32,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:32,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:32,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:32,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:32,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:32,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:32,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:54:32,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:32,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:32,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:32,231 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand 5 states. [2019-01-12 14:54:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:32,742 INFO L93 Difference]: Finished difference Result 271 states and 366 transitions. [2019-01-12 14:54:32,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:54:32,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:54:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:32,746 INFO L225 Difference]: With dead ends: 271 [2019-01-12 14:54:32,746 INFO L226 Difference]: Without dead ends: 201 [2019-01-12 14:54:32,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:54:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-12 14:54:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 141. [2019-01-12 14:54:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-12 14:54:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2019-01-12 14:54:32,766 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 31 [2019-01-12 14:54:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:32,766 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2019-01-12 14:54:32,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2019-01-12 14:54:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 14:54:32,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:32,770 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:32,770 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:32,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:32,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1033530397, now seen corresponding path program 1 times [2019-01-12 14:54:32,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:32,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:32,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:32,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:32,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:32,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:54:32,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:54:32,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:33,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:54:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:33,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:54:33,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:54:33,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:54:33,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:54:33,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:54:33,141 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand 6 states. [2019-01-12 14:54:33,667 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 14:54:34,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:34,146 INFO L93 Difference]: Finished difference Result 441 states and 588 transitions. [2019-01-12 14:54:34,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:54:34,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-01-12 14:54:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:34,156 INFO L225 Difference]: With dead ends: 441 [2019-01-12 14:54:34,156 INFO L226 Difference]: Without dead ends: 330 [2019-01-12 14:54:34,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:54:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-12 14:54:34,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 195. [2019-01-12 14:54:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-12 14:54:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 256 transitions. [2019-01-12 14:54:34,250 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 256 transitions. Word has length 52 [2019-01-12 14:54:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:34,252 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 256 transitions. [2019-01-12 14:54:34,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:54:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 256 transitions. [2019-01-12 14:54:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 14:54:34,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:34,255 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:34,255 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:34,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2113506808, now seen corresponding path program 2 times [2019-01-12 14:54:34,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:34,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:34,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:34,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:34,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 14:54:34,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:34,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:54:34,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:34,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:34,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:34,618 INFO L87 Difference]: Start difference. First operand 195 states and 256 transitions. Second operand 5 states. [2019-01-12 14:54:35,170 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 14:54:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:35,616 INFO L93 Difference]: Finished difference Result 575 states and 767 transitions. [2019-01-12 14:54:35,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:54:35,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-01-12 14:54:35,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:35,622 INFO L225 Difference]: With dead ends: 575 [2019-01-12 14:54:35,622 INFO L226 Difference]: Without dead ends: 409 [2019-01-12 14:54:35,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:54:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-01-12 14:54:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 271. [2019-01-12 14:54:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-12 14:54:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 353 transitions. [2019-01-12 14:54:35,671 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 353 transitions. Word has length 73 [2019-01-12 14:54:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:35,672 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 353 transitions. [2019-01-12 14:54:35,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 353 transitions. [2019-01-12 14:54:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 14:54:35,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:35,675 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:35,675 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:35,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1906700874, now seen corresponding path program 1 times [2019-01-12 14:54:35,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:35,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:35,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:35,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:54:35,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 14:54:35,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:54:35,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:54:35,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:36,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:54:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 14:54:36,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 14:54:36,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-01-12 14:54:36,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:54:36,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:54:36,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:54:36,444 INFO L87 Difference]: Start difference. First operand 271 states and 353 transitions. Second operand 9 states. [2019-01-12 14:54:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:36,885 INFO L93 Difference]: Finished difference Result 504 states and 657 transitions. [2019-01-12 14:54:36,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:54:36,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-01-12 14:54:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:36,886 INFO L225 Difference]: With dead ends: 504 [2019-01-12 14:54:36,886 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:54:36,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-12 14:54:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:54:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:54:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:54:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:54:36,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2019-01-12 14:54:36,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:36,888 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:54:36,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:54:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:54:36,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:54:36,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:54:37,043 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2019-01-12 14:54:37,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,241 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2019-01-12 14:54:37,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,383 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 84 [2019-01-12 14:54:37,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,651 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 78 [2019-01-12 14:54:37,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,088 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-12 14:54:39,339 WARN L181 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 96 DAG size of output: 17 [2019-01-12 14:54:39,689 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 21 [2019-01-12 14:54:39,995 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 17 [2019-01-12 14:54:40,413 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 9 [2019-01-12 14:54:40,913 WARN L181 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 22 [2019-01-12 14:54:41,221 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 17 [2019-01-12 14:54:41,438 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 26 [2019-01-12 14:54:41,546 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 20 [2019-01-12 14:54:41,550 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 437) no Hoare annotation was computed. [2019-01-12 14:54:41,550 INFO L448 ceAbstractionStarter]: For program point L433-2(lines 433 437) no Hoare annotation was computed. [2019-01-12 14:54:41,550 INFO L448 ceAbstractionStarter]: For program point L433-3(lines 433 437) no Hoare annotation was computed. [2019-01-12 14:54:41,550 INFO L448 ceAbstractionStarter]: For program point L433-5(lines 433 437) no Hoare annotation was computed. [2019-01-12 14:54:41,550 INFO L448 ceAbstractionStarter]: For program point L433-6(lines 433 437) no Hoare annotation was computed. [2019-01-12 14:54:41,550 INFO L448 ceAbstractionStarter]: For program point L433-8(lines 433 437) no Hoare annotation was computed. [2019-01-12 14:54:41,550 INFO L448 ceAbstractionStarter]: For program point L433-9(lines 433 437) no Hoare annotation was computed. [2019-01-12 14:54:41,550 INFO L448 ceAbstractionStarter]: For program point L433-11(lines 433 437) no Hoare annotation was computed. [2019-01-12 14:54:41,550 INFO L448 ceAbstractionStarter]: For program point L433-12(lines 433 437) no Hoare annotation was computed. [2019-01-12 14:54:41,550 INFO L448 ceAbstractionStarter]: For program point L433-14(lines 433 437) no Hoare annotation was computed. [2019-01-12 14:54:41,551 INFO L448 ceAbstractionStarter]: For program point L433-15(lines 433 437) no Hoare annotation was computed. [2019-01-12 14:54:41,551 INFO L448 ceAbstractionStarter]: For program point L433-17(lines 433 437) no Hoare annotation was computed. [2019-01-12 14:54:41,551 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 343) no Hoare annotation was computed. [2019-01-12 14:54:41,551 INFO L448 ceAbstractionStarter]: For program point L335-1(lines 335 343) no Hoare annotation was computed. [2019-01-12 14:54:41,551 INFO L448 ceAbstractionStarter]: For program point L335-2(lines 335 343) no Hoare annotation was computed. [2019-01-12 14:54:41,551 INFO L444 ceAbstractionStarter]: At program point L172-2(lines 172 186) the Hoare annotation is: false [2019-01-12 14:54:41,551 INFO L448 ceAbstractionStarter]: For program point L503(lines 503 514) no Hoare annotation was computed. [2019-01-12 14:54:41,551 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 322) no Hoare annotation was computed. [2019-01-12 14:54:41,551 INFO L448 ceAbstractionStarter]: For program point L305-1(lines 305 322) no Hoare annotation was computed. [2019-01-12 14:54:41,552 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 305 322) no Hoare annotation was computed. [2019-01-12 14:54:41,552 INFO L448 ceAbstractionStarter]: For program point L305-3(lines 305 322) no Hoare annotation was computed. [2019-01-12 14:54:41,552 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-01-12 14:54:41,552 INFO L448 ceAbstractionStarter]: For program point L305-4(lines 305 322) no Hoare annotation was computed. [2019-01-12 14:54:41,552 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 146) no Hoare annotation was computed. [2019-01-12 14:54:41,552 INFO L448 ceAbstractionStarter]: For program point L305-5(lines 305 322) no Hoare annotation was computed. [2019-01-12 14:54:41,552 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 140 146) no Hoare annotation was computed. [2019-01-12 14:54:41,552 INFO L448 ceAbstractionStarter]: For program point L140-2(lines 140 146) no Hoare annotation was computed. [2019-01-12 14:54:41,552 INFO L448 ceAbstractionStarter]: For program point L140-3(lines 140 146) no Hoare annotation was computed. [2019-01-12 14:54:41,552 INFO L448 ceAbstractionStarter]: For program point L140-4(lines 140 146) no Hoare annotation was computed. [2019-01-12 14:54:41,553 INFO L448 ceAbstractionStarter]: For program point L140-5(lines 140 146) no Hoare annotation was computed. [2019-01-12 14:54:41,553 INFO L444 ceAbstractionStarter]: At program point L273(lines 272 291) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~systemActive~0 1)) [2019-01-12 14:54:41,553 INFO L448 ceAbstractionStarter]: For program point L273-1(lines 273 279) no Hoare annotation was computed. [2019-01-12 14:54:41,553 INFO L444 ceAbstractionStarter]: At program point L273-2(lines 272 291) the Hoare annotation is: false [2019-01-12 14:54:41,553 INFO L444 ceAbstractionStarter]: At program point L273-3(lines 272 291) the Hoare annotation is: false [2019-01-12 14:54:41,553 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 79) no Hoare annotation was computed. [2019-01-12 14:54:41,553 INFO L448 ceAbstractionStarter]: For program point L571(lines 571 584) no Hoare annotation was computed. [2019-01-12 14:54:41,553 INFO L444 ceAbstractionStarter]: At program point L571-1(lines 1 953) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (= ~pumpRunning~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) (<= 2 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~6) .cse0 (<= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse1) (and (and (and .cse0 .cse2) (<= 1 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~6) (<= 1 |ULTIMATE.start_getWaterLevel_#res|) (<= 1 ~waterLevel~0)) .cse1) (and (and (= 1 ~waterLevel~0) .cse0 .cse2) .cse1))) [2019-01-12 14:54:41,554 INFO L448 ceAbstractionStarter]: For program point L571-2(lines 571 584) no Hoare annotation was computed. [2019-01-12 14:54:41,554 INFO L444 ceAbstractionStarter]: At program point L571-3(lines 1 953) the Hoare annotation is: false [2019-01-12 14:54:41,554 INFO L444 ceAbstractionStarter]: At program point L439(lines 424 442) the Hoare annotation is: false [2019-01-12 14:54:41,554 INFO L448 ceAbstractionStarter]: For program point L571-4(lines 571 584) no Hoare annotation was computed. [2019-01-12 14:54:41,554 INFO L444 ceAbstractionStarter]: At program point L439-1(lines 424 442) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~0) .cse1 .cse2) (<= 1 ~waterLevel~0)) (and (and (<= 2 ~waterLevel~0) (and .cse0 .cse1)) .cse2))) [2019-01-12 14:54:41,554 INFO L444 ceAbstractionStarter]: At program point L571-5(lines 1 953) the Hoare annotation is: false [2019-01-12 14:54:41,554 INFO L444 ceAbstractionStarter]: At program point L439-2(lines 424 442) the Hoare annotation is: false [2019-01-12 14:54:41,554 INFO L444 ceAbstractionStarter]: At program point L439-3(lines 424 442) the Hoare annotation is: false [2019-01-12 14:54:41,555 INFO L444 ceAbstractionStarter]: At program point L439-4(lines 424 442) the Hoare annotation is: false [2019-01-12 14:54:41,555 INFO L444 ceAbstractionStarter]: At program point L439-5(lines 424 442) the Hoare annotation is: false [2019-01-12 14:54:41,555 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 180) no Hoare annotation was computed. [2019-01-12 14:54:41,555 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 273 279) no Hoare annotation was computed. [2019-01-12 14:54:41,555 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-12 14:54:41,555 INFO L448 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. [2019-01-12 14:54:41,555 INFO L448 ceAbstractionStarter]: For program point L44-2(line 44) no Hoare annotation was computed. [2019-01-12 14:54:41,555 INFO L448 ceAbstractionStarter]: For program point L474(lines 473 518) no Hoare annotation was computed. [2019-01-12 14:54:41,555 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 317) no Hoare annotation was computed. [2019-01-12 14:54:41,555 INFO L448 ceAbstractionStarter]: For program point L309-1(lines 309 317) no Hoare annotation was computed. [2019-01-12 14:54:41,556 INFO L448 ceAbstractionStarter]: For program point L309-2(lines 309 317) no Hoare annotation was computed. [2019-01-12 14:54:41,556 INFO L448 ceAbstractionStarter]: For program point L309-3(lines 309 317) no Hoare annotation was computed. [2019-01-12 14:54:41,556 INFO L448 ceAbstractionStarter]: For program point L309-4(lines 309 317) no Hoare annotation was computed. [2019-01-12 14:54:41,556 INFO L448 ceAbstractionStarter]: For program point L309-5(lines 309 317) no Hoare annotation was computed. [2019-01-12 14:54:41,556 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 479) no Hoare annotation was computed. [2019-01-12 14:54:41,556 INFO L444 ceAbstractionStarter]: At program point L145(lines 136 149) the Hoare annotation is: false [2019-01-12 14:54:41,556 INFO L444 ceAbstractionStarter]: At program point L145-1(lines 136 149) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0))) (.cse1 (= ~systemActive~0 1))) (or (and (and (<= 1 ~waterLevel~0) (and .cse0 (= 1 |ULTIMATE.start_isHighWaterSensorDry_#res|))) .cse1) (and (and (<= 2 ~waterLevel~0) .cse0) .cse1))) [2019-01-12 14:54:41,556 INFO L444 ceAbstractionStarter]: At program point L145-2(lines 136 149) the Hoare annotation is: false [2019-01-12 14:54:41,556 INFO L444 ceAbstractionStarter]: At program point L145-3(lines 136 149) the Hoare annotation is: false [2019-01-12 14:54:41,556 INFO L444 ceAbstractionStarter]: At program point L145-4(lines 136 149) the Hoare annotation is: false [2019-01-12 14:54:41,557 INFO L444 ceAbstractionStarter]: At program point L145-5(lines 136 149) the Hoare annotation is: false [2019-01-12 14:54:41,557 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-01-12 14:54:41,557 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 581) no Hoare annotation was computed. [2019-01-12 14:54:41,557 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 513) no Hoare annotation was computed. [2019-01-12 14:54:41,557 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 581) no Hoare annotation was computed. [2019-01-12 14:54:41,557 INFO L448 ceAbstractionStarter]: For program point L509-2(lines 273 279) no Hoare annotation was computed. [2019-01-12 14:54:41,557 INFO L448 ceAbstractionStarter]: For program point L575-4(lines 575 581) no Hoare annotation was computed. [2019-01-12 14:54:41,557 INFO L444 ceAbstractionStarter]: At program point L280(lines 280 286) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (and (and .cse0 (= ~pumpRunning~0 0)) (<= 1 ~waterLevel~0)) .cse1) (and (<= 2 ~waterLevel~0) .cse0 .cse1))) [2019-01-12 14:54:41,558 INFO L444 ceAbstractionStarter]: At program point L280-1(lines 280 286) the Hoare annotation is: false [2019-01-12 14:54:41,558 INFO L444 ceAbstractionStarter]: At program point L280-2(lines 280 286) the Hoare annotation is: false [2019-01-12 14:54:41,558 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-01-12 14:54:41,558 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 255) no Hoare annotation was computed. [2019-01-12 14:54:41,558 INFO L451 ceAbstractionStarter]: At program point L248-1(lines 248 255) the Hoare annotation is: true [2019-01-12 14:54:41,558 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:54:41,558 INFO L448 ceAbstractionStarter]: For program point L483(lines 483 489) no Hoare annotation was computed. [2019-01-12 14:54:41,558 INFO L444 ceAbstractionStarter]: At program point L483-1(lines 483 489) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (and (= 1 ~waterLevel~0) .cse0 (= ~pumpRunning~0 0)) .cse1) (and (<= 2 ~waterLevel~0) (and .cse0 .cse1)))) [2019-01-12 14:54:41,558 INFO L444 ceAbstractionStarter]: At program point L384(lines 379 387) the Hoare annotation is: false [2019-01-12 14:54:41,559 INFO L444 ceAbstractionStarter]: At program point L384-1(lines 379 387) the Hoare annotation is: false [2019-01-12 14:54:41,559 INFO L444 ceAbstractionStarter]: At program point L384-2(lines 379 387) the Hoare annotation is: false [2019-01-12 14:54:41,559 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2019-01-12 14:54:41,559 INFO L444 ceAbstractionStarter]: At program point L550(lines 1 953) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:54:41,559 INFO L448 ceAbstractionStarter]: For program point L452(lines 452 456) no Hoare annotation was computed. [2019-01-12 14:54:41,559 INFO L448 ceAbstractionStarter]: For program point L452-2(lines 452 456) no Hoare annotation was computed. [2019-01-12 14:54:41,559 INFO L448 ceAbstractionStarter]: For program point L452-3(lines 452 456) no Hoare annotation was computed. [2019-01-12 14:54:41,559 INFO L448 ceAbstractionStarter]: For program point L452-5(lines 452 456) no Hoare annotation was computed. [2019-01-12 14:54:41,559 INFO L448 ceAbstractionStarter]: For program point L452-6(lines 452 456) no Hoare annotation was computed. [2019-01-12 14:54:41,559 INFO L444 ceAbstractionStarter]: At program point L221(lines 217 223) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:54:41,560 INFO L448 ceAbstractionStarter]: For program point L452-8(lines 452 456) no Hoare annotation was computed. [2019-01-12 14:54:41,560 INFO L444 ceAbstractionStarter]: At program point L155(lines 150 158) the Hoare annotation is: (and (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~systemActive~0 1)) [2019-01-12 14:54:41,560 INFO L444 ceAbstractionStarter]: At program point L155-1(lines 150 158) the Hoare annotation is: false [2019-01-12 14:54:41,560 INFO L444 ceAbstractionStarter]: At program point L155-2(lines 150 158) the Hoare annotation is: false [2019-01-12 14:54:41,560 INFO L444 ceAbstractionStarter]: At program point L519(lines 472 520) the Hoare annotation is: false [2019-01-12 14:54:41,560 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:54:41,560 INFO L451 ceAbstractionStarter]: At program point L257(lines 238 260) the Hoare annotation is: true [2019-01-12 14:54:41,560 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-01-12 14:54:41,560 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:54:41,561 INFO L444 ceAbstractionStarter]: At program point L458(lines 443 461) the Hoare annotation is: (and (<= 1 ULTIMATE.start_isLowWaterLevel_~tmp___0~1) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 |ULTIMATE.start_isLowWaterLevel_#res|) (<= 1 ~waterLevel~0) (= ULTIMATE.start_isLowWaterLevel_~tmp~4 0) (= ~systemActive~0 1)) [2019-01-12 14:54:41,561 INFO L444 ceAbstractionStarter]: At program point L458-1(lines 443 461) the Hoare annotation is: false [2019-01-12 14:54:41,561 INFO L444 ceAbstractionStarter]: At program point L458-2(lines 443 461) the Hoare annotation is: false [2019-01-12 14:54:41,561 INFO L444 ceAbstractionStarter]: At program point L558(lines 553 561) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:54:41,561 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2019-01-12 14:54:41,561 INFO L448 ceAbstractionStarter]: For program point L63-3(lines 63 67) no Hoare annotation was computed. [2019-01-12 14:54:41,561 INFO L448 ceAbstractionStarter]: For program point L63-6(lines 63 67) no Hoare annotation was computed. [2019-01-12 14:54:41,561 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 499) no Hoare annotation was computed. [2019-01-12 14:54:41,561 INFO L444 ceAbstractionStarter]: At program point L493-1(lines 493 499) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (and (= 1 ~waterLevel~0) .cse0 (= ~pumpRunning~0 0)) .cse1) (and (<= 2 ~waterLevel~0) (and .cse0 .cse1)))) [2019-01-12 14:54:41,562 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:54:41,562 INFO L444 ceAbstractionStarter]: At program point L132(lines 127 135) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (and (<= 1 |ULTIMATE.start_getWaterLevel_#res|) (<= 1 ~waterLevel~0) (and .cse0 (= ~pumpRunning~0 0))) .cse1) (and (<= 2 ~waterLevel~0) .cse0 (<= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse1))) [2019-01-12 14:54:41,562 INFO L444 ceAbstractionStarter]: At program point L132-1(lines 127 135) the Hoare annotation is: false [2019-01-12 14:54:41,562 INFO L444 ceAbstractionStarter]: At program point L132-2(lines 127 135) the Hoare annotation is: false [2019-01-12 14:54:41,562 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 348) no Hoare annotation was computed. [2019-01-12 14:54:41,562 INFO L448 ceAbstractionStarter]: For program point L331-1(lines 331 348) no Hoare annotation was computed. [2019-01-12 14:54:41,562 INFO L448 ceAbstractionStarter]: For program point L331-2(lines 331 348) no Hoare annotation was computed. [2019-01-12 14:54:41,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:54:41 BoogieIcfgContainer [2019-01-12 14:54:41,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:54:41,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:54:41,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:54:41,587 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:54:41,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:54:28" (3/4) ... [2019-01-12 14:54:41,591 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:54:41,614 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:54:41,615 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-12 14:54:41,618 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-12 14:54:41,620 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 14:54:41,621 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:54:41,625 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:54:41,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 <= waterLevel && 2 <= tmp) && splverifierCounter == 0) && 2 <= \result) && systemActive == 1) || (((((splverifierCounter == 0 && pumpRunning == 0) && 1 <= tmp) && 1 <= \result) && 1 <= waterLevel) && systemActive == 1)) || (((1 == waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:54:41,667 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= \result && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && 2 <= \result) && systemActive == 1) [2019-01-12 14:54:41,670 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && systemActive == 1 [2019-01-12 14:54:41,672 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 <= waterLevel && (splverifierCounter == 0 && pumpRunning == 0) && 1 == \result) && systemActive == 1) || ((2 <= waterLevel && splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:54:41,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= tmp___0 && 0 == \result) && splverifierCounter == 0) && 1 <= \result) && 1 <= waterLevel) && tmp == 0) && systemActive == 1 [2019-01-12 14:54:41,675 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && splverifierCounter == 0) && 0 == tmp___0) && pumpRunning == 0) && systemActive == 1) && 1 <= waterLevel) || ((2 <= waterLevel && splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:54:41,824 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:54:41,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:54:41,825 INFO L168 Benchmark]: Toolchain (without parser) took 15798.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 105.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:41,826 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:54:41,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:41,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:41,829 INFO L168 Benchmark]: Boogie Preprocessor took 45.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:54:41,829 INFO L168 Benchmark]: RCFGBuilder took 1610.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:41,831 INFO L168 Benchmark]: TraceAbstraction took 13017.71 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -110.2 MB). Peak memory consumption was 366.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:41,833 INFO L168 Benchmark]: Witness Printer took 237.49 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:41,836 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 799.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1610.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13017.71 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -110.2 MB). Peak memory consumption was 366.7 MB. Max. memory is 11.5 GB. * Witness Printer took 237.49 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && systemActive == 1 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((1 == waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) || (2 <= waterLevel && splverifierCounter == 0 && systemActive == 1) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: (1 == waterLevel && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((1 <= tmp___0 && 0 == \result) && splverifierCounter == 0) && 1 <= \result) && 1 <= waterLevel) && tmp == 0) && systemActive == 1 - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (1 == waterLevel && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (1 == waterLevel && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((1 <= waterLevel && (splverifierCounter == 0 && pumpRunning == 0) && 1 == \result) && systemActive == 1) || ((2 <= waterLevel && splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 483]: Loop Invariant Derived loop invariant: (((1 == waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) || (2 <= waterLevel && splverifierCounter == 0 && systemActive == 1) - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (splverifierCounter == 0 && 1 <= waterLevel) && systemActive == 1 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: (((((0 == \result && splverifierCounter == 0) && 0 == tmp___0) && pumpRunning == 0) && systemActive == 1) && 1 <= waterLevel) || ((2 <= waterLevel && splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) || ((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((2 <= waterLevel && 2 <= tmp) && splverifierCounter == 0) && 2 <= \result) && systemActive == 1) || (((((splverifierCounter == 0 && pumpRunning == 0) && 1 <= tmp) && 1 <= \result) && 1 <= waterLevel) && systemActive == 1)) || (((1 == waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((1 <= \result && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && 2 <= \result) && systemActive == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 117 locations, 3 error locations. SAFE Result, 12.9s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 4.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1190 SDtfs, 1660 SDslu, 1945 SDs, 0 SdLazy, 315 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 621 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 42 PreInvPairs, 124 NumberOfFragments, 337 HoareAnnotationTreeSize, 42 FomulaSimplifications, 146365 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 42 FomulaSimplificationsInter, 43988 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 555 NumberOfCodeBlocks, 555 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 541 ConstructedInterpolants, 0 QuantifiedInterpolants, 44697 SizeOfPredicates, 8 NumberOfNonLiveVariables, 853 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 159/175 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...