/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:33:24,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:33:24,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:33:24,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:33:24,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:33:24,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:33:24,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:33:24,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:33:24,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:33:24,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:33:24,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:33:24,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:33:24,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:33:24,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:33:24,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:33:24,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:33:24,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:33:24,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:33:24,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:33:24,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:33:24,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:33:24,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:33:24,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:33:24,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:33:24,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:33:24,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:33:24,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:33:24,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:33:24,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:33:24,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:33:24,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:33:24,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:33:24,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:33:24,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:33:24,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:33:24,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:33:24,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:33:24,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:33:24,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:33:24,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:33:24,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:33:24,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 00:33:24,356 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:33:24,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:33:24,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:33:24,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:33:24,361 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:33:24,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:33:24,361 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:33:24,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:33:24,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:33:24,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:33:24,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:33:24,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:33:24,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:33:24,363 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:33:24,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:33:24,364 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:33:24,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:33:24,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:33:24,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:33:24,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:33:24,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:33:24,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:33:24,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:33:24,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:33:24,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:33:24,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:33:24,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:33:24,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:33:24,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:33:24,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:33:24,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:33:24,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:33:24,662 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:33:24,662 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:33:24,663 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-11-07 00:33:24,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfaa7343f/0c36fd0da53849789aec00ac06363396/FLAG123f7d13e [2019-11-07 00:33:25,103 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:33:25,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-11-07 00:33:25,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfaa7343f/0c36fd0da53849789aec00ac06363396/FLAG123f7d13e [2019-11-07 00:33:25,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfaa7343f/0c36fd0da53849789aec00ac06363396 [2019-11-07 00:33:25,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:33:25,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:33:25,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:33:25,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:33:25,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:33:25,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:33:25" (1/1) ... [2019-11-07 00:33:25,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7654438a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:25, skipping insertion in model container [2019-11-07 00:33:25,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:33:25" (1/1) ... [2019-11-07 00:33:25,502 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:33:25,526 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:33:25,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:33:25,714 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:33:25,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:33:25,880 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:33:25,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:25 WrapperNode [2019-11-07 00:33:25,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:33:25,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:33:25,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:33:25,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:33:25,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:25" (1/1) ... [2019-11-07 00:33:25,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:25" (1/1) ... [2019-11-07 00:33:25,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:25" (1/1) ... [2019-11-07 00:33:25,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:25" (1/1) ... [2019-11-07 00:33:25,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:25" (1/1) ... [2019-11-07 00:33:25,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:25" (1/1) ... [2019-11-07 00:33:25,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:25" (1/1) ... [2019-11-07 00:33:25,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:33:25,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:33:25,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:33:25,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:33:25,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:25" (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-11-07 00:33:26,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:33:26,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:33:26,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:33:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:33:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:33:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:33:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-11-07 00:33:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:33:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 00:33:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 00:33:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 00:33:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:33:26,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:33:26,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 00:33:26,368 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:33:26,368 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 00:33:26,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:33:26 BoogieIcfgContainer [2019-11-07 00:33:26,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:33:26,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:33:26,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:33:26,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:33:26,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:33:25" (1/3) ... [2019-11-07 00:33:26,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2682fff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:33:26, skipping insertion in model container [2019-11-07 00:33:26,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:25" (2/3) ... [2019-11-07 00:33:26,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2682fff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:33:26, skipping insertion in model container [2019-11-07 00:33:26,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:33:26" (3/3) ... [2019-11-07 00:33:26,377 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-11-07 00:33:26,386 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:33:26,396 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-07 00:33:26,407 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-07 00:33:26,435 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:33:26,435 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:33:26,435 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:33:26,436 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:33:26,436 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:33:26,436 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:33:26,436 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:33:26,436 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:33:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-07 00:33:26,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 00:33:26,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:26,461 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:26,463 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:26,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2019-11-07 00:33:26,475 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:26,475 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606596960] [2019-11-07 00:33:26,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:26,694 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606596960] [2019-11-07 00:33:26,695 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:26,695 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:33:26,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630948860] [2019-11-07 00:33:26,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:33:26,703 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:26,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:33:26,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:33:26,717 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-11-07 00:33:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:26,767 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2019-11-07 00:33:26,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:33:26,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-07 00:33:26,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:26,779 INFO L225 Difference]: With dead ends: 56 [2019-11-07 00:33:26,780 INFO L226 Difference]: Without dead ends: 34 [2019-11-07 00:33:26,783 INFO L630 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-11-07 00:33:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-07 00:33:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-11-07 00:33:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-07 00:33:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-11-07 00:33:26,823 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2019-11-07 00:33:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:26,824 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-07 00:33:26,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:33:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-11-07 00:33:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 00:33:26,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:26,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:26,826 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:26,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:26,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2019-11-07 00:33:26,827 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:26,827 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114991089] [2019-11-07 00:33:26,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:26,911 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114991089] [2019-11-07 00:33:26,911 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:26,912 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:33:26,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218469493] [2019-11-07 00:33:26,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:33:26,914 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:26,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:33:26,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:33:26,915 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2019-11-07 00:33:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:26,966 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-11-07 00:33:26,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:33:26,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-07 00:33:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:26,972 INFO L225 Difference]: With dead ends: 53 [2019-11-07 00:33:26,972 INFO L226 Difference]: Without dead ends: 51 [2019-11-07 00:33:26,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:33:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-07 00:33:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-11-07 00:33:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-07 00:33:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-11-07 00:33:26,989 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2019-11-07 00:33:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:26,989 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-11-07 00:33:26,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:33:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-11-07 00:33:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 00:33:26,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:26,994 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:26,994 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:26,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:26,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2019-11-07 00:33:26,995 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:26,995 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511834711] [2019-11-07 00:33:26,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:27,071 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511834711] [2019-11-07 00:33:27,072 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:27,074 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:33:27,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540564863] [2019-11-07 00:33:27,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:33:27,075 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:27,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:33:27,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:33:27,076 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2019-11-07 00:33:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:27,118 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-11-07 00:33:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:33:27,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-07 00:33:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:27,121 INFO L225 Difference]: With dead ends: 62 [2019-11-07 00:33:27,121 INFO L226 Difference]: Without dead ends: 41 [2019-11-07 00:33:27,122 INFO L630 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-11-07 00:33:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-07 00:33:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-11-07 00:33:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-07 00:33:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-07 00:33:27,128 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2019-11-07 00:33:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:27,129 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-07 00:33:27,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:33:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-07 00:33:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:33:27,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:27,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:27,130 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:27,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:27,131 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2019-11-07 00:33:27,131 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:27,131 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032565776] [2019-11-07 00:33:27,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:27,175 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032565776] [2019-11-07 00:33:27,175 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:27,175 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:33:27,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625903111] [2019-11-07 00:33:27,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:33:27,178 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:27,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:33:27,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:33:27,179 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2019-11-07 00:33:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:27,220 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-11-07 00:33:27,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:33:27,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-07 00:33:27,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:27,222 INFO L225 Difference]: With dead ends: 56 [2019-11-07 00:33:27,222 INFO L226 Difference]: Without dead ends: 35 [2019-11-07 00:33:27,223 INFO L630 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-11-07 00:33:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-07 00:33:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-11-07 00:33:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-07 00:33:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-11-07 00:33:27,228 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-11-07 00:33:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:27,228 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-11-07 00:33:27,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:33:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-11-07 00:33:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:33:27,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:27,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:27,230 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:27,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:27,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2019-11-07 00:33:27,231 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:27,231 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865686615] [2019-11-07 00:33:27,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:28,032 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 40 [2019-11-07 00:33:28,293 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 44 [2019-11-07 00:33:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:28,314 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865686615] [2019-11-07 00:33:28,314 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:28,314 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:33:28,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337260553] [2019-11-07 00:33:28,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:33:28,315 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:28,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:33:28,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:33:28,319 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 9 states. [2019-11-07 00:33:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:30,668 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-11-07 00:33:30,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:33:30,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-07 00:33:30,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:30,670 INFO L225 Difference]: With dead ends: 47 [2019-11-07 00:33:30,671 INFO L226 Difference]: Without dead ends: 31 [2019-11-07 00:33:30,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:33:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-07 00:33:30,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-07 00:33:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-07 00:33:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-11-07 00:33:30,677 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-11-07 00:33:30,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:30,678 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-11-07 00:33:30,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:33:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-11-07 00:33:30,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 00:33:30,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:30,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:30,680 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:30,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:30,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2019-11-07 00:33:30,680 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:30,681 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2532737] [2019-11-07 00:33:30,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:30,740 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2532737] [2019-11-07 00:33:30,741 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:33:30,741 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:33:30,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247699548] [2019-11-07 00:33:30,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:33:30,742 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:30,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:33:30,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:33:30,743 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2019-11-07 00:33:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:30,807 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-11-07 00:33:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:33:30,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-07 00:33:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:30,809 INFO L225 Difference]: With dead ends: 44 [2019-11-07 00:33:30,809 INFO L226 Difference]: Without dead ends: 42 [2019-11-07 00:33:30,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:33:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-07 00:33:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-11-07 00:33:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-07 00:33:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-11-07 00:33:30,815 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2019-11-07 00:33:30,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:30,816 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-11-07 00:33:30,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:33:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-11-07 00:33:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 00:33:30,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:33:30,817 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:33:30,818 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:33:30,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:30,818 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2019-11-07 00:33:30,819 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:33:30,819 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189246019] [2019-11-07 00:33:30,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:33:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:41,530 WARN L191 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-11-07 00:33:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:44,298 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189246019] [2019-11-07 00:33:44,298 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187965824] [2019-11-07 00:33:44,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:33:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:33:44,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-07 00:33:44,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:33:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:45,575 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:33:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:33:52,628 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [269717836] [2019-11-07 00:33:52,634 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 24 [2019-11-07 00:33:52,677 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:33:52,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:33:52,762 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-07 00:33:52,764 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 0. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 38 variables. [2019-11-07 00:33:52,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:33:52,769 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-07 00:33:52,813 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-11-07 00:33:52,814 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-07 00:33:52,818 INFO L553 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2019-11-07 00:33:52,818 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-07 00:33:52,819 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:33:52,819 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8, 4, 4] total 12 [2019-11-07 00:33:52,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879714405] [2019-11-07 00:33:52,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 00:33:52,820 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:33:52,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:33:52,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=93, Unknown=2, NotChecked=0, Total=132 [2019-11-07 00:33:52,821 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 2 states. [2019-11-07 00:33:52,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:33:52,824 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-07 00:33:52,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 00:33:52,825 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-11-07 00:33:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:33:52,825 INFO L225 Difference]: With dead ends: 28 [2019-11-07 00:33:52,825 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:33:52,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=37, Invalid=93, Unknown=2, NotChecked=0, Total=132 [2019-11-07 00:33:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:33:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:33:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:33:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:33:52,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-07 00:33:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:33:52,827 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:33:52,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 00:33:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:33:52,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:33:53,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:33:53,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:33:53,069 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:33:53,070 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:33:53,070 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:33:53,070 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:33:53,070 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:33:53,070 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:33:53,070 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:33:53,070 INFO L446 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2019-11-07 00:33:53,071 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2019-11-07 00:33:53,071 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2019-11-07 00:33:53,071 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-11-07 00:33:53,071 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2019-11-07 00:33:53,071 INFO L439 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: false [2019-11-07 00:33:53,071 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-11-07 00:33:53,071 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2019-11-07 00:33:53,071 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2019-11-07 00:33:53,071 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-11-07 00:33:53,072 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-11-07 00:33:53,072 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: false [2019-11-07 00:33:53,072 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2019-11-07 00:33:53,072 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-11-07 00:33:53,072 INFO L439 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: false [2019-11-07 00:33:53,072 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2019-11-07 00:33:53,072 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-07 00:33:53,072 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-11-07 00:33:53,072 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2019-11-07 00:33:53,072 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-11-07 00:33:53,073 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2019-11-07 00:33:53,073 INFO L439 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: false [2019-11-07 00:33:53,073 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2019-11-07 00:33:53,073 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-07 00:33:53,073 INFO L443 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-11-07 00:33:53,073 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-07 00:33:53,073 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: true [2019-11-07 00:33:53,073 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2019-11-07 00:33:53,074 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-11-07 00:33:53,074 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-11-07 00:33:53,074 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-11-07 00:33:53,074 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-11-07 00:33:53,074 INFO L439 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: false [2019-11-07 00:33:53,074 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-07 00:33:53,074 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-11-07 00:33:53,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:33:53 BoogieIcfgContainer [2019-11-07 00:33:53,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:33:53,085 INFO L168 Benchmark]: Toolchain (without parser) took 27601.40 ms. Allocated memory was 138.4 MB in the beginning and 244.3 MB in the end (delta: 105.9 MB). Free memory was 103.2 MB in the beginning and 152.7 MB in the end (delta: -49.5 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2019-11-07 00:33:53,086 INFO L168 Benchmark]: CDTParser took 1.13 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-07 00:33:53,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.05 ms. Allocated memory was 138.4 MB in the beginning and 204.5 MB in the end (delta: 66.1 MB). Free memory was 103.0 MB in the beginning and 182.1 MB in the end (delta: -79.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:33:53,088 INFO L168 Benchmark]: Boogie Preprocessor took 64.78 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 180.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:33:53,089 INFO L168 Benchmark]: RCFGBuilder took 421.06 ms. Allocated memory is still 204.5 MB. Free memory was 180.0 MB in the beginning and 159.7 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-11-07 00:33:53,090 INFO L168 Benchmark]: TraceAbstraction took 26713.00 ms. Allocated memory was 204.5 MB in the beginning and 244.3 MB in the end (delta: 39.8 MB). Free memory was 159.7 MB in the beginning and 152.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-11-07 00:33:53,094 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 393.05 ms. Allocated memory was 138.4 MB in the beginning and 204.5 MB in the end (delta: 66.1 MB). Free memory was 103.0 MB in the beginning and 182.1 MB in the end (delta: -79.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.78 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 180.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 421.06 ms. Allocated memory is still 204.5 MB. Free memory was 180.0 MB in the beginning and 159.7 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26713.00 ms. Allocated memory was 204.5 MB in the beginning and 244.3 MB in the end (delta: 39.8 MB). Free memory was 159.7 MB in the beginning and 152.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 4 error locations. Result: SAFE, OverallTime: 26.6s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 201 SDtfs, 157 SDslu, 258 SDs, 0 SdLazy, 109 SolverSat, 11 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 22.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 13 NumberOfFragments, 12 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 30832 SizeOfPredicates, 3 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 135, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9772727272727273, AVG_VARS_REMOVED_DURING_WEAKENING: 1.4545454545454546, AVG_WEAKENED_CONJUNCTS: 0.9545454545454546, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...