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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:31:53,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:31:53,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:31:53,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:31:53,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:31:53,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:31:53,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:31:53,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:31:53,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:31:53,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:31:53,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:31:53,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:31:53,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:31:53,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:31:53,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:31:53,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:31:53,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:31:53,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:31:53,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:31:53,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:31:53,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:31:53,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:31:53,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:31:53,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:31:53,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:31:53,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:31:53,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:31:53,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:31:53,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:31:53,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:31:53,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:31:53,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:31:53,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:31:53,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:31:53,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:31:53,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:31:53,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:31:53,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:31:53,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:31:53,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:31:53,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:31:53,535 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:31:53,560 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:31:53,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:31:53,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:31:53,561 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:31:53,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:31:53,562 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:31:53,562 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:31:53,562 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:31:53,562 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:31:53,563 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:31:53,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:31:53,564 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:31:53,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:31:53,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:31:53,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:31:53,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:31:53,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:31:53,565 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:31:53,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:31:53,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:31:53,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:31:53,566 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:31:53,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:31:53,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:31:53,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:31:53,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:31:53,567 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:31:53,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:31:53,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:31:53,567 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:31:53,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:31:53,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:31:53,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:31:53,612 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:31:53,613 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:31:53,613 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-10-03 02:31:53,673 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cc34d36c/0a9d5d3a1831474a85d99f497ef883b8/FLAG34d11fcbd [2019-10-03 02:31:54,126 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:31:54,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-03 02:31:54,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cc34d36c/0a9d5d3a1831474a85d99f497ef883b8/FLAG34d11fcbd [2019-10-03 02:31:54,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cc34d36c/0a9d5d3a1831474a85d99f497ef883b8 [2019-10-03 02:31:54,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:31:54,529 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:31:54,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:31:54,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:31:54,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:31:54,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:31:54" (1/1) ... [2019-10-03 02:31:54,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774ea263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:54, skipping insertion in model container [2019-10-03 02:31:54,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:31:54" (1/1) ... [2019-10-03 02:31:54,546 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:31:54,570 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:31:54,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:31:54,788 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:31:54,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:31:54,930 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:31:54,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:54 WrapperNode [2019-10-03 02:31:54,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:31:54,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:31:54,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:31:54,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:31:54,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:54" (1/1) ... [2019-10-03 02:31:54,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:54" (1/1) ... [2019-10-03 02:31:54,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:54" (1/1) ... [2019-10-03 02:31:54,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:54" (1/1) ... [2019-10-03 02:31:54,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:54" (1/1) ... [2019-10-03 02:31:54,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:54" (1/1) ... [2019-10-03 02:31:54,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:54" (1/1) ... [2019-10-03 02:31:54,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:31:54,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:31:54,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:31:54,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:31:54,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:54" (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-10-03 02:31:55,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:31:55,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:31:55,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:31:55,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:31:55,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:31:55,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:31:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-03 02:31:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:31:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:31:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:31:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:31:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:31:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:31:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:31:55,406 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:31:55,407 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:31:55,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:31:55 BoogieIcfgContainer [2019-10-03 02:31:55,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:31:55,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:31:55,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:31:55,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:31:55,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:31:54" (1/3) ... [2019-10-03 02:31:55,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b9f04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:31:55, skipping insertion in model container [2019-10-03 02:31:55,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:54" (2/3) ... [2019-10-03 02:31:55,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b9f04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:31:55, skipping insertion in model container [2019-10-03 02:31:55,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:31:55" (3/3) ... [2019-10-03 02:31:55,416 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-03 02:31:55,424 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:31:55,431 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-03 02:31:55,447 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-03 02:31:55,475 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:31:55,475 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:31:55,475 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:31:55,476 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:31:55,476 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:31:55,476 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:31:55,476 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:31:55,476 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:31:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-10-03 02:31:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-03 02:31:55,502 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:55,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:55,505 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2019-10-03 02:31:55,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:55,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:55,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:55,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:55,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:55,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:55,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:55,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:55,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:55,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:55,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:55,741 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-10-03 02:31:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:55,793 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-10-03 02:31:55,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:55,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-03 02:31:55,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:55,811 INFO L225 Difference]: With dead ends: 42 [2019-10-03 02:31:55,811 INFO L226 Difference]: Without dead ends: 34 [2019-10-03 02:31:55,815 INFO L640 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-10-03 02:31:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-03 02:31:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-03 02:31:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-03 02:31:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-10-03 02:31:55,873 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2019-10-03 02:31:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:55,874 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-10-03 02:31:55,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-10-03 02:31:55,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-03 02:31:55,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:55,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:55,879 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2019-10-03 02:31:55,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:55,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:55,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:55,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:55,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:31:55,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:55,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:31:55,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:31:55,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:31:55,999 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2019-10-03 02:31:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:56,044 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-10-03 02:31:56,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:31:56,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-03 02:31:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:56,046 INFO L225 Difference]: With dead ends: 51 [2019-10-03 02:31:56,046 INFO L226 Difference]: Without dead ends: 51 [2019-10-03 02:31:56,047 INFO L640 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-10-03 02:31:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-03 02:31:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-10-03 02:31:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-03 02:31:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-03 02:31:56,055 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2019-10-03 02:31:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:56,056 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-03 02:31:56,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:31:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-03 02:31:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-03 02:31:56,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:56,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:56,058 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:56,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:56,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2019-10-03 02:31:56,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:56,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:56,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:56,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:56,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:56,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:56,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:56,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:56,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:56,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:56,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:56,097 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2019-10-03 02:31:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:56,146 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-10-03 02:31:56,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:56,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-03 02:31:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:56,148 INFO L225 Difference]: With dead ends: 41 [2019-10-03 02:31:56,148 INFO L226 Difference]: Without dead ends: 41 [2019-10-03 02:31:56,149 INFO L640 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-10-03 02:31:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-03 02:31:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-10-03 02:31:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-03 02:31:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-03 02:31:56,153 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2019-10-03 02:31:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:56,154 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-03 02:31:56,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-03 02:31:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-03 02:31:56,155 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:56,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:56,155 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:56,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2019-10-03 02:31:56,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:56,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:56,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:56,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:56,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:56,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:56,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:56,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:56,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:56,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:56,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:56,192 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2019-10-03 02:31:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:56,242 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-10-03 02:31:56,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:56,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-03 02:31:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:56,243 INFO L225 Difference]: With dead ends: 35 [2019-10-03 02:31:56,244 INFO L226 Difference]: Without dead ends: 35 [2019-10-03 02:31:56,244 INFO L640 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-10-03 02:31:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-03 02:31:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-10-03 02:31:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-03 02:31:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-10-03 02:31:56,248 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-10-03 02:31:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:56,249 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-10-03 02:31:56,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-10-03 02:31:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:31:56,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:56,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:56,250 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:56,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:56,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2019-10-03 02:31:56,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:56,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:56,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:56,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:56,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:57,271 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 88 [2019-10-03 02:31:57,720 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 91 [2019-10-03 02:31:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:57,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:57,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:31:57,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:57,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:31:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:31:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:31:57,746 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 9 states. [2019-10-03 02:31:59,083 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 42 [2019-10-03 02:31:59,268 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 46 [2019-10-03 02:32:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:00,032 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-10-03 02:32:00,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:32:00,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-03 02:32:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:00,040 INFO L225 Difference]: With dead ends: 31 [2019-10-03 02:32:00,040 INFO L226 Difference]: Without dead ends: 31 [2019-10-03 02:32:00,041 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:32:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-03 02:32:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-03 02:32:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-03 02:32:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-10-03 02:32:00,047 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-10-03 02:32:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:00,047 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-10-03 02:32:00,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:32:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-10-03 02:32:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:32:00,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:00,048 INFO L411 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-10-03 02:32:00,049 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:00,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:00,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2019-10-03 02:32:00,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:00,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:00,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:00,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:00,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:32:00,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:00,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:32:00,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:32:00,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:00,130 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2019-10-03 02:32:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:00,198 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-10-03 02:32:00,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:32:00,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-03 02:32:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:00,200 INFO L225 Difference]: With dead ends: 42 [2019-10-03 02:32:00,200 INFO L226 Difference]: Without dead ends: 42 [2019-10-03 02:32:00,200 INFO L640 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-10-03 02:32:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-03 02:32:00,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-10-03 02:32:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-03 02:32:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-10-03 02:32:00,204 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2019-10-03 02:32:00,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:00,204 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-10-03 02:32:00,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:32:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-10-03 02:32:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:32:00,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:00,205 INFO L411 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-10-03 02:32:00,206 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:00,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2019-10-03 02:32:00,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:00,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:00,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:00,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:00,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:00,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:00,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:00,410 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2019-10-03 02:32:00,412 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [58], [61], [65], [68], [69], [71], [73], [106], [107], [108] [2019-10-03 02:32:00,458 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:00,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:00,530 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:32:00,533 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-10-03 02:32:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:00,537 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:32:00,575 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-03 02:32:00,575 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:32:00,577 INFO L420 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2019-10-03 02:32:00,577 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:32:00,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:32:00,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:32:00,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:00,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:32:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:32:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:32:00,579 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 2 states. [2019-10-03 02:32:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:00,580 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-10-03 02:32:00,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:32:00,580 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-10-03 02:32:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:00,581 INFO L225 Difference]: With dead ends: 6 [2019-10-03 02:32:00,581 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:32:00,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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-10-03 02:32:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:32:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:32:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:32:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:32:00,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-10-03 02:32:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:00,582 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:32:00,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:32:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:32:00,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:32:00,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:32:00 BoogieIcfgContainer [2019-10-03 02:32:00,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:32:00,590 INFO L168 Benchmark]: Toolchain (without parser) took 6060.57 ms. Allocated memory was 133.2 MB in the beginning and 258.5 MB in the end (delta: 125.3 MB). Free memory was 89.4 MB in the beginning and 171.8 MB in the end (delta: -82.5 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:00,591 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:32:00,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.62 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 89.1 MB in the beginning and 176.1 MB in the end (delta: -87.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:00,593 INFO L168 Benchmark]: Boogie Preprocessor took 39.44 ms. Allocated memory is still 200.8 MB. Free memory was 176.1 MB in the beginning and 174.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:00,594 INFO L168 Benchmark]: RCFGBuilder took 437.44 ms. Allocated memory is still 200.8 MB. Free memory was 174.3 MB in the beginning and 154.1 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:00,595 INFO L168 Benchmark]: TraceAbstraction took 5178.31 ms. Allocated memory was 200.8 MB in the beginning and 258.5 MB in the end (delta: 57.7 MB). Free memory was 153.5 MB in the beginning and 171.8 MB in the end (delta: -18.3 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:00,599 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 400.62 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 89.1 MB in the beginning and 176.1 MB in the end (delta: -87.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.44 ms. Allocated memory is still 200.8 MB. Free memory was 176.1 MB in the beginning and 174.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 437.44 ms. Allocated memory is still 200.8 MB. Free memory was 174.3 MB in the beginning and 154.1 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5178.31 ms. Allocated memory was 200.8 MB in the beginning and 258.5 MB in the end (delta: 57.7 MB). Free memory was 153.5 MB in the beginning and 171.8 MB in the end (delta: -18.3 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: 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: 162]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 4 error locations. SAFE Result, 5.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 201 SDtfs, 157 SDslu, 258 SDs, 0 SdLazy, 110 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.5s 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.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9772727272727273 AbsIntWeakeningRatio, 1.4545454545454546 AbsIntAvgWeakeningVarsNumRemoved, 0.9545454545454546 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 53974 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...