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 -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:12:02,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:12:02,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:12:02,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:12:02,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:12:02,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:12:02,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:12:02,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:12:02,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:12:02,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:12:02,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:12:02,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:12:02,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:12:02,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:12:02,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:12:02,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:12:02,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:12:02,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:12:02,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:12:02,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:12:02,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:12:02,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:12:02,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:12:02,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:12:02,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:12:02,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:12:02,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:12:02,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:12:02,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:12:02,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:12:02,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:12:02,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:12:02,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:12:02,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:12:02,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:12:02,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:12:02,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:12:02,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:12:02,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:12:02,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:12:02,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:12:02,342 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-09-16 16:12:02,356 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:12:02,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:12:02,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:12:02,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:12:02,357 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:12:02,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:12:02,358 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:12:02,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:12:02,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:12:02,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:12:02,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:12:02,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:12:02,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:12:02,359 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:12:02,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:12:02,360 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:12:02,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:12:02,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:12:02,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:12:02,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:12:02,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:12:02,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:12:02,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:12:02,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:12:02,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:12:02,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:12:02,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:12:02,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:12:02,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:12:02,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:12:02,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:12:02,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:12:02,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:12:02,417 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:12:02,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-09-16 16:12:02,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f13840f9/669f886f490a42628311d8ee9cb1cbc9/FLAG46c7b82ba [2019-09-16 16:12:02,966 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:12:02,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-09-16 16:12:02,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f13840f9/669f886f490a42628311d8ee9cb1cbc9/FLAG46c7b82ba [2019-09-16 16:12:03,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f13840f9/669f886f490a42628311d8ee9cb1cbc9 [2019-09-16 16:12:03,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:12:03,322 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:12:03,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:12:03,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:12:03,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:12:03,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:12:03" (1/1) ... [2019-09-16 16:12:03,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f7d25d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:12:03, skipping insertion in model container [2019-09-16 16:12:03,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:12:03" (1/1) ... [2019-09-16 16:12:03,335 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:12:03,368 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:12:03,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:12:03,596 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:12:03,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:12:03,729 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:12:03,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:12:03 WrapperNode [2019-09-16 16:12:03,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:12:03,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:12:03,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:12:03,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:12:03,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:12:03" (1/1) ... [2019-09-16 16:12:03,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:12:03" (1/1) ... [2019-09-16 16:12:03,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:12:03" (1/1) ... [2019-09-16 16:12:03,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:12:03" (1/1) ... [2019-09-16 16:12:03,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:12:03" (1/1) ... [2019-09-16 16:12:03,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:12:03" (1/1) ... [2019-09-16 16:12:03,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:12:03" (1/1) ... [2019-09-16 16:12:03,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:12:03,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:12:03,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:12:03,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:12:03,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:12:03" (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-09-16 16:12:03,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:12:03,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:12:03,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:12:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:12:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 16:12:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 16:12:03,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:12:03,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:12:03,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:12:03,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:12:04,244 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:12:04,244 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-16 16:12:04,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:12:04 BoogieIcfgContainer [2019-09-16 16:12:04,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:12:04,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:12:04,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:12:04,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:12:04,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:12:03" (1/3) ... [2019-09-16 16:12:04,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8d522d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:12:04, skipping insertion in model container [2019-09-16 16:12:04,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:12:03" (2/3) ... [2019-09-16 16:12:04,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8d522d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:12:04, skipping insertion in model container [2019-09-16 16:12:04,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:12:04" (3/3) ... [2019-09-16 16:12:04,255 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-09-16 16:12:04,268 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:12:04,279 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-09-16 16:12:04,295 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-09-16 16:12:04,326 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:12:04,327 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:12:04,327 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:12:04,327 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:12:04,328 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:12:04,328 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:12:04,328 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:12:04,328 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:12:04,328 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:12:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-09-16 16:12:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-16 16:12:04,353 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:12:04,354 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:12:04,356 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:12:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:12:04,360 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2019-09-16 16:12:04,362 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:12:04,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:12:04,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:04,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:12:04,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:04,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:12:04,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:12:04,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:12:04,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:12:04,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:12:04,583 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2019-09-16 16:12:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:12:04,829 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2019-09-16 16:12:04,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:12:04,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-16 16:12:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:12:04,850 INFO L225 Difference]: With dead ends: 131 [2019-09-16 16:12:04,850 INFO L226 Difference]: Without dead ends: 111 [2019-09-16 16:12:04,856 INFO L636 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-09-16 16:12:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-16 16:12:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-09-16 16:12:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-16 16:12:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-09-16 16:12:04,921 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2019-09-16 16:12:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:12:04,922 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-09-16 16:12:04,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:12:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-09-16 16:12:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-16 16:12:04,923 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:12:04,923 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:12:04,924 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:12:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:12:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2019-09-16 16:12:04,925 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:12:04,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:12:04,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:04,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:12:04,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:05,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:12:05,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:12:05,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:12:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:12:05,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:12:05,026 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2019-09-16 16:12:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:12:05,133 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-09-16 16:12:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:12:05,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-16 16:12:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:12:05,137 INFO L225 Difference]: With dead ends: 111 [2019-09-16 16:12:05,137 INFO L226 Difference]: Without dead ends: 109 [2019-09-16 16:12:05,138 INFO L636 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-09-16 16:12:05,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-16 16:12:05,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2019-09-16 16:12:05,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-16 16:12:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-09-16 16:12:05,148 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2019-09-16 16:12:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:12:05,149 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-09-16 16:12:05,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:12:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-09-16 16:12:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 16:12:05,150 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:12:05,151 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:12:05,151 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:12:05,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:12:05,152 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2019-09-16 16:12:05,152 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:12:05,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:12:05,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:05,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:12:05,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:05,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:12:05,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:12:05,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:12:05,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:12:05,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:12:05,226 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2019-09-16 16:12:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:12:05,350 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-09-16 16:12:05,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:12:05,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-16 16:12:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:12:05,353 INFO L225 Difference]: With dead ends: 73 [2019-09-16 16:12:05,353 INFO L226 Difference]: Without dead ends: 71 [2019-09-16 16:12:05,354 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:12:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-16 16:12:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-09-16 16:12:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-16 16:12:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-16 16:12:05,371 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-09-16 16:12:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:12:05,372 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-16 16:12:05,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:12:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-16 16:12:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 16:12:05,374 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:12:05,375 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:12:05,375 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:12:05,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:12:05,376 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2019-09-16 16:12:05,377 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:12:05,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:12:05,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:05,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:12:05,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:05,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:12:05,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:12:05,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:12:05,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:12:05,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:12:05,468 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-09-16 16:12:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:12:05,579 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-16 16:12:05,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:12:05,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-16 16:12:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:12:05,581 INFO L225 Difference]: With dead ends: 71 [2019-09-16 16:12:05,581 INFO L226 Difference]: Without dead ends: 69 [2019-09-16 16:12:05,582 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:12:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-16 16:12:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-16 16:12:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-16 16:12:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-16 16:12:05,589 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2019-09-16 16:12:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:12:05,589 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-16 16:12:05,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:12:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-16 16:12:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 16:12:05,590 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:12:05,591 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:12:05,591 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:12:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:12:05,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2019-09-16 16:12:05,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:12:05,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:12:05,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:05,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:12:05,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:05,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:12:05,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:12:05,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:12:05,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:12:05,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:12:05,663 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-09-16 16:12:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:12:05,797 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-09-16 16:12:05,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:12:05,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-16 16:12:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:12:05,800 INFO L225 Difference]: With dead ends: 116 [2019-09-16 16:12:05,800 INFO L226 Difference]: Without dead ends: 114 [2019-09-16 16:12:05,800 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:12:05,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-16 16:12:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2019-09-16 16:12:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-16 16:12:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-16 16:12:05,807 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2019-09-16 16:12:05,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:12:05,808 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-16 16:12:05,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:12:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-16 16:12:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 16:12:05,809 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:12:05,809 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:12:05,810 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:12:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:12:05,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2019-09-16 16:12:05,811 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:12:05,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:12:05,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:05,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:12:05,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:05,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:12:05,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:12:05,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:12:05,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:12:05,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:12:05,862 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-09-16 16:12:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:12:05,986 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-09-16 16:12:05,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:12:05,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-16 16:12:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:12:05,988 INFO L225 Difference]: With dead ends: 101 [2019-09-16 16:12:05,988 INFO L226 Difference]: Without dead ends: 99 [2019-09-16 16:12:05,988 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:12:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-16 16:12:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-09-16 16:12:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-16 16:12:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-16 16:12:06,005 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2019-09-16 16:12:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:12:06,005 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-16 16:12:06,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:12:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-16 16:12:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 16:12:06,006 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:12:06,006 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:12:06,007 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:12:06,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:12:06,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2019-09-16 16:12:06,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:12:06,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:12:06,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:06,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:12:06,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:06,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:12:06,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:12:06,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:12:06,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:12:06,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:12:06,087 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-09-16 16:12:06,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:12:06,162 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-09-16 16:12:06,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:12:06,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-16 16:12:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:12:06,166 INFO L225 Difference]: With dead ends: 65 [2019-09-16 16:12:06,166 INFO L226 Difference]: Without dead ends: 61 [2019-09-16 16:12:06,167 INFO L636 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-09-16 16:12:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-16 16:12:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-16 16:12:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-16 16:12:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-16 16:12:06,172 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-09-16 16:12:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:12:06,172 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-16 16:12:06,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:12:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-16 16:12:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 16:12:06,173 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:12:06,174 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:12:06,175 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:12:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:12:06,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2019-09-16 16:12:06,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:12:06,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:12:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:06,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:12:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:06,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:12:06,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:12:06,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:12:06,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:12:06,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:12:06,234 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-09-16 16:12:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:12:06,289 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-09-16 16:12:06,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:12:06,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-16 16:12:06,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:12:06,291 INFO L225 Difference]: With dead ends: 61 [2019-09-16 16:12:06,291 INFO L226 Difference]: Without dead ends: 57 [2019-09-16 16:12:06,291 INFO L636 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-09-16 16:12:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-16 16:12:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-16 16:12:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-16 16:12:06,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-16 16:12:06,301 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2019-09-16 16:12:06,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:12:06,302 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-16 16:12:06,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:12:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-16 16:12:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 16:12:06,303 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:12:06,303 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:12:06,306 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:12:06,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:12:06,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2019-09-16 16:12:06,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:12:06,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:12:06,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:06,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:12:06,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:06,361 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: NonCoreBooleanSubTermTransformer does not support AnnotatedTerm at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer$NonCoreBooleanSubtermTransformerHelper.convert(NonCoreBooleanSubTermTransformer.java:107) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer.transform(NonCoreBooleanSubTermTransformer.java:51) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:585) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-16 16:12:06,367 INFO L168 Benchmark]: Toolchain (without parser) took 3044.44 ms. Allocated memory was 131.1 MB in the beginning and 218.6 MB in the end (delta: 87.6 MB). Free memory was 85.6 MB in the beginning and 108.4 MB in the end (delta: -22.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:12:06,368 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 131.1 MB. Free memory was 104.0 MB in the beginning and 103.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-16 16:12:06,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.11 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 85.4 MB in the beginning and 173.3 MB in the end (delta: -87.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:12:06,370 INFO L168 Benchmark]: Boogie Preprocessor took 33.72 ms. Allocated memory is still 198.2 MB. Free memory was 173.3 MB in the beginning and 171.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:12:06,371 INFO L168 Benchmark]: RCFGBuilder took 481.99 ms. Allocated memory is still 198.2 MB. Free memory was 171.4 MB in the beginning and 146.5 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:12:06,372 INFO L168 Benchmark]: TraceAbstraction took 2117.23 ms. Allocated memory was 198.2 MB in the beginning and 218.6 MB in the end (delta: 20.4 MB). Free memory was 145.8 MB in the beginning and 108.4 MB in the end (delta: 37.4 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:12:06,376 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.19 ms. Allocated memory is still 131.1 MB. Free memory was 104.0 MB in the beginning and 103.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 407.11 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 85.4 MB in the beginning and 173.3 MB in the end (delta: -87.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.72 ms. Allocated memory is still 198.2 MB. Free memory was 173.3 MB in the beginning and 171.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 481.99 ms. Allocated memory is still 198.2 MB. Free memory was 171.4 MB in the beginning and 146.5 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2117.23 ms. Allocated memory was 198.2 MB in the beginning and 218.6 MB in the end (delta: 20.4 MB). Free memory was 145.8 MB in the beginning and 108.4 MB in the end (delta: 37.4 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: NonCoreBooleanSubTermTransformer does not support AnnotatedTerm de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: NonCoreBooleanSubTermTransformer does not support AnnotatedTerm: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer$NonCoreBooleanSubtermTransformerHelper.convert(NonCoreBooleanSubTermTransformer.java:107) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...