java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:19:39,989 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:19:39,991 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:19:40,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:19:40,002 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:19:40,003 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:19:40,003 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:19:40,004 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:19:40,006 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:19:40,007 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:19:40,008 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:19:40,008 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:19:40,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:19:40,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:19:40,010 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:19:40,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:19:40,014 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:19:40,015 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:19:40,016 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:19:40,017 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:19:40,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:19:40,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:19:40,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:19:40,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:19:40,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:19:40,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:19:40,022 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:19:40,023 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:19:40,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:19:40,023 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:19:40,024 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:19:40,024 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:19:40,034 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:19:40,034 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:19:40,035 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:19:40,035 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:19:40,035 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:19:40,035 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:19:40,036 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:19:40,036 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:19:40,036 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:19:40,036 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:19:40,036 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:19:40,036 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:19:40,037 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:19:40,037 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:19:40,037 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:19:40,037 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:19:40,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:19:40,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:19:40,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:19:40,038 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:19:40,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:19:40,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:19:40,038 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:19:40,038 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:19:40,038 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:19:40,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:19:40,081 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:19:40,085 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:19:40,086 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:19:40,087 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:19:40,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i [2018-02-04 04:19:40,232 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:19:40,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:19:40,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:19:40,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:19:40,239 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:19:40,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:19:40" (1/1) ... [2018-02-04 04:19:40,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fbafac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:40, skipping insertion in model container [2018-02-04 04:19:40,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:19:40" (1/1) ... [2018-02-04 04:19:40,257 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:19:40,288 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:19:40,387 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:19:40,401 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:19:40,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:40 WrapperNode [2018-02-04 04:19:40,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:19:40,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:19:40,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:19:40,408 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:19:40,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:40" (1/1) ... [2018-02-04 04:19:40,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:40" (1/1) ... [2018-02-04 04:19:40,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:40" (1/1) ... [2018-02-04 04:19:40,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:40" (1/1) ... [2018-02-04 04:19:40,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:40" (1/1) ... [2018-02-04 04:19:40,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:40" (1/1) ... [2018-02-04 04:19:40,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:40" (1/1) ... [2018-02-04 04:19:40,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:19:40,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:19:40,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:19:40,438 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:19:40,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:40" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-02-04 04:19:40,473 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:19:40,473 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:19:40,473 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:19:40,473 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:19:40,473 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:19:40,473 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:19:40,473 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:19:40,474 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:19:40,474 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:19:40,474 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:19:40,474 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:19:40,474 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:19:40,474 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:19:40,474 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 04:19:40,474 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:19:40,475 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:19:40,475 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:19:40,837 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:19:40,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:19:40 BoogieIcfgContainer [2018-02-04 04:19:40,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:19:40,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:19:40,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:19:40,841 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:19:40,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:19:40" (1/3) ... [2018-02-04 04:19:40,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a086ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:19:40, skipping insertion in model container [2018-02-04 04:19:40,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:40" (2/3) ... [2018-02-04 04:19:40,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a086ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:19:40, skipping insertion in model container [2018-02-04 04:19:40,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:19:40" (3/3) ... [2018-02-04 04:19:40,844 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-token_true-unreach-call_true-valid-memsafety.i [2018-02-04 04:19:40,850 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:19:40,861 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-02-04 04:19:40,893 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:19:40,893 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:19:40,893 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:19:40,893 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:19:40,893 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:19:40,894 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:19:40,894 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:19:40,894 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:19:40,895 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:19:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-02-04 04:19:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 04:19:40,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:40,914 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:40,914 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 04:19:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1807775718, now seen corresponding path program 1 times [2018-02-04 04:19:40,918 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:40,918 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:40,950 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:40,950 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:40,950 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:40,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:19:41,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:19:41,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:19:41,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:19:41,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:19:41,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:19:41,060 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 4 states. [2018-02-04 04:19:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:41,271 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-02-04 04:19:41,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:19:41,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 04:19:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:41,282 INFO L225 Difference]: With dead ends: 136 [2018-02-04 04:19:41,283 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 04:19:41,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:19:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 04:19:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2018-02-04 04:19:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 04:19:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-02-04 04:19:41,320 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 8 [2018-02-04 04:19:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:41,320 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-02-04 04:19:41,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:19:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-02-04 04:19:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 04:19:41,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:41,321 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:41,322 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 04:19:41,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1807775717, now seen corresponding path program 1 times [2018-02-04 04:19:41,322 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:41,322 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:41,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:41,323 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:41,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:41,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:19:41,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:19:41,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:19:41,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:19:41,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:19:41,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:19:41,377 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 4 states. [2018-02-04 04:19:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:41,492 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-02-04 04:19:41,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:19:41,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 04:19:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:41,496 INFO L225 Difference]: With dead ends: 131 [2018-02-04 04:19:41,496 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 04:19:41,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:19:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 04:19:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2018-02-04 04:19:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 04:19:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-02-04 04:19:41,503 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 8 [2018-02-04 04:19:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:41,504 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-02-04 04:19:41,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:19:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-02-04 04:19:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 04:19:41,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:41,505 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:41,505 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 04:19:41,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1410075710, now seen corresponding path program 1 times [2018-02-04 04:19:41,505 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:41,505 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:41,506 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:41,506 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:41,506 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:41,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:19:41,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:19:41,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:19:41,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:19:41,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:19:41,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:19:41,558 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 4 states. [2018-02-04 04:19:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:41,707 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-02-04 04:19:41,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:19:41,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 04:19:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:41,708 INFO L225 Difference]: With dead ends: 111 [2018-02-04 04:19:41,709 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 04:19:41,709 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:19:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 04:19:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2018-02-04 04:19:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 04:19:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-02-04 04:19:41,715 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 14 [2018-02-04 04:19:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:41,715 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-02-04 04:19:41,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:19:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-02-04 04:19:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 04:19:41,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:41,716 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:41,716 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 04:19:41,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1410075709, now seen corresponding path program 1 times [2018-02-04 04:19:41,716 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:41,716 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:41,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:41,717 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:41,718 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:41,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:19:41,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:19:41,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:19:41,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:19:41,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:19:41,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:19:41,785 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 5 states. [2018-02-04 04:19:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:41,926 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2018-02-04 04:19:41,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:19:41,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 04:19:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:41,927 INFO L225 Difference]: With dead ends: 166 [2018-02-04 04:19:41,927 INFO L226 Difference]: Without dead ends: 166 [2018-02-04 04:19:41,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:19:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-04 04:19:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131. [2018-02-04 04:19:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-04 04:19:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-02-04 04:19:41,935 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 14 [2018-02-04 04:19:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:41,935 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-02-04 04:19:41,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:19:41,935 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-02-04 04:19:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 04:19:41,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:41,936 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:41,936 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 04:19:41,936 INFO L82 PathProgramCache]: Analyzing trace with hash -444857017, now seen corresponding path program 1 times [2018-02-04 04:19:41,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:41,937 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:41,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:41,937 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:41,938 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:41,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:19:42,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:19:42,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:19:42,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:19:42,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:19:42,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:19:42,008 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 5 states. [2018-02-04 04:19:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:42,142 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-02-04 04:19:42,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:19:42,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 04:19:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:42,144 INFO L225 Difference]: With dead ends: 130 [2018-02-04 04:19:42,144 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 04:19:42,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:19:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 04:19:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-02-04 04:19:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 04:19:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-02-04 04:19:42,150 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 18 [2018-02-04 04:19:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:42,150 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-02-04 04:19:42,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:19:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-02-04 04:19:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 04:19:42,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:42,151 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:42,151 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 04:19:42,151 INFO L82 PathProgramCache]: Analyzing trace with hash -444857018, now seen corresponding path program 1 times [2018-02-04 04:19:42,151 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:42,151 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:42,152 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:42,152 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:42,152 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:42,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:19:42,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:19:42,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:19:42,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:19:42,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:19:42,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:19:42,196 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 5 states. [2018-02-04 04:19:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:42,299 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2018-02-04 04:19:42,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:19:42,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 04:19:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:42,300 INFO L225 Difference]: With dead ends: 131 [2018-02-04 04:19:42,301 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 04:19:42,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:19:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 04:19:42,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-02-04 04:19:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 04:19:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-02-04 04:19:42,306 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 18 [2018-02-04 04:19:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:42,307 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-02-04 04:19:42,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:19:42,307 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-02-04 04:19:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 04:19:42,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:42,308 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:42,308 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 04:19:42,308 INFO L82 PathProgramCache]: Analyzing trace with hash -418196060, now seen corresponding path program 1 times [2018-02-04 04:19:42,308 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:42,308 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:42,309 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:42,309 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:42,309 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:42,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:19:42,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:19:42,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:19:42,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:19:42,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:19:42,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:19:42,350 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 6 states. [2018-02-04 04:19:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:42,537 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions. [2018-02-04 04:19:42,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:19:42,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 04:19:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:42,538 INFO L225 Difference]: With dead ends: 188 [2018-02-04 04:19:42,538 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 04:19:42,539 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:19:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 04:19:42,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 128. [2018-02-04 04:19:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 04:19:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-02-04 04:19:42,542 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 18 [2018-02-04 04:19:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:42,542 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-02-04 04:19:42,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:19:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-02-04 04:19:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 04:19:42,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:42,542 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:42,543 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 04:19:42,543 INFO L82 PathProgramCache]: Analyzing trace with hash -418196059, now seen corresponding path program 1 times [2018-02-04 04:19:42,543 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:42,543 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:42,543 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:42,543 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:42,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:42,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:19:42,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:19:42,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:19:42,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:19:42,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:19:42,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:19:42,597 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 6 states. [2018-02-04 04:19:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:42,766 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-02-04 04:19:42,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:19:42,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 04:19:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:42,767 INFO L225 Difference]: With dead ends: 210 [2018-02-04 04:19:42,767 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 04:19:42,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:19:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 04:19:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 112. [2018-02-04 04:19:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 04:19:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-02-04 04:19:42,770 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 18 [2018-02-04 04:19:42,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:42,770 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-02-04 04:19:42,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:19:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-02-04 04:19:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 04:19:42,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:42,771 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:42,771 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 04:19:42,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1163379848, now seen corresponding path program 1 times [2018-02-04 04:19:42,771 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:42,771 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:42,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:42,772 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:42,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:42,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:42,798 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) 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:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 04:19:42,801 INFO L168 Benchmark]: Toolchain (without parser) took 2568.24 ms. Allocated memory was 395.8 MB in the beginning and 618.1 MB in the end (delta: 222.3 MB). Free memory was 352.7 MB in the beginning and 455.6 MB in the end (delta: -102.9 MB). Peak memory consumption was 119.4 MB. Max. memory is 5.3 GB. [2018-02-04 04:19:42,802 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 395.8 MB. Free memory is still 359.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:19:42,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.56 ms. Allocated memory is still 395.8 MB. Free memory was 352.7 MB in the beginning and 340.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:19:42,802 INFO L168 Benchmark]: Boogie Preprocessor took 30.39 ms. Allocated memory is still 395.8 MB. Free memory was 340.8 MB in the beginning and 339.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:19:42,802 INFO L168 Benchmark]: RCFGBuilder took 399.72 ms. Allocated memory is still 395.8 MB. Free memory was 339.5 MB in the beginning and 306.9 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:19:42,803 INFO L168 Benchmark]: TraceAbstraction took 1961.94 ms. Allocated memory was 395.8 MB in the beginning and 618.1 MB in the end (delta: 222.3 MB). Free memory was 306.9 MB in the beginning and 455.6 MB in the end (delta: -148.7 MB). Peak memory consumption was 73.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:19:42,804 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 395.8 MB. Free memory is still 359.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.56 ms. Allocated memory is still 395.8 MB. Free memory was 352.7 MB in the beginning and 340.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.39 ms. Allocated memory is still 395.8 MB. Free memory was 340.8 MB in the beginning and 339.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 399.72 ms. Allocated memory is still 395.8 MB. Free memory was 339.5 MB in the beginning and 306.9 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1961.94 ms. Allocated memory was 395.8 MB in the beginning and 618.1 MB in the end (delta: 222.3 MB). Free memory was 306.9 MB in the beginning and 455.6 MB in the end (delta: -148.7 MB). Peak memory consumption was 73.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-19-42-810.csv Received shutdown request...