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/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:25:01,094 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:25:01,095 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:25:01,107 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:25:01,107 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:25:01,108 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:25:01,108 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:25:01,110 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:25:01,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:25:01,112 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:25:01,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:25:01,113 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:25:01,114 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:25:01,115 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:25:01,116 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:25:01,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:25:01,119 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:25:01,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:25:01,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:25:01,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:25:01,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:25:01,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:25:01,124 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:25:01,125 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:25:01,126 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:25:01,127 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:25:01,127 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:25:01,127 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:25:01,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:25:01,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:25:01,128 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:25:01,128 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 19:25:01,137 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:25:01,137 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:25:01,137 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:25:01,138 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:25:01,138 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:25:01,138 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:25:01,138 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:25:01,138 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:25:01,138 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:25:01,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:25:01,138 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:25:01,138 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:25:01,139 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:25:01,139 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:25:01,139 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:25:01,139 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:25:01,139 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:25:01,139 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:25:01,139 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:25:01,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:25:01,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:25:01,140 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:25:01,140 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:25:01,140 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:25:01,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:25:01,176 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:25:01,178 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:25:01,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:25:01,179 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:25:01,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-02-04 19:25:01,328 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:25:01,330 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:25:01,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:25:01,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:25:01,334 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:25:01,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:25:01" (1/1) ... [2018-02-04 19:25:01,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b089594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:25:01, skipping insertion in model container [2018-02-04 19:25:01,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:25:01" (1/1) ... [2018-02-04 19:25:01,352 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:25:01,399 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:25:01,486 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:25:01,504 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:25:01,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:25:01 WrapperNode [2018-02-04 19:25:01,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:25:01,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:25:01,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:25:01,513 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:25:01,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:25:01" (1/1) ... [2018-02-04 19:25:01,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:25:01" (1/1) ... [2018-02-04 19:25:01,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:25:01" (1/1) ... [2018-02-04 19:25:01,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:25:01" (1/1) ... [2018-02-04 19:25:01,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:25:01" (1/1) ... [2018-02-04 19:25:01,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:25:01" (1/1) ... [2018-02-04 19:25:01,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:25:01" (1/1) ... [2018-02-04 19:25:01,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:25:01,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:25:01,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:25:01,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:25:01,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:25:01" (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 19:25:01,579 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:25:01,579 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:25:01,579 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:25:01,579 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-02-04 19:25:01,579 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-02-04 19:25:01,579 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-02-04 19:25:01,579 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-02-04 19:25:01,579 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-02-04 19:25:01,579 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:25:01,580 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-02-04 19:25:01,580 INFO L128 BoogieDeclarations]: Found specification of procedure probe_19 [2018-02-04 19:25:01,581 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-02-04 19:25:01,581 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:25:01,581 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:25:01,581 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:25:01,581 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:25:01,825 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:25:01,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:25:01 BoogieIcfgContainer [2018-02-04 19:25:01,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:25:01,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:25:01,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:25:01,827 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:25:01,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:25:01" (1/3) ... [2018-02-04 19:25:01,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107b14dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:25:01, skipping insertion in model container [2018-02-04 19:25:01,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:25:01" (2/3) ... [2018-02-04 19:25:01,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107b14dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:25:01, skipping insertion in model container [2018-02-04 19:25:01,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:25:01" (3/3) ... [2018-02-04 19:25:01,830 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-02-04 19:25:01,837 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:25:01,841 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-04 19:25:01,869 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:25:01,869 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:25:01,869 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:25:01,869 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:25:01,869 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:25:01,869 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:25:01,869 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:25:01,869 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:25:01,870 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:25:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-02-04 19:25:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 19:25:01,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:01,888 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:01,888 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:01,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506467, now seen corresponding path program 1 times [2018-02-04 19:25:01,892 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:01,892 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:01,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:01,928 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:01,928 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:01,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:02,173 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 19:25:02,175 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:02,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:25:02,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:25:02,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:25:02,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:25:02,191 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 6 states. [2018-02-04 19:25:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:02,495 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-02-04 19:25:02,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:25:02,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 19:25:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:02,507 INFO L225 Difference]: With dead ends: 136 [2018-02-04 19:25:02,508 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 19:25:02,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:25:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 19:25:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-02-04 19:25:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 19:25:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-02-04 19:25:02,546 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-02-04 19:25:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:02,546 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-02-04 19:25:02,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:25:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-02-04 19:25:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 19:25:02,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:02,548 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:02,548 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:02,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506468, now seen corresponding path program 1 times [2018-02-04 19:25:02,549 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:02,549 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:02,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:02,550 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:02,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:02,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:02,644 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 19:25:02,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:02,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:25:02,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:25:02,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:25:02,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:25:02,647 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-02-04 19:25:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:02,924 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2018-02-04 19:25:02,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:25:02,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 19:25:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:02,926 INFO L225 Difference]: With dead ends: 126 [2018-02-04 19:25:02,926 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 19:25:02,927 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:25:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 19:25:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-02-04 19:25:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 19:25:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-02-04 19:25:02,936 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 15 [2018-02-04 19:25:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:02,936 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-02-04 19:25:02,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:25:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-02-04 19:25:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:25:02,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:02,937 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:02,937 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:02,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488357, now seen corresponding path program 1 times [2018-02-04 19:25:02,938 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:02,938 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:02,940 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:02,940 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:02,940 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:02,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:02,968 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:25:02,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:02,968 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:02,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:03,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:03,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:25:03,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:03,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:03,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:25:03,050 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 19:25:03,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:25:03,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:03,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:25:03,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 19:25:03,082 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 19:25:03,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:03,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:25:03,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:25:03,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:25:03,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-02-04 19:25:03,083 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 7 states. [2018-02-04 19:25:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:03,317 INFO L93 Difference]: Finished difference Result 130 states and 153 transitions. [2018-02-04 19:25:03,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:25:03,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 19:25:03,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:03,319 INFO L225 Difference]: With dead ends: 130 [2018-02-04 19:25:03,319 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 19:25:03,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2018-02-04 19:25:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 19:25:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2018-02-04 19:25:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 19:25:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-02-04 19:25:03,328 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 17 [2018-02-04 19:25:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:03,328 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-02-04 19:25:03,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:25:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-02-04 19:25:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:25:03,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:03,329 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:03,329 INFO L371 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:03,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488358, now seen corresponding path program 1 times [2018-02-04 19:25:03,329 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:03,329 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:03,330 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:03,331 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:03,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:03,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:03,347 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:25:03,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:03,348 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:03,348 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:03,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:03,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:25:03,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:03,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:25:03,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:03,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:03,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:25:03,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:03,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-02-04 19:25:03,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:03,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:03,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:03,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-02-04 19:25:03,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:03,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:03,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:03,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-02-04 19:25:03,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:03,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:03,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:03,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 19:25:03,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:03,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:25:03,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-04 19:25:03,580 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 19:25:03,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:03,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:25:03,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:25:03,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:25:03,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:25:03,581 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 8 states. [2018-02-04 19:25:18,114 WARN L143 SmtUtils]: Spent 12135ms on a formula simplification that was a NOOP. DAG size: 50 [2018-02-04 19:25:42,356 WARN L146 SmtUtils]: Spent 24229ms on a formula simplification. DAG size of input: 54 DAG size of output 54 [2018-02-04 19:25:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:46,528 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2018-02-04 19:25:46,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:25:46,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 19:25:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:46,529 INFO L225 Difference]: With dead ends: 149 [2018-02-04 19:25:46,529 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 19:25:46,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:25:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 19:25:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 92. [2018-02-04 19:25:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 19:25:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2018-02-04 19:25:46,535 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 17 [2018-02-04 19:25:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:46,535 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2018-02-04 19:25:46,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:25:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2018-02-04 19:25:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:25:46,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:46,536 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:46,536 INFO L371 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:46,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1193563309, now seen corresponding path program 1 times [2018-02-04 19:25:46,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:46,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:46,537 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:46,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:46,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:46,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:25:46,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:46,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:46,583 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:46,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:46,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:25:46,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:25:46,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:46,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:46,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:25:46,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:25:46,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:46,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:46,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:46,631 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-02-04 19:25:46,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:25:46,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 19:25:46,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:46,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:46,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:25:46,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 19:25:46,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:46,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:46,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:46,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-02-04 19:25:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:25:46,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:25:46,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-02-04 19:25:46,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:25:46,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:25:46,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:25:46,650 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 6 states. [2018-02-04 19:25:46,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:46,684 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-02-04 19:25:46,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:25:46,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 19:25:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:46,686 INFO L225 Difference]: With dead ends: 99 [2018-02-04 19:25:46,686 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 19:25:46,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:25:46,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 19:25:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-02-04 19:25:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 19:25:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2018-02-04 19:25:46,690 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 26 [2018-02-04 19:25:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:46,690 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2018-02-04 19:25:46,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:25:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2018-02-04 19:25:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:25:46,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:46,691 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] [2018-02-04 19:25:46,691 INFO L371 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:46,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443383, now seen corresponding path program 1 times [2018-02-04 19:25:46,691 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:46,691 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:46,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:46,692 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:46,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:46,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:46,746 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 19:25:46,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:46,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:25:46,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:25:46,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:25:46,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:25:46,747 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand 8 states. [2018-02-04 19:25:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:46,837 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2018-02-04 19:25:46,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:25:46,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-04 19:25:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:46,838 INFO L225 Difference]: With dead ends: 109 [2018-02-04 19:25:46,838 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 19:25:46,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:25:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 19:25:46,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-02-04 19:25:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 19:25:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2018-02-04 19:25:46,843 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 26 [2018-02-04 19:25:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:46,843 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2018-02-04 19:25:46,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:25:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2018-02-04 19:25:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:25:46,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:46,844 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] [2018-02-04 19:25:46,844 INFO L371 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443382, now seen corresponding path program 1 times [2018-02-04 19:25:46,844 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:46,844 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:46,845 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:46,845 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:46,845 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:46,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:46,875 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 19:25:46,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:46,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:25:46,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:25:46,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:25:46,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:25:46,876 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 6 states. [2018-02-04 19:25:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:46,891 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2018-02-04 19:25:46,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:25:46,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 19:25:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:46,892 INFO L225 Difference]: With dead ends: 105 [2018-02-04 19:25:46,892 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 19:25:46,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:25:46,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 19:25:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-02-04 19:25:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 19:25:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-02-04 19:25:46,895 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 26 [2018-02-04 19:25:46,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:46,895 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-02-04 19:25:46,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:25:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-02-04 19:25:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:25:46,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:46,895 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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 19:25:46,895 INFO L371 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:46,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265041, now seen corresponding path program 1 times [2018-02-04 19:25:46,896 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:46,896 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:46,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:46,896 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:46,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:46,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:25:46,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:46,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:25:46,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:25:46,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:25:46,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:25:46,937 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-02-04 19:25:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:47,053 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2018-02-04 19:25:47,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:25:47,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 19:25:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:47,054 INFO L225 Difference]: With dead ends: 111 [2018-02-04 19:25:47,054 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 19:25:47,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:25:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 19:25:47,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-02-04 19:25:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 19:25:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2018-02-04 19:25:47,058 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 28 [2018-02-04 19:25:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:47,059 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2018-02-04 19:25:47,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:25:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2018-02-04 19:25:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:25:47,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:47,060 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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 19:25:47,060 INFO L371 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:47,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265042, now seen corresponding path program 1 times [2018-02-04 19:25:47,060 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:47,060 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:47,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:47,061 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:47,062 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:47,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:25:47,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:47,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:25:47,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:25:47,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:25:47,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:25:47,127 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 9 states. [2018-02-04 19:25:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:47,323 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2018-02-04 19:25:47,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:25:47,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-04 19:25:47,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:47,324 INFO L225 Difference]: With dead ends: 111 [2018-02-04 19:25:47,324 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 19:25:47,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-02-04 19:25:47,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 19:25:47,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-02-04 19:25:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 19:25:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-02-04 19:25:47,330 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 28 [2018-02-04 19:25:47,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:47,331 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-02-04 19:25:47,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:25:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-02-04 19:25:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 19:25:47,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:47,332 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:47,332 INFO L371 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:47,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860499, now seen corresponding path program 1 times [2018-02-04 19:25:47,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:47,332 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:47,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:47,333 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:47,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:47,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:47,345 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:25:47,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:47,345 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:47,346 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:47,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:47,398 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 19:25:47,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:25:47,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:47,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:25:47,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 19:25:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:25:47,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:47,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:25:47,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:25:47,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:25:47,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-02-04 19:25:47,414 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 7 states. [2018-02-04 19:25:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:47,545 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-02-04 19:25:47,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:25:47,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 19:25:47,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:47,547 INFO L225 Difference]: With dead ends: 108 [2018-02-04 19:25:47,547 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 19:25:47,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2018-02-04 19:25:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 19:25:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2018-02-04 19:25:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 19:25:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-04 19:25:47,551 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 30 [2018-02-04 19:25:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:47,552 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-04 19:25:47,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:25:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-04 19:25:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 19:25:47,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:47,553 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:47,553 INFO L371 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:47,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860500, now seen corresponding path program 1 times [2018-02-04 19:25:47,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:47,553 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:47,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:47,554 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:47,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:47,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:47,568 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:25:47,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:47,568 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:47,569 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:47,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:47,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:25:47,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:47,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:25:47,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:47,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:47,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:25:47,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:47,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-02-04 19:25:47,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:47,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:47,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:47,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-02-04 19:25:47,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:47,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:47,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:47,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-02-04 19:25:47,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:47,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:47,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:47,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 19:25:47,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:47,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:25:47,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-04 19:25:47,906 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ldv_malloc_#in~size| 4294967296))) (or (and (< 2147483647 .cse0) (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| (+ (mod |c_ldv_malloc_#in~size| 4294967296) (- 4294967296))) |c_#length|))) (and (exists ((v_prenex_9 Int)) (= |c_#length| (store |c_old(#length)| v_prenex_9 (mod |c_ldv_malloc_#in~size| 4294967296)))) (<= .cse0 2147483647)))) is different from true [2018-02-04 19:25:47,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:47,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:47,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:47,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:47,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 56 [2018-02-04 19:25:47,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 19:25:47,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:47,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 38 [2018-02-04 19:25:47,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 19:25:48,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 12 dim-0 vars, and 6 xjuncts. [2018-02-04 19:25:48,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:61, output treesize:135 [2018-02-04 19:25:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 19:25:48,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:25:48,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 19:25:48,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 19:25:48,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 19:25:48,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=131, Unknown=2, NotChecked=22, Total=182 [2018-02-04 19:25:48,172 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 14 states. [2018-02-04 19:25:48,997 WARN L1033 $PredicateComparison]: unable to prove that (and (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= 0 (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|)) (< 2147483647 .cse0) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| (+ .cse0 (- 4294967296))))))) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse1 (mod v_prenex_5 4294967296))) (and (= (store |c_old(#length)| v_prenex_6 .cse1) |c_#length|) (<= .cse1 2147483647) (= 0 (select |c_old(#valid)| v_prenex_6)))))) (let ((.cse2 (mod |c_ldv_malloc_#in~size| 4294967296))) (or (and (< 2147483647 .cse2) (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| (+ (mod |c_ldv_malloc_#in~size| 4294967296) (- 4294967296))) |c_#length|))) (and (exists ((v_prenex_9 Int)) (= |c_#length| (store |c_old(#length)| v_prenex_9 (mod |c_ldv_malloc_#in~size| 4294967296)))) (<= .cse2 2147483647))))) is different from true [2018-02-04 19:25:58,021 WARN L146 SmtUtils]: Spent 4365ms on a formula simplification. DAG size of input: 50 DAG size of output 44 [2018-02-04 19:25:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:58,314 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-02-04 19:25:58,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:25:58,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-02-04 19:25:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:58,315 INFO L225 Difference]: With dead ends: 118 [2018-02-04 19:25:58,315 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 19:25:58,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=62, Invalid=281, Unknown=7, NotChecked=70, Total=420 [2018-02-04 19:25:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 19:25:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2018-02-04 19:25:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 19:25:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2018-02-04 19:25:58,317 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 30 [2018-02-04 19:25:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:58,317 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2018-02-04 19:25:58,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 19:25:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2018-02-04 19:25:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:25:58,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:58,318 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] [2018-02-04 19:25:58,318 INFO L371 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1708399928, now seen corresponding path program 1 times [2018-02-04 19:25:58,318 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:58,318 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:58,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:58,319 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:58,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:58,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:58,326 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:25:58,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:58,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:58,327 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:58,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:58,367 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 19:25:58,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:58,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:25:58,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:25:58,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:25:58,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=11, Unknown=1, NotChecked=0, Total=20 [2018-02-04 19:25:58,368 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 5 states. [2018-02-04 19:25:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:58,429 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2018-02-04 19:25:58,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:25:58,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 19:25:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:58,430 INFO L225 Difference]: With dead ends: 107 [2018-02-04 19:25:58,430 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 19:25:58,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=11, Unknown=1, NotChecked=0, Total=20 [2018-02-04 19:25:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 19:25:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-04 19:25:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 19:25:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-02-04 19:25:58,434 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 28 [2018-02-04 19:25:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:58,434 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-02-04 19:25:58,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:25:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-02-04 19:25:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 19:25:58,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:58,435 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] [2018-02-04 19:25:58,435 INFO L371 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash -526031434, now seen corresponding path program 1 times [2018-02-04 19:25:58,435 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:58,436 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:58,436 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:58,436 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:58,437 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:58,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:58,476 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 19:25:58,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:58,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:25:58,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:25:58,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:25:58,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:25:58,478 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 7 states. [2018-02-04 19:25:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:58,517 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-02-04 19:25:58,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:25:58,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 19:25:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:58,518 INFO L225 Difference]: With dead ends: 88 [2018-02-04 19:25:58,518 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 19:25:58,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:25:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 19:25:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-02-04 19:25:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 19:25:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-02-04 19:25:58,521 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 30 [2018-02-04 19:25:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:58,521 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-02-04 19:25:58,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:25:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-02-04 19:25:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 19:25:58,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:58,522 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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 19:25:58,522 INFO L371 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:58,522 INFO L82 PathProgramCache]: Analyzing trace with hash 850149805, now seen corresponding path program 1 times [2018-02-04 19:25:58,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:58,522 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:58,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:58,523 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:58,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:58,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:25:58,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:58,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:25:58,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:25:58,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:25:58,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:25:58,550 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 5 states. [2018-02-04 19:25:58,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:58,562 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-02-04 19:25:58,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:25:58,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-04 19:25:58,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:58,563 INFO L225 Difference]: With dead ends: 98 [2018-02-04 19:25:58,563 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 19:25:58,563 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:25:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 19:25:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2018-02-04 19:25:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 19:25:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-02-04 19:25:58,566 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 37 [2018-02-04 19:25:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:58,566 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-02-04 19:25:58,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:25:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-02-04 19:25:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 19:25:58,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:58,567 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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 19:25:58,567 INFO L371 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:58,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653486, now seen corresponding path program 1 times [2018-02-04 19:25:58,567 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:58,568 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:58,568 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:58,568 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:58,568 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:58,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:58,578 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:25:58,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:58,579 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:58,579 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:58,601 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:58,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:25:58,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:25:58,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-02-04 19:25:58,652 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.base Int) (|f19_#t~ret2.offset| Int) (f19_~a.offset Int)) (and (<= f19_~a.offset |c_f19_#in~a.offset|) (= (store |c_old(#memory_$Pointer$.offset)| f19_~a.base (store (select |c_old(#memory_$Pointer$.offset)| f19_~a.base) f19_~a.offset |f19_#t~ret2.offset|)) |c_#memory_$Pointer$.offset|))) is different from true [2018-02-04 19:25:58,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 19:25:58,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:25:58,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:9 [2018-02-04 19:25:58,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:25:58,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 19:25:58,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 19:25:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:25:58,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:25:58,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 19:25:58,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:25:58,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:25:58,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=57, Unknown=1, NotChecked=14, Total=90 [2018-02-04 19:25:58,713 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 10 states. [2018-02-04 19:25:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:58,844 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-02-04 19:25:58,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:25:58,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-02-04 19:25:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:58,845 INFO L225 Difference]: With dead ends: 104 [2018-02-04 19:25:58,845 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 19:25:58,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2018-02-04 19:25:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 19:25:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-02-04 19:25:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 19:25:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-02-04 19:25:58,848 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 37 [2018-02-04 19:25:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:58,848 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-02-04 19:25:58,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:25:58,848 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-02-04 19:25:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 19:25:58,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:58,849 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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 19:25:58,849 INFO L371 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:58,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653487, now seen corresponding path program 1 times [2018-02-04 19:25:58,849 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:58,849 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:58,850 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:58,850 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:58,851 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:58,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:58,863 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:25:58,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:25:58,863 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:25:58,864 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:58,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:25:58,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:25:58,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:25:58,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:25:58,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:25:58,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-02-04 19:25:58,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-02-04 19:25:58,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:25:58,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-02-04 19:25:58,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 19:25:58,990 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:58,998 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2018-02-04 19:25:59,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 19:25:59,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-02-04 19:25:59,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:25:59,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:59,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:25:59,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-02-04 19:25:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:25:59,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:25:59,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 19:25:59,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:25:59,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:25:59,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=84, Unknown=3, NotChecked=0, Total=110 [2018-02-04 19:25:59,011 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 11 states. [2018-02-04 19:25:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:59,169 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2018-02-04 19:25:59,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:25:59,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-02-04 19:25:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:59,170 INFO L225 Difference]: With dead ends: 113 [2018-02-04 19:25:59,170 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 19:25:59,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=144, Unknown=3, NotChecked=0, Total=182 [2018-02-04 19:25:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 19:25:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-02-04 19:25:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 19:25:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2018-02-04 19:25:59,172 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 37 [2018-02-04 19:25:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:59,173 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2018-02-04 19:25:59,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:25:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2018-02-04 19:25:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 19:25:59,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:59,173 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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 19:25:59,173 INFO L371 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:59,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1407897527, now seen corresponding path program 1 times [2018-02-04 19:25:59,173 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:59,173 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:59,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,174 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:59,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:59,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:25:59,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:59,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:25:59,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:25:59,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:25:59,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:25:59,217 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 6 states. [2018-02-04 19:25:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:59,250 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2018-02-04 19:25:59,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:25:59,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-02-04 19:25:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:59,251 INFO L225 Difference]: With dead ends: 102 [2018-02-04 19:25:59,251 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 19:25:59,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:25:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 19:25:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-02-04 19:25:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 19:25:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2018-02-04 19:25:59,253 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 38 [2018-02-04 19:25:59,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:59,254 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2018-02-04 19:25:59,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:25:59,254 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-02-04 19:25:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:25:59,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:59,254 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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 19:25:59,254 INFO L371 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:59,254 INFO L82 PathProgramCache]: Analyzing trace with hash 695150445, now seen corresponding path program 1 times [2018-02-04 19:25:59,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:59,254 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:59,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,255 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:59,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:59,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:25:59,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:59,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:25:59,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:25:59,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:25:59,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:25:59,312 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 7 states. [2018-02-04 19:25:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:59,355 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-02-04 19:25:59,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:25:59,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-04 19:25:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:59,357 INFO L225 Difference]: With dead ends: 97 [2018-02-04 19:25:59,357 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 19:25:59,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:25:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 19:25:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-02-04 19:25:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 19:25:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2018-02-04 19:25:59,360 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 39 [2018-02-04 19:25:59,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:59,360 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2018-02-04 19:25:59,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:25:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2018-02-04 19:25:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 19:25:59,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:59,361 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:59,361 INFO L371 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:59,361 INFO L82 PathProgramCache]: Analyzing trace with hash -200066512, now seen corresponding path program 1 times [2018-02-04 19:25:59,361 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:59,361 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:59,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,362 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:59,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:59,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:25:59,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:59,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:25:59,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:25:59,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:25:59,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:25:59,400 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand 6 states. [2018-02-04 19:25:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:59,500 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2018-02-04 19:25:59,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:25:59,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-04 19:25:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:59,501 INFO L225 Difference]: With dead ends: 111 [2018-02-04 19:25:59,501 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 19:25:59,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:25:59,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 19:25:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2018-02-04 19:25:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 19:25:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2018-02-04 19:25:59,504 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 44 [2018-02-04 19:25:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:59,505 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2018-02-04 19:25:59,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:25:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2018-02-04 19:25:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 19:25:59,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:59,506 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:59,506 INFO L371 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:59,506 INFO L82 PathProgramCache]: Analyzing trace with hash -200066511, now seen corresponding path program 1 times [2018-02-04 19:25:59,506 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:59,506 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:59,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,507 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:59,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:59,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:25:59,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:59,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:25:59,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:25:59,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:25:59,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:25:59,555 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand 6 states. [2018-02-04 19:25:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:59,586 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-02-04 19:25:59,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:25:59,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-04 19:25:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:59,586 INFO L225 Difference]: With dead ends: 97 [2018-02-04 19:25:59,586 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 19:25:59,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:25:59,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 19:25:59,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-04 19:25:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 19:25:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2018-02-04 19:25:59,588 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 44 [2018-02-04 19:25:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:59,588 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-02-04 19:25:59,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:25:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2018-02-04 19:25:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 19:25:59,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:59,589 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:25:59,589 INFO L371 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:59,589 INFO L82 PathProgramCache]: Analyzing trace with hash -705625136, now seen corresponding path program 1 times [2018-02-04 19:25:59,589 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:59,589 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:59,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,590 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:59,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:59,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:25:59,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:59,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:25:59,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:25:59,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:25:59,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:25:59,610 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 5 states. [2018-02-04 19:25:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:59,620 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-02-04 19:25:59,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:25:59,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-02-04 19:25:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:59,621 INFO L225 Difference]: With dead ends: 93 [2018-02-04 19:25:59,621 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 19:25:59,621 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:25:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 19:25:59,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-02-04 19:25:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 19:25:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-02-04 19:25:59,624 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 44 [2018-02-04 19:25:59,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:59,624 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-02-04 19:25:59,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:25:59,624 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-02-04 19:25:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 19:25:59,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:59,625 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-02-04 19:25:59,625 INFO L371 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:59,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1264018930, now seen corresponding path program 1 times [2018-02-04 19:25:59,625 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:59,625 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:59,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,626 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:59,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:59,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:25:59,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:59,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:25:59,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:25:59,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:25:59,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:25:59,675 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 8 states. [2018-02-04 19:25:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:25:59,777 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-02-04 19:25:59,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:25:59,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 19:25:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:25:59,778 INFO L225 Difference]: With dead ends: 97 [2018-02-04 19:25:59,778 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 19:25:59,778 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:25:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 19:25:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2018-02-04 19:25:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 19:25:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-02-04 19:25:59,781 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 46 [2018-02-04 19:25:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:25:59,781 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-02-04 19:25:59,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:25:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-02-04 19:25:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 19:25:59,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:25:59,782 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-02-04 19:25:59,782 INFO L371 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:25:59,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1264018931, now seen corresponding path program 1 times [2018-02-04 19:25:59,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:25:59,783 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:25:59,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,783 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:25:59,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:25:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:25:59,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:25:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:25:59,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:25:59,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:25:59,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:25:59,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:25:59,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:25:59,901 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 11 states. [2018-02-04 19:26:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:00,005 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-02-04 19:26:00,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:26:00,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-02-04 19:26:00,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:00,006 INFO L225 Difference]: With dead ends: 97 [2018-02-04 19:26:00,007 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 19:26:00,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 19:26:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 19:26:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-02-04 19:26:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 19:26:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-02-04 19:26:00,009 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 46 [2018-02-04 19:26:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:00,009 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-02-04 19:26:00,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:26:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-02-04 19:26:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 19:26:00,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:00,010 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-02-04 19:26:00,010 INFO L371 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:26:00,010 INFO L82 PathProgramCache]: Analyzing trace with hash 529881151, now seen corresponding path program 1 times [2018-02-04 19:26:00,011 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:00,011 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:00,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:00,011 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:00,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:00,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:26:00,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:26:00,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:26:00,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:26:00,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:26:00,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:26:00,114 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 11 states. [2018-02-04 19:26:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:00,276 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2018-02-04 19:26:00,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:26:00,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 19:26:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:00,277 INFO L225 Difference]: With dead ends: 98 [2018-02-04 19:26:00,277 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 19:26:00,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 19:26:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 19:26:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2018-02-04 19:26:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 19:26:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-02-04 19:26:00,280 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 47 [2018-02-04 19:26:00,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:00,280 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-02-04 19:26:00,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:26:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-02-04 19:26:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 19:26:00,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:00,281 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-02-04 19:26:00,281 INFO L371 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:26:00,281 INFO L82 PathProgramCache]: Analyzing trace with hash 529881150, now seen corresponding path program 1 times [2018-02-04 19:26:00,281 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:00,281 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:00,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:00,282 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:00,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:00,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:26:00,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:26:00,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:26:00,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:26:00,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:26:00,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:26:00,358 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 11 states. [2018-02-04 19:26:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:00,446 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-04 19:26:00,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:26:00,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 19:26:00,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:00,446 INFO L225 Difference]: With dead ends: 95 [2018-02-04 19:26:00,446 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 19:26:00,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 19:26:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 19:26:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-04 19:26:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 19:26:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-02-04 19:26:00,448 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 47 [2018-02-04 19:26:00,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:00,448 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-02-04 19:26:00,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:26:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-02-04 19:26:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 19:26:00,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:00,449 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:00,449 INFO L371 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:26:00,449 INFO L82 PathProgramCache]: Analyzing trace with hash 365897592, now seen corresponding path program 1 times [2018-02-04 19:26:00,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:00,449 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:00,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:00,450 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:00,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:00,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:00,459 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:00,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:00,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:00,460 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:00,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:26:00,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:26:00,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:26:00,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:26:00,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:26:00,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:26:00,508 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 8 states. [2018-02-04 19:26:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:00,534 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-02-04 19:26:00,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:26:00,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 19:26:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:00,534 INFO L225 Difference]: With dead ends: 105 [2018-02-04 19:26:00,534 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 19:26:00,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:26:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 19:26:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-02-04 19:26:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 19:26:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-02-04 19:26:00,537 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 46 [2018-02-04 19:26:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:00,537 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-02-04 19:26:00,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:26:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-02-04 19:26:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 19:26:00,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:00,538 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:00,538 INFO L371 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:26:00,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1831313543, now seen corresponding path program 1 times [2018-02-04 19:26:00,538 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:00,539 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:00,540 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:00,540 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:00,540 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:00,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:26:00,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:26:00,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:26:00,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:26:00,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:26:00,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:26:00,600 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 10 states. [2018-02-04 19:26:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:00,744 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-02-04 19:26:00,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:26:00,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-02-04 19:26:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:00,745 INFO L225 Difference]: With dead ends: 113 [2018-02-04 19:26:00,745 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 19:26:00,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:26:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 19:26:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-02-04 19:26:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 19:26:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-02-04 19:26:00,748 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 50 [2018-02-04 19:26:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:00,748 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-02-04 19:26:00,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:26:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-02-04 19:26:00,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 19:26:00,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:00,749 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:00,749 INFO L371 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:26:00,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1831313542, now seen corresponding path program 1 times [2018-02-04 19:26:00,750 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:00,750 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:00,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:00,751 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:00,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:00,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:00,765 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:00,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:00,766 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:00,768 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:00,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:00,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:00,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 41 [2018-02-04 19:26:00,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:00,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:00,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:00,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-02-04 19:26:00,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:00,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-02-04 19:26:00,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:00,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-02-04 19:26:00,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:00,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:00,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-02-04 19:26:00,991 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:01,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:01,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:01,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-02-04 19:26:01,005 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:01,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:26:01,016 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:75, output treesize:51 [2018-02-04 19:26:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:26:03,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:26:03,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 19:26:03,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:26:03,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:26:03,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=169, Unknown=3, NotChecked=0, Total=210 [2018-02-04 19:26:03,256 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 15 states. [2018-02-04 19:26:30,652 WARN L143 SmtUtils]: Spent 577ms on a formula simplification that was a NOOP. DAG size: 58 [2018-02-04 19:26:33,791 WARN L143 SmtUtils]: Spent 1110ms on a formula simplification that was a NOOP. DAG size: 38 [2018-02-04 19:26:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:33,981 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-02-04 19:26:33,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:26:33,981 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-02-04 19:26:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:33,981 INFO L225 Difference]: With dead ends: 109 [2018-02-04 19:26:33,981 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 19:26:33,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=109, Invalid=586, Unknown=7, NotChecked=0, Total=702 [2018-02-04 19:26:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 19:26:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-02-04 19:26:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 19:26:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-02-04 19:26:33,983 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 50 [2018-02-04 19:26:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:33,983 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-02-04 19:26:33,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:26:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-02-04 19:26:33,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:26:33,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:33,984 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:33,984 INFO L371 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:26:33,984 INFO L82 PathProgramCache]: Analyzing trace with hash -522729561, now seen corresponding path program 1 times [2018-02-04 19:26:33,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:33,984 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:33,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:33,985 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:33,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:33,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:33,996 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:33,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:33,997 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:33,997 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:34,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:34,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:26:34,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:26:34,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:26:34,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:26:34,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:33 [2018-02-04 19:26:34,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:26:34,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 19:26:34,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-02-04 19:26:34,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 53 [2018-02-04 19:26:34,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:34,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2018-02-04 19:26:34,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-02-04 19:26:34,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,252 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:48, output treesize:34 [2018-02-04 19:26:34,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-02-04 19:26:34,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-02-04 19:26:34,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:16 [2018-02-04 19:26:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:26:34,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:26:34,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 19:26:34,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:26:34,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:26:34,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=219, Unknown=14, NotChecked=0, Total=272 [2018-02-04 19:26:34,333 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 17 states. [2018-02-04 19:26:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:26:34,741 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-02-04 19:26:34,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:26:34,741 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-02-04 19:26:34,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:26:34,742 INFO L225 Difference]: With dead ends: 112 [2018-02-04 19:26:34,742 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 19:26:34,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=389, Unknown=14, NotChecked=0, Total=462 [2018-02-04 19:26:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 19:26:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-02-04 19:26:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 19:26:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-02-04 19:26:34,744 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 48 [2018-02-04 19:26:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:26:34,744 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-02-04 19:26:34,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:26:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-02-04 19:26:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 19:26:34,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:26:34,745 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:26:34,745 INFO L371 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:26:34,745 INFO L82 PathProgramCache]: Analyzing trace with hash 680328992, now seen corresponding path program 1 times [2018-02-04 19:26:34,745 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:26:34,746 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:26:34,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:34,746 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:34,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:26:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:34,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:26:34,760 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:26:34,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:26:34,760 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:26:34,761 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:26:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:26:34,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:26:34,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:26:34,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:26:34,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:34,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:31 [2018-02-04 19:26:34,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:34,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:34,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-02-04 19:26:34,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:34,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2018-02-04 19:26:34,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 19:26:34,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:34,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:34,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-02-04 19:26:40,967 WARN L143 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 16 [2018-02-04 19:26:42,982 WARN L143 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 22 [2018-02-04 19:26:43,349 WARN L143 SmtUtils]: Spent 351ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-04 19:26:43,354 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (exists ((v_probe_19_~a.base_BEFORE_CALL_13 Int) (f19_~a.offset Int)) (and (<= 0 f19_~a.offset) (not (= (select (select |c_#memory_$Pointer$.base| v_probe_19_~a.base_BEFORE_CALL_13) f19_~a.offset) v_probe_19_~a.base_BEFORE_CALL_13)) (<= f19_~a.offset 0))))) (or (and (exists ((v_prenex_30 Int)) (and (<= 0 v_prenex_30) (= (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) v_prenex_30) 0) |c_#valid|) (<= v_prenex_30 |c_f19_undo_#in~a.offset|))) .cse0 .cse1) (and .cse0 .cse1 (exists ((f19_undo_~a.offset Int)) (and (<= 0 f19_undo_~a.offset) (<= f19_undo_~a.offset |c_f19_undo_#in~a.offset|) (= 0 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) f19_undo_~a.offset))))) (and (exists ((v_prenex_31 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) v_prenex_31))) (and (<= v_prenex_31 |c_f19_undo_#in~a.offset|) (= |c_#valid| (store |c_old(#valid)| .cse2 0)) (<= 0 v_prenex_31) (not (= 0 .cse2))))) .cse1))) is different from true [2018-02-04 19:26:43,360 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#valid| |c_old(#valid)|))) (or (and .cse0 (exists ((f19_undo_~a.offset Int)) (and (<= 0 f19_undo_~a.offset) (<= f19_undo_~a.offset |c_f19_undo_#in~a.offset|) (= 0 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) f19_undo_~a.offset)))) (exists ((v_prenex_34 Int) (v_prenex_33 Int)) (and (not (= (select (select |c_#memory_$Pointer$.base| v_prenex_33) v_prenex_34) v_prenex_33)) (<= 0 v_prenex_34) (<= v_prenex_34 0)))) (and (exists ((v_prenex_30 Int)) (and (<= 0 v_prenex_30) (= (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) v_prenex_30) 0) |c_#valid|) (<= v_prenex_30 |c_f19_undo_#in~a.offset|))) .cse0 (exists ((v_probe_19_~a.base_BEFORE_CALL_13 Int) (f19_~a.offset Int)) (and (<= 0 f19_~a.offset) (not (= (select (select |c_#memory_$Pointer$.base| v_probe_19_~a.base_BEFORE_CALL_13) f19_~a.offset) v_probe_19_~a.base_BEFORE_CALL_13)) (<= f19_~a.offset 0)))) (and (exists ((v_prenex_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) v_prenex_31))) (and (<= v_prenex_31 |c_f19_undo_#in~a.offset|) (= |c_#valid| (store |c_old(#valid)| .cse1 0)) (<= 0 v_prenex_31) (not (= 0 .cse1))))) (exists ((v_prenex_36 Int) (v_prenex_35 Int)) (and (not (= (select (select |c_#memory_$Pointer$.base| v_prenex_35) v_prenex_36) v_prenex_35)) (<= v_prenex_36 0) (<= 0 v_prenex_36)))))) is different from true [2018-02-04 19:26:43,369 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:43,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:26:43,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-02-04 19:26:43,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:43,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 51 [2018-02-04 19:26:43,405 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:43,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-02-04 19:26:43,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:43,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-02-04 19:26:43,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:43,448 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:43,449 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:43,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-02-04 19:26:43,450 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:26:43,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:26:43,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2018-02-04 19:26:43,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-02-04 19:26:43,475 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:43,498 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:43,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-02-04 19:26:43,498 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:43,521 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:26:43,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-04 19:26:43,521 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:26:43,534 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:26:43,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 19:26:43,557 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 14 variables, input treesize:182, output treesize:46 [2018-02-04 19:26:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:26:43,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:26:43,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 19:26:43,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:26:43,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:26:43,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=263, Unknown=4, NotChecked=66, Total=380 [2018-02-04 19:26:43,601 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 20 states. [2018-02-04 19:27:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:27:34,960 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 19:27:34,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 19:27:34,960 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-02-04 19:27:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:27:34,961 INFO L225 Difference]: With dead ends: 92 [2018-02-04 19:27:34,961 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 19:27:34,961 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=110, Invalid=704, Unknown=6, NotChecked=110, Total=930 [2018-02-04 19:27:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 19:27:34,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-02-04 19:27:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 19:27:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-04 19:27:34,963 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 51 [2018-02-04 19:27:34,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:27:34,963 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-04 19:27:34,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:27:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-04 19:27:34,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 19:27:34,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:27:34,964 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:27:34,964 INFO L371 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:27:34,964 INFO L82 PathProgramCache]: Analyzing trace with hash -936145011, now seen corresponding path program 1 times [2018-02-04 19:27:34,964 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:27:34,964 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:27:34,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:34,965 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:34,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:34,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:27:34,977 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:27:34,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:27:34,977 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:27:34,978 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:34,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:27:35,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:27:35,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:27:35,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 19:27:35,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 19:27:35,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:35,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 19:27:35,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:35,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-02-04 19:27:35,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-02-04 19:27:35,201 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:35,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:35,202 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:27:35,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-02-04 19:27:35,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2018-02-04 19:27:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:27:35,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:27:35,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 19:27:35,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:27:35,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:27:35,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=287, Unknown=10, NotChecked=0, Total=342 [2018-02-04 19:27:35,221 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 19 states. [2018-02-04 19:27:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:27:35,679 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-02-04 19:27:35,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 19:27:35,679 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-04 19:27:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:27:35,680 INFO L225 Difference]: With dead ends: 87 [2018-02-04 19:27:35,680 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 19:27:35,680 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=796, Unknown=18, NotChecked=0, Total=930 [2018-02-04 19:27:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 19:27:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-04 19:27:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 19:27:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-02-04 19:27:35,681 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 51 [2018-02-04 19:27:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:27:35,682 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-02-04 19:27:35,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:27:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-02-04 19:27:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 19:27:35,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:27:35,682 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:27:35,682 INFO L371 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:27:35,682 INFO L82 PathProgramCache]: Analyzing trace with hash -936145010, now seen corresponding path program 1 times [2018-02-04 19:27:35,682 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:27:35,682 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:27:35,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:35,683 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:35,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:35,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:27:35,699 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:27:35,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:27:35,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:27:35,699 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:35,722 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:27:35,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:27:35,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:27:35,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:27:35,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:27:35,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 19:27:35,841 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 19:27:35,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-02-04 19:27:35,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 19:27:35,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:35,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-02-04 19:27:35,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:35,892 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:38, output treesize:23 [2018-02-04 19:27:35,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:27:35,986 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:27:35,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:27:35,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:35,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-02-04 19:27:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 19:27:36,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:27:36,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 19:27:36,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:27:36,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:27:36,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=316, Unknown=19, NotChecked=36, Total=420 [2018-02-04 19:27:36,007 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 21 states. [2018-02-04 19:27:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:27:36,466 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-02-04 19:27:36,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 19:27:36,467 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-02-04 19:27:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:27:36,467 INFO L225 Difference]: With dead ends: 89 [2018-02-04 19:27:36,467 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 19:27:36,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=733, Unknown=29, NotChecked=56, Total=930 [2018-02-04 19:27:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 19:27:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-02-04 19:27:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 19:27:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-04 19:27:36,470 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 51 [2018-02-04 19:27:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:27:36,470 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-04 19:27:36,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:27:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-04 19:27:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 19:27:36,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:27:36,471 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:27:36,471 INFO L371 AbstractCegarLoop]: === Iteration 33 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:27:36,471 INFO L82 PathProgramCache]: Analyzing trace with hash -384637661, now seen corresponding path program 1 times [2018-02-04 19:27:36,471 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:27:36,471 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:27:36,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:36,472 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:36,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:36,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:27:36,482 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:27:36,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:27:36,482 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:27:36,483 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:36,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:27:36,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:27:36,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:27:36,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:36,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:36,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:36,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-02-04 19:27:36,551 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.base Int) (f19_~a.offset Int)) (and (= (store |c_old(#memory_$Pointer$.offset)| f19_~a.base (store (select |c_old(#memory_$Pointer$.offset)| f19_~a.base) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|) (<= f19_~a.offset |c_f19_#in~a.offset|))) is different from true [2018-02-04 19:27:36,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 19:27:36,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:36,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-02-04 19:27:36,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:36,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-02-04 19:27:36,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:36,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:36,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:36,602 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:20 [2018-02-04 19:27:36,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-02-04 19:27:36,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-02-04 19:27:36,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:36,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:36,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2018-02-04 19:27:36,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:36,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:36,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:36,732 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:3 [2018-02-04 19:27:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:27:36,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:27:36,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 19:27:36,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 19:27:36,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 19:27:36,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2018-02-04 19:27:36,747 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 13 states. [2018-02-04 19:27:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:27:36,998 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-02-04 19:27:36,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:27:36,999 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-02-04 19:27:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:27:36,999 INFO L225 Difference]: With dead ends: 87 [2018-02-04 19:27:36,999 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 19:27:37,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2018-02-04 19:27:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 19:27:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-04 19:27:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 19:27:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-02-04 19:27:37,002 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 52 [2018-02-04 19:27:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:27:37,002 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-02-04 19:27:37,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 19:27:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-02-04 19:27:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 19:27:37,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:27:37,003 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:27:37,003 INFO L371 AbstractCegarLoop]: === Iteration 34 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:27:37,003 INFO L82 PathProgramCache]: Analyzing trace with hash -384637660, now seen corresponding path program 1 times [2018-02-04 19:27:37,003 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:27:37,003 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:27:37,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:37,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:37,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:37,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:27:37,017 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:27:37,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:27:37,017 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:27:37,018 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:37,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:27:37,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:27:37,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:37,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:37,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:27:37,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:27:37,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:27:37,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:37,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:37,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:37,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-04 19:27:37,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:37,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:37,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 42 [2018-02-04 19:27:37,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:37,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-02-04 19:27:37,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:37,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-02-04 19:27:37,217 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:37,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:37,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:37,229 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:44 [2018-02-04 19:27:37,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-02-04 19:27:37,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:37,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:37,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:27 [2018-02-04 19:27:37,558 WARN L1033 $PredicateComparison]: unable to prove that (or (and (= |c_#valid| |c_old(#valid)|) (exists ((v_prenex_62 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (and (<= v_prenex_62 v_prenex_60) (not (let ((.cse0 (select |c_#memory_$Pointer$.base| v_prenex_61))) (= (select .cse0 (+ v_prenex_60 4)) (select .cse0 v_prenex_62)))) (<= v_prenex_60 0) (<= 0 v_prenex_62))) (exists ((f19_undo_~a.offset Int)) (and (<= 0 f19_undo_~a.offset) (<= f19_undo_~a.offset |c_f19_undo_#in~a.offset|) (= 0 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) f19_undo_~a.offset))))) (and (exists ((v_prenex_55 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) v_prenex_55))) (and (= |c_#valid| (store |c_old(#valid)| .cse1 0)) (<= v_prenex_55 |c_f19_undo_#in~a.offset|) (not (= .cse1 0)) (<= 0 v_prenex_55)))) (exists ((v_probe_19_~a.offset_BEFORE_CALL_22 Int) (v_probe_19_~a.base_BEFORE_CALL_23 Int) (f19_~a.offset Int)) (and (not (let ((.cse2 (select |c_#memory_$Pointer$.base| v_probe_19_~a.base_BEFORE_CALL_23))) (= (select .cse2 (+ v_probe_19_~a.offset_BEFORE_CALL_22 4)) (select .cse2 f19_~a.offset)))) (<= 0 f19_~a.offset) (<= v_probe_19_~a.offset_BEFORE_CALL_22 0) (<= f19_~a.offset v_probe_19_~a.offset_BEFORE_CALL_22))))) is different from true [2018-02-04 19:27:37,569 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:27:37,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:37,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 106 [2018-02-04 19:27:37,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:37,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 19:27:37,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:172, output treesize:148 [2018-02-04 19:27:37,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-02-04 19:27:37,698 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:27:37,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-02-04 19:27:37,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:37,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:37,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-02-04 19:27:37,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:37,726 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:27:37,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:37,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-02-04 19:27:37,728 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:37,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:37,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:27:37,750 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:120, output treesize:31 [2018-02-04 19:27:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:27:37,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:27:37,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-04 19:27:37,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 19:27:37,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 19:27:37,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=469, Unknown=23, NotChecked=44, Total=600 [2018-02-04 19:27:37,781 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 25 states. [2018-02-04 19:27:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:27:38,471 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-02-04 19:27:38,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 19:27:38,472 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-02-04 19:27:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:27:38,472 INFO L225 Difference]: With dead ends: 87 [2018-02-04 19:27:38,473 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 19:27:38,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=1209, Unknown=38, NotChecked=72, Total=1482 [2018-02-04 19:27:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 19:27:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-02-04 19:27:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 19:27:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-02-04 19:27:38,476 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 52 [2018-02-04 19:27:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:27:38,476 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-02-04 19:27:38,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 19:27:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-02-04 19:27:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 19:27:38,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:27:38,477 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:27:38,477 INFO L371 AbstractCegarLoop]: === Iteration 35 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:27:38,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1081279336, now seen corresponding path program 1 times [2018-02-04 19:27:38,477 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:27:38,477 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:27:38,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:38,478 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:38,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:38,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:27:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:27:38,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:27:38,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:27:38,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:27:38,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:27:38,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:27:38,515 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 5 states. [2018-02-04 19:27:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:27:38,522 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-02-04 19:27:38,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:27:38,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-04 19:27:38,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:27:38,523 INFO L225 Difference]: With dead ends: 90 [2018-02-04 19:27:38,523 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 19:27:38,523 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:27:38,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 19:27:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2018-02-04 19:27:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 19:27:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-02-04 19:27:38,526 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 52 [2018-02-04 19:27:38,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:27:38,526 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-02-04 19:27:38,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:27:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-02-04 19:27:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 19:27:38,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:27:38,528 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:27:38,528 INFO L371 AbstractCegarLoop]: === Iteration 36 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:27:38,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1569562575, now seen corresponding path program 1 times [2018-02-04 19:27:38,528 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:27:38,529 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:27:38,529 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:38,529 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:38,529 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:38,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:27:38,558 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:27:38,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:27:38,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:27:38,559 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:38,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:27:38,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:27:38,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:27:38,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:27:38,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:27:38,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 19:27:38,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 19:27:38,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:38,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-02-04 19:27:38,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:38,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2018-02-04 19:27:38,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-02-04 19:27:38,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:38,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-02-04 19:27:38,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:38,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:38,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-02-04 19:27:38,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:38,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2018-02-04 19:27:38,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-04 19:27:38,886 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:27:38,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-02-04 19:27:38,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:10 [2018-02-04 19:27:38,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:38,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-04 19:27:38,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:38,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:27:38,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-02-04 19:27:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:27:39,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:27:39,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 19:27:39,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:27:39,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:27:39,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:27:39,067 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 22 states. [2018-02-04 19:27:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:27:39,788 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-02-04 19:27:39,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 19:27:39,789 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2018-02-04 19:27:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:27:39,789 INFO L225 Difference]: With dead ends: 94 [2018-02-04 19:27:39,789 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 19:27:39,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=1527, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 19:27:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 19:27:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-02-04 19:27:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 19:27:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-02-04 19:27:39,791 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 55 [2018-02-04 19:27:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:27:39,791 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-02-04 19:27:39,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:27:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-02-04 19:27:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 19:27:39,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:27:39,792 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:27:39,792 INFO L371 AbstractCegarLoop]: === Iteration 37 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:27:39,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1569562576, now seen corresponding path program 1 times [2018-02-04 19:27:39,792 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:27:39,792 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:27:39,793 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:39,793 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:39,793 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:39,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:27:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:27:39,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:27:39,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:27:39,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:27:39,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:27:39,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:27:39,865 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 8 states. [2018-02-04 19:27:39,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:27:39,924 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-02-04 19:27:39,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:27:39,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-02-04 19:27:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:27:39,925 INFO L225 Difference]: With dead ends: 89 [2018-02-04 19:27:39,925 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 19:27:39,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:27:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 19:27:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-02-04 19:27:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 19:27:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-02-04 19:27:39,928 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 55 [2018-02-04 19:27:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:27:39,928 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-02-04 19:27:39,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:27:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-02-04 19:27:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 19:27:39,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:27:39,929 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:27:39,929 INFO L371 AbstractCegarLoop]: === Iteration 38 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:27:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1411799554, now seen corresponding path program 1 times [2018-02-04 19:27:39,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:27:39,929 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:27:39,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:39,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:39,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:39,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:27:39,956 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:27:39,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:27:39,956 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:27:39,957 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:39,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:27:39,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:27:39,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:40,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:40,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-02-04 19:27:40,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:27:40,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:27:40,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:40,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:40,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:40,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-02-04 19:27:40,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:40,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:40,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-02-04 19:27:40,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:40,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-02-04 19:27:40,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:40,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-02-04 19:27:40,196 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:40,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:40,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:40,217 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:53, output treesize:54 [2018-02-04 19:27:40,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2018-02-04 19:27:40,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:40,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:40,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 112 [2018-02-04 19:27:40,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 19:27:40,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-02-04 19:27:40,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:136, output treesize:231 [2018-02-04 19:27:40,794 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 19:27:40,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:40,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-02-04 19:27:40,835 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:27:40,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:40,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:40,837 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:27:40,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:40,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-02-04 19:27:40,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:40,847 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:40,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:40,856 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 24 variables, input treesize:283, output treesize:15 [2018-02-04 19:27:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:27:40,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:27:40,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 19:27:40,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 19:27:40,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 19:27:40,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=584, Unknown=5, NotChecked=0, Total=650 [2018-02-04 19:27:40,903 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 26 states. [2018-02-04 19:27:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:27:42,144 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-02-04 19:27:42,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 19:27:42,145 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-02-04 19:27:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:27:42,145 INFO L225 Difference]: With dead ends: 91 [2018-02-04 19:27:42,145 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 19:27:42,145 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=1324, Unknown=10, NotChecked=0, Total=1482 [2018-02-04 19:27:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 19:27:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-02-04 19:27:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 19:27:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-02-04 19:27:42,147 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 56 [2018-02-04 19:27:42,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:27:42,147 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-02-04 19:27:42,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 19:27:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-02-04 19:27:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 19:27:42,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:27:42,147 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:27:42,148 INFO L371 AbstractCegarLoop]: === Iteration 39 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:27:42,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1411799553, now seen corresponding path program 1 times [2018-02-04 19:27:42,148 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:27:42,148 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:27:42,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:42,148 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:42,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:42,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:27:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:27:42,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:27:42,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 19:27:42,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:27:42,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:27:42,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:27:42,269 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 15 states. [2018-02-04 19:27:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:27:42,430 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-02-04 19:27:42,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:27:42,430 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-04 19:27:42,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:27:42,431 INFO L225 Difference]: With dead ends: 89 [2018-02-04 19:27:42,431 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 19:27:42,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:27:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 19:27:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-02-04 19:27:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 19:27:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-02-04 19:27:42,432 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 56 [2018-02-04 19:27:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:27:42,433 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-02-04 19:27:42,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:27:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-02-04 19:27:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 19:27:42,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:27:42,433 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:27:42,433 INFO L371 AbstractCegarLoop]: === Iteration 40 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:27:42,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1384633629, now seen corresponding path program 1 times [2018-02-04 19:27:42,433 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:27:42,433 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:27:42,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:42,434 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:42,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:42,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:27:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:27:42,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:27:42,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:27:42,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:27:42,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:27:42,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:27:42,469 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 6 states. [2018-02-04 19:27:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:27:42,481 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-02-04 19:27:42,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:27:42,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-04 19:27:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:27:42,481 INFO L225 Difference]: With dead ends: 80 [2018-02-04 19:27:42,481 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 19:27:42,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:27:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 19:27:42,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-02-04 19:27:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 19:27:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-02-04 19:27:42,482 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 61 [2018-02-04 19:27:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:27:42,483 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-02-04 19:27:42,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:27:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-02-04 19:27:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 19:27:42,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:27:42,483 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:27:42,483 INFO L371 AbstractCegarLoop]: === Iteration 41 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 19:27:42,484 INFO L82 PathProgramCache]: Analyzing trace with hash 843947090, now seen corresponding path program 1 times [2018-02-04 19:27:42,484 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:27:42,484 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:27:42,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:42,484 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:42,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:27:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:42,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:27:42,497 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:27:42,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:27:42,497 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:27:42,497 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:27:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:27:42,520 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:27:42,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:27:42,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:42,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:42,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-04 19:27:42,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2018-02-04 19:27:42,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:27:42,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:42,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:42,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-02-04 19:27:42,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:27:42,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:42,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:42,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-02-04 19:27:42,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:27:42,770 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:42,778 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:42,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2018-02-04 19:27:42,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:27:42,804 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:42,812 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:42,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:27:42,843 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:119, output treesize:121 [2018-02-04 19:27:42,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-02-04 19:27:42,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 19:27:42,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:42,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:42,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:42,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:62 [2018-02-04 19:27:43,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:27:43,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:27:43,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:43,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:43,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:43,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-02-04 19:27:43,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:27:43,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 19:27:43,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:43,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:43,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:43,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:39 [2018-02-04 19:27:43,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2018-02-04 19:27:43,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:43,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:43,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 92 [2018-02-04 19:27:43,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:43,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:43,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:27:43,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:99 [2018-02-04 19:27:43,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:43,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-02-04 19:27:43,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:27:43,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-02-04 19:27:43,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:43,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:27:43,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-02-04 19:27:43,245 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:43,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 19:27:43,257 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:96, output treesize:141 [2018-02-04 19:27:45,019 WARN L143 SmtUtils]: Spent 1723ms on a formula simplification that was a NOOP. DAG size: 58 [2018-02-04 19:27:45,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-02-04 19:27:45,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:45,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-02-04 19:27:45,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:27:45,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 19:27:45,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:107 [2018-02-04 19:27:53,808 WARN L143 SmtUtils]: Spent 8635ms on a formula simplification that was a NOOP. DAG size: 53 [2018-02-04 19:28:03,679 WARN L143 SmtUtils]: Spent 9827ms on a formula simplification that was a NOOP. DAG size: 59 [2018-02-04 19:28:09,553 WARN L143 SmtUtils]: Spent 5816ms on a formula simplification that was a NOOP. DAG size: 71 Received shutdown request... [2018-02-04 19:28:39,897 WARN L143 SmtUtils]: Spent 30140ms on a formula simplification that was a NOOP. DAG size: 128 [2018-02-04 19:28:39,898 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 19:28:39,898 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 19:28:39,901 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 19:28:39,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:28:39 BoogieIcfgContainer [2018-02-04 19:28:39,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:28:39,902 INFO L168 Benchmark]: Toolchain (without parser) took 218573.33 ms. Allocated memory was 408.9 MB in the beginning and 742.9 MB in the end (delta: 334.0 MB). Free memory was 365.8 MB in the beginning and 464.2 MB in the end (delta: -98.4 MB). Peak memory consumption was 235.5 MB. Max. memory is 5.3 GB. [2018-02-04 19:28:39,903 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 408.9 MB. Free memory is still 372.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:28:39,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.60 ms. Allocated memory is still 408.9 MB. Free memory was 365.8 MB in the beginning and 352.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:28:39,903 INFO L168 Benchmark]: Boogie Preprocessor took 28.37 ms. Allocated memory is still 408.9 MB. Free memory was 352.6 MB in the beginning and 351.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:28:39,904 INFO L168 Benchmark]: RCFGBuilder took 283.29 ms. Allocated memory is still 408.9 MB. Free memory was 351.2 MB in the beginning and 325.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-02-04 19:28:39,904 INFO L168 Benchmark]: TraceAbstraction took 218076.17 ms. Allocated memory was 408.9 MB in the beginning and 742.9 MB in the end (delta: 334.0 MB). Free memory was 325.3 MB in the beginning and 464.2 MB in the end (delta: -139.0 MB). Peak memory consumption was 195.0 MB. Max. memory is 5.3 GB. [2018-02-04 19:28:39,905 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.11 ms. Allocated memory is still 408.9 MB. Free memory is still 372.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 182.60 ms. Allocated memory is still 408.9 MB. Free memory was 365.8 MB in the beginning and 352.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.37 ms. Allocated memory is still 408.9 MB. Free memory was 352.6 MB in the beginning and 351.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 283.29 ms. Allocated memory is still 408.9 MB. Free memory was 351.2 MB in the beginning and 325.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 218076.17 ms. Allocated memory was 408.9 MB in the beginning and 742.9 MB in the end (delta: 334.0 MB). Free memory was 325.3 MB in the beginning and 464.2 MB in the end (delta: -139.0 MB). Peak memory consumption was 195.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1478). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1478). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1478). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1478). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1447). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1447). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1490]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1490). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1441). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1441). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1440). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1440). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1458). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1458). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1472). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1457). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1457). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1472). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 3 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 89 locations, 21 error locations. TIMEOUT Result, 218.0s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 142.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2804 SDtfs, 2192 SDslu, 12591 SDs, 0 SdLazy, 10033 SolverSat, 660 SolverUnsat, 323 SolverUnknown, 0 SolverNotchecked, 85.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1076 GetRequests, 527 SyntacticMatches, 19 SemanticMatches, 530 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1654 ImplicationChecksByTransitivity, 70.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=2, 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.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 277 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 2342 NumberOfCodeBlocks, 2342 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1593 ConstructedInterpolants, 236 QuantifiedInterpolants, 631756 SizeOfPredicates, 175 NumberOfNonLiveVariables, 3313 ConjunctsInSsa, 570 ConjunctsInUnsatCore, 41 InterpolantComputations, 32 PerfectInterpolantSequences, 142/174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-28-39-912.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-28-39-912.csv Completed graceful shutdown