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/bitvector/num_conversion_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 12:52:19,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 12:52:19,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 12:52:19,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 12:52:19,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 12:52:19,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 12:52:19,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 12:52:19,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 12:52:19,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 12:52:19,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 12:52:19,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 12:52:19,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 12:52:19,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 12:52:19,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 12:52:19,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 12:52:19,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 12:52:19,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 12:52:19,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 12:52:19,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 12:52:19,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 12:52:19,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 12:52:19,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 12:52:19,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 12:52:19,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 12:52:19,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 12:52:19,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 12:52:19,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 12:52:19,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 12:52:19,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 12:52:19,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 12:52:19,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 12:52:19,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 12:52:19,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 12:52:19,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 12:52:19,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 12:52:19,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 12:52:19,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 12:52:19,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 12:52:19,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 12:52:19,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 12:52:19,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 12:52:19,432 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-07 12:52:19,455 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 12:52:19,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 12:52:19,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 12:52:19,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 12:52:19,458 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 12:52:19,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 12:52:19,459 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 12:52:19,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 12:52:19,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 12:52:19,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 12:52:19,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 12:52:19,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 12:52:19,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 12:52:19,461 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 12:52:19,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 12:52:19,462 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 12:52:19,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 12:52:19,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 12:52:19,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 12:52:19,463 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 12:52:19,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 12:52:19,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 12:52:19,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 12:52:19,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 12:52:19,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 12:52:19,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 12:52:19,465 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 12:52:19,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 12:52:19,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 12:52:19,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 12:52:19,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 12:52:19,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 12:52:19,530 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 12:52:19,530 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 12:52:19,531 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/num_conversion_1.c [2019-09-07 12:52:19,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e06c2fd/cc81a7526757485d8ded3b4d53646c8f/FLAG3889e22f3 [2019-09-07 12:52:20,032 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 12:52:20,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_1.c [2019-09-07 12:52:20,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e06c2fd/cc81a7526757485d8ded3b4d53646c8f/FLAG3889e22f3 [2019-09-07 12:52:20,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e06c2fd/cc81a7526757485d8ded3b4d53646c8f [2019-09-07 12:52:20,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 12:52:20,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 12:52:20,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 12:52:20,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 12:52:20,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 12:52:20,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:52:20" (1/1) ... [2019-09-07 12:52:20,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175078d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:52:20, skipping insertion in model container [2019-09-07 12:52:20,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:52:20" (1/1) ... [2019-09-07 12:52:20,412 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 12:52:20,433 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 12:52:20,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:52:20,625 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 12:52:20,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:52:20,654 INFO L192 MainTranslator]: Completed translation [2019-09-07 12:52:20,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:52:20 WrapperNode [2019-09-07 12:52:20,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 12:52:20,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 12:52:20,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 12:52:20,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 12:52:20,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:52:20" (1/1) ... [2019-09-07 12:52:20,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:52:20" (1/1) ... [2019-09-07 12:52:20,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:52:20" (1/1) ... [2019-09-07 12:52:20,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:52:20" (1/1) ... [2019-09-07 12:52:20,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:52:20" (1/1) ... [2019-09-07 12:52:20,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:52:20" (1/1) ... [2019-09-07 12:52:20,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:52:20" (1/1) ... [2019-09-07 12:52:20,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 12:52:20,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 12:52:20,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 12:52:20,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 12:52:20,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:52:20" (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-07 12:52:20,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 12:52:20,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 12:52:20,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 12:52:20,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 12:52:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 12:52:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 12:52:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 12:52:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 12:52:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 12:52:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 12:52:20,979 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 12:52:20,980 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 12:52:20,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:52:20 BoogieIcfgContainer [2019-09-07 12:52:20,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 12:52:20,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 12:52:20,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 12:52:20,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 12:52:20,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 12:52:20" (1/3) ... [2019-09-07 12:52:20,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659491e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:52:20, skipping insertion in model container [2019-09-07 12:52:20,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:52:20" (2/3) ... [2019-09-07 12:52:20,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659491e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:52:20, skipping insertion in model container [2019-09-07 12:52:20,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:52:20" (3/3) ... [2019-09-07 12:52:20,994 INFO L109 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2019-09-07 12:52:21,005 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 12:52:21,016 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 12:52:21,072 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 12:52:21,115 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 12:52:21,115 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 12:52:21,116 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 12:52:21,116 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 12:52:21,116 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 12:52:21,116 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 12:52:21,116 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 12:52:21,116 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 12:52:21,117 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 12:52:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-07 12:52:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-07 12:52:21,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:52:21,137 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:52:21,139 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:52:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:52:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2019-09-07 12:52:21,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:52:21,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:52:21,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:21,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:52:21,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:52:21,237 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-07 12:52:21,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:52:21,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 12:52:21,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 12:52:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 12:52:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 12:52:21,258 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-09-07 12:52:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:52:21,276 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-09-07 12:52:21,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 12:52:21,278 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-07 12:52:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:52:21,285 INFO L225 Difference]: With dead ends: 32 [2019-09-07 12:52:21,285 INFO L226 Difference]: Without dead ends: 13 [2019-09-07 12:52:21,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 12:52:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-07 12:52:21,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-07 12:52:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-07 12:52:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-07 12:52:21,316 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-07 12:52:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:52:21,316 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-07 12:52:21,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 12:52:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-07 12:52:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-07 12:52:21,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:52:21,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:52:21,318 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:52:21,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:52:21,318 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2019-09-07 12:52:21,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:52:21,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:52:21,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:21,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:52:21,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:52:21,423 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-07 12:52:21,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:52:21,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:52:21,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:52:21,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:52:21,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:52:21,426 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-09-07 12:52:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:52:21,445 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-09-07 12:52:21,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:52:21,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-07 12:52:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:52:21,446 INFO L225 Difference]: With dead ends: 21 [2019-09-07 12:52:21,447 INFO L226 Difference]: Without dead ends: 16 [2019-09-07 12:52:21,448 INFO L628 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-09-07 12:52:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-07 12:52:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-09-07 12:52:21,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-07 12:52:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-07 12:52:21,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-07 12:52:21,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:52:21,453 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-07 12:52:21,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:52:21,454 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-07 12:52:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-07 12:52:21,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:52:21,454 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:52:21,455 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:52:21,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:52:21,455 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2019-09-07 12:52:21,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:52:21,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:52:21,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:21,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:52:21,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:52:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:52:21,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:52:21,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:52:21,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:52:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:52:21,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 12:52:21,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:52:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:52:21,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:52:21,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 12:52:21,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:52:21,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:52:21,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:52:21,715 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-07 12:52:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:52:21,750 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-09-07 12:52:21,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 12:52:21,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-07 12:52:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:52:21,752 INFO L225 Difference]: With dead ends: 24 [2019-09-07 12:52:21,753 INFO L226 Difference]: Without dead ends: 19 [2019-09-07 12:52:21,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:52:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-07 12:52:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-09-07 12:52:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-07 12:52:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-09-07 12:52:21,759 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-09-07 12:52:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:52:21,760 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-09-07 12:52:21,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:52:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-09-07 12:52:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 12:52:21,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:52:21,761 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:52:21,761 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:52:21,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:52:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1182180650, now seen corresponding path program 2 times [2019-09-07 12:52:21,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:52:21,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:52:21,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:21,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:52:21,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:52:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:52:21,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:52:21,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:52:21,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 12:52:21,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:52:21,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:52:21,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 12:52:21,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:52:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:52:21,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:52:21,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-07 12:52:21,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 12:52:21,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 12:52:21,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:52:21,980 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2019-09-07 12:52:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:52:22,050 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-09-07 12:52:22,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:52:22,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-07 12:52:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:52:22,052 INFO L225 Difference]: With dead ends: 27 [2019-09-07 12:52:22,052 INFO L226 Difference]: Without dead ends: 22 [2019-09-07 12:52:22,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:52:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-07 12:52:22,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-09-07 12:52:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-07 12:52:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-09-07 12:52:22,063 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2019-09-07 12:52:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:52:22,063 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-09-07 12:52:22,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 12:52:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-09-07 12:52:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 12:52:22,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:52:22,066 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:52:22,067 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:52:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:52:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2055818357, now seen corresponding path program 3 times [2019-09-07 12:52:22,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:52:22,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:52:22,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:22,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:52:22,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:52:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:52:22,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:52:22,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:52:22,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 12:52:22,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 12:52:22,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:52:22,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 12:52:22,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:52:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:52:22,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:52:22,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-09-07 12:52:22,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 12:52:22,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 12:52:22,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:52:22,393 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 9 states. [2019-09-07 12:52:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:52:22,453 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-09-07 12:52:22,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 12:52:22,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-09-07 12:52:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:52:22,455 INFO L225 Difference]: With dead ends: 30 [2019-09-07 12:52:22,455 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 12:52:22,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:52:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 12:52:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-09-07 12:52:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 12:52:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-07 12:52:22,461 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2019-09-07 12:52:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:52:22,462 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-07 12:52:22,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 12:52:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-07 12:52:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 12:52:22,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:52:22,463 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:52:22,463 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:52:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:52:22,464 INFO L82 PathProgramCache]: Analyzing trace with hash 318767734, now seen corresponding path program 4 times [2019-09-07 12:52:22,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:52:22,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:52:22,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:22,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:52:22,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:52:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:52:22,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:52:22,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:52:22,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:52:22,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:52:22,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:52:22,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 12:52:22,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:52:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:52:22,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:52:22,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-07 12:52:22,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:52:22,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:52:22,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:52:22,721 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 11 states. [2019-09-07 12:52:22,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:52:22,853 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-09-07 12:52:22,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 12:52:22,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-09-07 12:52:22,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:52:22,855 INFO L225 Difference]: With dead ends: 33 [2019-09-07 12:52:22,855 INFO L226 Difference]: Without dead ends: 28 [2019-09-07 12:52:22,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:52:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-07 12:52:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-09-07 12:52:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-07 12:52:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-09-07 12:52:22,862 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 22 [2019-09-07 12:52:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:52:22,862 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-09-07 12:52:22,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:52:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-09-07 12:52:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 12:52:22,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:52:22,863 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:52:22,864 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:52:22,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:52:22,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1904607445, now seen corresponding path program 5 times [2019-09-07 12:52:22,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:52:22,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:52:22,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:22,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:52:22,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:52:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:52:23,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:52:23,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:52:23,038 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:52:23,066 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-07 12:52:23,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:52:23,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 12:52:23,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:52:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:52:23,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:52:23,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-09-07 12:52:23,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 12:52:23,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 12:52:23,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:52:23,235 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 13 states. [2019-09-07 12:52:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:52:23,407 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-09-07 12:52:23,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 12:52:23,407 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-09-07 12:52:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:52:23,408 INFO L225 Difference]: With dead ends: 36 [2019-09-07 12:52:23,409 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 12:52:23,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:52:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 12:52:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-09-07 12:52:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 12:52:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-09-07 12:52:23,417 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 25 [2019-09-07 12:52:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:52:23,417 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-09-07 12:52:23,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 12:52:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-09-07 12:52:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-07 12:52:23,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:52:23,419 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:52:23,419 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:52:23,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:52:23,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1015181846, now seen corresponding path program 6 times [2019-09-07 12:52:23,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:52:23,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:52:23,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:23,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:52:23,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:52:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:52:23,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:52:23,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:52:23,594 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 12:52:23,636 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 12:52:23,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:52:23,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 12:52:23,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:52:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:52:23,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:52:23,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-09-07 12:52:24,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 12:52:24,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 12:52:24,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-09-07 12:52:24,001 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 15 states. [2019-09-07 12:52:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:52:24,163 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-09-07 12:52:24,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 12:52:24,166 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-09-07 12:52:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:52:24,167 INFO L225 Difference]: With dead ends: 39 [2019-09-07 12:52:24,167 INFO L226 Difference]: Without dead ends: 34 [2019-09-07 12:52:24,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-09-07 12:52:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-07 12:52:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-07 12:52:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 12:52:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-09-07 12:52:24,174 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 28 [2019-09-07 12:52:24,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:52:24,175 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-09-07 12:52:24,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 12:52:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-09-07 12:52:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 12:52:24,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:52:24,176 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:52:24,176 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:52:24,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:52:24,177 INFO L82 PathProgramCache]: Analyzing trace with hash -209588939, now seen corresponding path program 7 times [2019-09-07 12:52:24,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:52:24,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:52:24,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:24,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:52:24,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:52:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:52:24,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:52:24,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:52:24,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:52:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:52:24,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 12:52:24,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:52:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:52:24,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:52:24,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-07 12:52:24,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 12:52:24,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 12:52:24,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-09-07 12:52:24,754 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 17 states. [2019-09-07 12:52:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:52:25,004 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-09-07 12:52:25,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:52:25,006 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-09-07 12:52:25,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:52:25,007 INFO L225 Difference]: With dead ends: 42 [2019-09-07 12:52:25,007 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 12:52:25,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-09-07 12:52:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 12:52:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-07 12:52:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-07 12:52:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-09-07 12:52:25,014 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 31 [2019-09-07 12:52:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:52:25,014 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-09-07 12:52:25,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 12:52:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-09-07 12:52:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 12:52:25,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:52:25,016 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:52:25,016 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:52:25,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:52:25,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1608865354, now seen corresponding path program 8 times [2019-09-07 12:52:25,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:52:25,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:52:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:25,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:52:25,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:52:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 12:52:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 12:52:25,069 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-07 12:52:25,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 12:52:25 BoogieIcfgContainer [2019-09-07 12:52:25,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 12:52:25,108 INFO L168 Benchmark]: Toolchain (without parser) took 4715.19 ms. Allocated memory was 142.1 MB in the beginning and 254.8 MB in the end (delta: 112.7 MB). Free memory was 89.8 MB in the beginning and 226.3 MB in the end (delta: -136.6 MB). Peak memory consumption was 112.8 MB. Max. memory is 7.1 GB. [2019-09-07 12:52:25,110 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 108.2 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 12:52:25,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.82 ms. Allocated memory is still 142.1 MB. Free memory was 89.6 MB in the beginning and 80.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-09-07 12:52:25,113 INFO L168 Benchmark]: Boogie Preprocessor took 121.21 ms. Allocated memory was 142.1 MB in the beginning and 200.8 MB in the end (delta: 58.7 MB). Free memory was 80.2 MB in the beginning and 178.4 MB in the end (delta: -98.3 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-09-07 12:52:25,116 INFO L168 Benchmark]: RCFGBuilder took 205.10 ms. Allocated memory is still 200.8 MB. Free memory was 177.9 MB in the beginning and 167.5 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-09-07 12:52:25,117 INFO L168 Benchmark]: TraceAbstraction took 4120.30 ms. Allocated memory was 200.8 MB in the beginning and 254.8 MB in the end (delta: 54.0 MB). Free memory was 167.0 MB in the beginning and 226.3 MB in the end (delta: -59.4 MB). Peak memory consumption was 131.2 MB. Max. memory is 7.1 GB. [2019-09-07 12:52:25,124 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.21 ms. Allocated memory is still 142.1 MB. Free memory was 108.2 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 258.82 ms. Allocated memory is still 142.1 MB. Free memory was 89.6 MB in the beginning and 80.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.21 ms. Allocated memory was 142.1 MB in the beginning and 200.8 MB in the end (delta: 58.7 MB). Free memory was 80.2 MB in the beginning and 178.4 MB in the end (delta: -98.3 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 205.10 ms. Allocated memory is still 200.8 MB. Free memory was 177.9 MB in the beginning and 167.5 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4120.30 ms. Allocated memory was 200.8 MB in the beginning and 254.8 MB in the end (delta: 54.0 MB). Free memory was 167.0 MB in the beginning and 226.3 MB in the end (delta: -59.4 MB). Peak memory consumption was 131.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 22, overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L14] unsigned char x; [L15] unsigned char y; [L16] unsigned char c; [L18] x = 37 [L19] y = 0 [L20] c = 0 VAL [c=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=0, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=0, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=1, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=1, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=1, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=2, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=2, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=2, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=3, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=3, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=3, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=4, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=4, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=4, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=5, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=5, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=5, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=6, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=6, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=6, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=7, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=7, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=7, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=8, i=0, x=37, y=0] [L21] COND FALSE !(c < (unsigned char)8) VAL [bit=1, c=8, i=0, x=37, y=0] [L29] CALL __VERIFIER_assert(x == y) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 3.9s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 173 SDtfs, 130 SDslu, 914 SDs, 0 SdLazy, 667 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 113 SyntacticMatches, 25 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 312 ConstructedInterpolants, 70 QuantifiedInterpolants, 70206 SizeOfPredicates, 11 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 0/392 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...