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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:20:09,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:20:09,993 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:20:10,007 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:20:10,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:20:10,009 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:20:10,010 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:20:10,011 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:20:10,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:20:10,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:20:10,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:20:10,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:20:10,016 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:20:10,017 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:20:10,018 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:20:10,021 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:20:10,023 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:20:10,025 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:20:10,026 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:20:10,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:20:10,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:20:10,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:20:10,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:20:10,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:20:10,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:20:10,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:20:10,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:20:10,034 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:20:10,034 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:20:10,034 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:20:10,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:20:10,035 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:20:10,043 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:20:10,043 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:20:10,044 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:20:10,044 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:20:10,044 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:20:10,044 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:20:10,044 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:20:10,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:20:10,045 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:20:10,045 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:20:10,045 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:20:10,045 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:20:10,045 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:20:10,046 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:20:10,046 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:20:10,046 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:20:10,046 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:20:10,046 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:20:10,046 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:20:10,046 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:20:10,046 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:20:10,046 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:20:10,047 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:20:10,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:20:10,047 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:20:10,047 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:20:10,047 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:20:10,048 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:20:10,048 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:20:10,048 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:20:10,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:20:10,048 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:20:10,049 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:20:10,049 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:20:10,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:20:10,090 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:20:10,094 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:20:10,095 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:20:10,095 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:20:10,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-01-24 12:20:10,287 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:20:10,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:20:10,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:20:10,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:20:10,298 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:20:10,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:20:10" (1/1) ... [2018-01-24 12:20:10,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d434187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:20:10, skipping insertion in model container [2018-01-24 12:20:10,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:20:10" (1/1) ... [2018-01-24 12:20:10,315 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:20:10,362 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:20:10,479 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:20:10,501 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:20:10,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:20:10 WrapperNode [2018-01-24 12:20:10,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:20:10,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:20:10,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:20:10,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:20:10,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:20:10" (1/1) ... [2018-01-24 12:20:10,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:20:10" (1/1) ... [2018-01-24 12:20:10,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:20:10" (1/1) ... [2018-01-24 12:20:10,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:20:10" (1/1) ... [2018-01-24 12:20:10,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:20:10" (1/1) ... [2018-01-24 12:20:10,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:20:10" (1/1) ... [2018-01-24 12:20:10,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:20:10" (1/1) ... [2018-01-24 12:20:10,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:20:10,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:20:10,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:20:10,545 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:20:10,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:20:10" (1/1) ... No working directory specified, using /storage/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-01-24 12:20:10,590 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:20:10,590 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:20:10,591 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:20:10,591 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-01-24 12:20:10,591 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-01-24 12:20:10,591 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-01-24 12:20:10,591 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2018-01-24 12:20:10,591 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-01-24 12:20:10,591 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:20:10,592 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:20:10,592 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:20:10,592 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:20:10,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:20:10,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:20:10,592 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:20:10,592 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:20:10,592 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:20:10,592 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:20:10,592 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:20:10,593 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-01-24 12:20:10,593 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-01-24 12:20:10,593 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-01-24 12:20:10,593 INFO L128 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2018-01-24 12:20:10,593 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-01-24 12:20:10,594 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:20:10,594 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:20:10,594 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:20:10,594 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:20:10,857 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:20:10,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:20:10 BoogieIcfgContainer [2018-01-24 12:20:10,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:20:10,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:20:10,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:20:10,861 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:20:10,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:20:10" (1/3) ... [2018-01-24 12:20:10,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54748f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:20:10, skipping insertion in model container [2018-01-24 12:20:10,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:20:10" (2/3) ... [2018-01-24 12:20:10,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54748f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:20:10, skipping insertion in model container [2018-01-24 12:20:10,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:20:10" (3/3) ... [2018-01-24 12:20:10,864 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test19_false-valid-free.i [2018-01-24 12:20:10,873 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:20:10,881 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-24 12:20:10,917 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:20:10,917 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:20:10,917 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:20:10,917 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:20:10,918 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:20:10,918 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:20:10,918 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:20:10,918 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:20:10,919 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:20:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-01-24 12:20:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:20:10,944 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:10,945 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:20:10,945 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:10,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1664045335, now seen corresponding path program 1 times [2018-01-24 12:20:10,950 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:10,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:10,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:10,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:10,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:11,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:11,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:11,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:20:11,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:20:11,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:20:11,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:20:11,286 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 6 states. [2018-01-24 12:20:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:11,724 INFO L93 Difference]: Finished difference Result 139 states and 163 transitions. [2018-01-24 12:20:11,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:20:11,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 12:20:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:11,735 INFO L225 Difference]: With dead ends: 139 [2018-01-24 12:20:11,736 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 12:20:11,738 INFO L525 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-01-24 12:20:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 12:20:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-01-24 12:20:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 12:20:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-01-24 12:20:11,778 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-01-24 12:20:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:11,778 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-01-24 12:20:11,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:20:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-01-24 12:20:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:20:11,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:11,781 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:20:11,781 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:11,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1664045336, now seen corresponding path program 1 times [2018-01-24 12:20:11,781 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:11,782 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:11,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:11,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:11,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:11,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:11,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:11,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:20:11,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:20:11,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:20:11,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:20:11,903 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-01-24 12:20:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:12,209 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2018-01-24 12:20:12,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:20:12,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 12:20:12,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:12,210 INFO L225 Difference]: With dead ends: 129 [2018-01-24 12:20:12,211 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 12:20:12,211 INFO L525 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-01-24 12:20:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 12:20:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-01-24 12:20:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 12:20:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-01-24 12:20:12,225 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 15 [2018-01-24 12:20:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:12,225 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-01-24 12:20:12,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:20:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-01-24 12:20:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:20:12,226 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:12,227 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:20:12,227 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:12,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1330432345, now seen corresponding path program 1 times [2018-01-24 12:20:12,227 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:12,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:12,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:12,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:12,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:12,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:12,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:12,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:20:12,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:20:12,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:20:12,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:20:12,358 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 8 states. [2018-01-24 12:20:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:12,775 INFO L93 Difference]: Finished difference Result 149 states and 177 transitions. [2018-01-24 12:20:12,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:20:12,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-24 12:20:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:12,817 INFO L225 Difference]: With dead ends: 149 [2018-01-24 12:20:12,818 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 12:20:12,818 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:20:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 12:20:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2018-01-24 12:20:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 12:20:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2018-01-24 12:20:12,832 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 17 [2018-01-24 12:20:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:12,832 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2018-01-24 12:20:12,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:20:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2018-01-24 12:20:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:20:12,833 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:12,833 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:20:12,833 INFO L371 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1330432346, now seen corresponding path program 1 times [2018-01-24 12:20:12,833 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:12,833 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:12,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:12,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:12,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:12,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:12,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:12,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:20:12,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:20:12,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:20:12,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:20:12,953 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 9 states. [2018-01-24 12:20:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:13,322 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2018-01-24 12:20:13,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:20:13,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-01-24 12:20:13,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:13,325 INFO L225 Difference]: With dead ends: 152 [2018-01-24 12:20:13,325 INFO L226 Difference]: Without dead ends: 149 [2018-01-24 12:20:13,325 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:20:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-24 12:20:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 82. [2018-01-24 12:20:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 12:20:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-01-24 12:20:13,342 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 17 [2018-01-24 12:20:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:13,343 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-01-24 12:20:13,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:20:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-01-24 12:20:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:20:13,344 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:13,344 INFO L322 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-01-24 12:20:13,345 INFO L371 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:13,345 INFO L82 PathProgramCache]: Analyzing trace with hash 522081757, now seen corresponding path program 1 times [2018-01-24 12:20:13,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:13,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:13,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:13,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:13,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:13,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:20:13,430 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:20:13,431 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:20:13,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:13,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:20:13,522 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-01-24 12:20:13,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:13,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:13,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:20:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:20:13,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:20:13,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2018-01-24 12:20:13,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:20:13,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:20:13,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:20:13,626 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 12 states. [2018-01-24 12:20:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:14,062 INFO L93 Difference]: Finished difference Result 180 states and 204 transitions. [2018-01-24 12:20:14,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:20:14,063 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-01-24 12:20:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:14,064 INFO L225 Difference]: With dead ends: 180 [2018-01-24 12:20:14,064 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 12:20:14,066 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:20:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 12:20:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2018-01-24 12:20:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:20:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-01-24 12:20:14,078 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 26 [2018-01-24 12:20:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:14,078 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-01-24 12:20:14,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:20:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-01-24 12:20:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:20:14,079 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:14,080 INFO L322 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-01-24 12:20:14,080 INFO L371 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:14,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1860386785, now seen corresponding path program 1 times [2018-01-24 12:20:14,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:14,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:14,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:14,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:14,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:14,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:14,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:14,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:20:14,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:20:14,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:20:14,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:20:14,195 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 8 states. [2018-01-24 12:20:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:14,326 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2018-01-24 12:20:14,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:20:14,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-01-24 12:20:14,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:14,328 INFO L225 Difference]: With dead ends: 102 [2018-01-24 12:20:14,328 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 12:20:14,328 INFO L525 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-01-24 12:20:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 12:20:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-01-24 12:20:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 12:20:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-01-24 12:20:14,341 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 26 [2018-01-24 12:20:14,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:14,342 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-01-24 12:20:14,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:20:14,342 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-01-24 12:20:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:20:14,343 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:14,343 INFO L322 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-01-24 12:20:14,343 INFO L371 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:14,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1860386784, now seen corresponding path program 1 times [2018-01-24 12:20:14,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:14,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:14,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:14,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:14,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:14,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:14,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:14,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:20:14,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:20:14,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:20:14,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:20:14,395 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 6 states. [2018-01-24 12:20:14,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:14,419 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-01-24 12:20:14,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:20:14,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 12:20:14,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:14,420 INFO L225 Difference]: With dead ends: 124 [2018-01-24 12:20:14,420 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 12:20:14,421 INFO L525 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-01-24 12:20:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 12:20:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-01-24 12:20:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 12:20:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-01-24 12:20:14,430 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 26 [2018-01-24 12:20:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:14,430 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-01-24 12:20:14,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:20:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-01-24 12:20:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:20:14,431 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:14,431 INFO L322 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-01-24 12:20:14,432 INFO L371 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:14,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1338867620, now seen corresponding path program 1 times [2018-01-24 12:20:14,432 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:14,432 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:14,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:14,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:14,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:14,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:14,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:14,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:20:14,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:20:14,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:20:14,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:20:14,553 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 9 states. [2018-01-24 12:20:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:14,863 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-01-24 12:20:14,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:20:14,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-24 12:20:14,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:14,864 INFO L225 Difference]: With dead ends: 114 [2018-01-24 12:20:14,865 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 12:20:14,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:20:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 12:20:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2018-01-24 12:20:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 12:20:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-01-24 12:20:14,881 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 28 [2018-01-24 12:20:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:14,881 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-01-24 12:20:14,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:20:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-01-24 12:20:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:20:14,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:14,882 INFO L322 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-01-24 12:20:14,882 INFO L371 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:14,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1748755101, now seen corresponding path program 1 times [2018-01-24 12:20:14,883 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:14,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:14,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:14,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:14,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:14,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:15,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:15,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:20:15,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:20:15,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:20:15,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:20:15,032 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 8 states. [2018-01-24 12:20:15,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:15,613 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-01-24 12:20:15,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:20:15,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-01-24 12:20:15,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:15,615 INFO L225 Difference]: With dead ends: 118 [2018-01-24 12:20:15,615 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 12:20:15,616 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:20:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 12:20:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2018-01-24 12:20:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 12:20:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-01-24 12:20:15,630 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 30 [2018-01-24 12:20:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:15,630 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-01-24 12:20:15,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:20:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-01-24 12:20:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:20:15,631 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:15,631 INFO L322 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-01-24 12:20:15,632 INFO L371 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:15,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1748755102, now seen corresponding path program 1 times [2018-01-24 12:20:15,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:15,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:15,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:15,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:15,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:15,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:15,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:15,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 12:20:15,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:20:15,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:20:15,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:20:15,904 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 12 states. [2018-01-24 12:20:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:16,436 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-01-24 12:20:16,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:20:16,437 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-01-24 12:20:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:16,438 INFO L225 Difference]: With dead ends: 126 [2018-01-24 12:20:16,438 INFO L226 Difference]: Without dead ends: 124 [2018-01-24 12:20:16,439 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-01-24 12:20:16,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-24 12:20:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-01-24 12:20:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 12:20:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-01-24 12:20:16,453 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2018-01-24 12:20:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:16,453 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-01-24 12:20:16,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:20:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-01-24 12:20:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:20:16,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:16,454 INFO L322 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-01-24 12:20:16,454 INFO L371 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:16,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1057519410, now seen corresponding path program 1 times [2018-01-24 12:20:16,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:16,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:16,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:16,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:16,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:16,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:16,524 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:16,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:20:16,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:20:16,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:20:16,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:20:16,525 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 4 states. [2018-01-24 12:20:16,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:16,643 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-01-24 12:20:16,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:20:16,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-24 12:20:16,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:16,644 INFO L225 Difference]: With dead ends: 106 [2018-01-24 12:20:16,645 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 12:20:16,645 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:20:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 12:20:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-01-24 12:20:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-24 12:20:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-24 12:20:16,662 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 28 [2018-01-24 12:20:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:16,663 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-24 12:20:16,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:20:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-24 12:20:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:20:16,664 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:16,664 INFO L322 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-01-24 12:20:16,665 INFO L371 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:16,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1571490764, now seen corresponding path program 1 times [2018-01-24 12:20:16,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:16,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:16,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:16,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:16,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:16,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:16,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:16,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:20:16,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:20:16,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:20:16,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:20:16,731 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-01-24 12:20:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:16,804 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2018-01-24 12:20:16,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:20:16,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-24 12:20:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:16,805 INFO L225 Difference]: With dead ends: 91 [2018-01-24 12:20:16,805 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 12:20:16,806 INFO L525 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-01-24 12:20:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 12:20:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-24 12:20:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 12:20:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-01-24 12:20:16,814 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 30 [2018-01-24 12:20:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:16,814 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-01-24 12:20:16,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:20:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-01-24 12:20:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 12:20:16,815 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:16,815 INFO L322 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-01-24 12:20:16,816 INFO L371 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1767360087, now seen corresponding path program 1 times [2018-01-24 12:20:16,816 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:16,816 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:16,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:16,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:16,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:16,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:20:16,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:16,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:20:16,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:20:16,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:20:16,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:20:16,885 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 5 states. [2018-01-24 12:20:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:16,910 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-01-24 12:20:16,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:20:16,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-24 12:20:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:16,911 INFO L225 Difference]: With dead ends: 129 [2018-01-24 12:20:16,911 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 12:20:16,912 INFO L525 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-01-24 12:20:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 12:20:16,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2018-01-24 12:20:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 12:20:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-24 12:20:16,920 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 37 [2018-01-24 12:20:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:16,921 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-24 12:20:16,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:20:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-24 12:20:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 12:20:16,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:16,921 INFO L322 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-01-24 12:20:16,922 INFO L371 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:16,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1640103528, now seen corresponding path program 1 times [2018-01-24 12:20:16,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:16,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:16,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:16,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:16,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:16,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:20:17,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:20:17,347 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:20:17,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:17,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:20:17,400 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-01-24 12:20:17,401 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-01-24 12:20:17,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:17,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:17,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:17,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-24 12:20:17,452 WARN L1029 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-01-24 12:20:17,462 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-01-24 12:20:17,465 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 16 treesize of output 17 [2018-01-24 12:20:17,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:17,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:17,471 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-01-24 12:20:17,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-24 12:20:17,485 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-01-24 12:20:17,486 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-01-24 12:20:17,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:17,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:17,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:17,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-24 12:20:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:20:17,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:20:17,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2018-01-24 12:20:17,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:20:17,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:20:17,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2018-01-24 12:20:17,527 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 19 states. [2018-01-24 12:20:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:17,996 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-24 12:20:17,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:20:17,996 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2018-01-24 12:20:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:17,997 INFO L225 Difference]: With dead ends: 84 [2018-01-24 12:20:17,997 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 12:20:17,998 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=4, NotChecked=56, Total=930 [2018-01-24 12:20:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 12:20:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-24 12:20:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 12:20:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-01-24 12:20:18,006 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 37 [2018-01-24 12:20:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:18,007 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-01-24 12:20:18,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:20:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-01-24 12:20:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 12:20:18,007 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:18,008 INFO L322 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-01-24 12:20:18,008 INFO L371 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:18,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1640103527, now seen corresponding path program 1 times [2018-01-24 12:20:18,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:18,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:18,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:18,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:18,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:18,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:18,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:20:18,285 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:20:18,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:18,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:20:18,323 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-01-24 12:20:18,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:18,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:18,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:20:18,354 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-01-24 12:20:18,356 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-01-24 12:20:18,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:18,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:18,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:18,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-24 12:20:18,475 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-01-24 12:20:18,487 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2018-01-24 12:20:18,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:20:18,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:20:18,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 12:20:18,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:35 [2018-01-24 12:20:18,558 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 20 [2018-01-24 12:20:18,561 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-01-24 12:20:18,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:18,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:18,577 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 28 treesize of output 22 [2018-01-24 12:20:18,585 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 1 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 12:20:18,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 12:20:18,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:20:18,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-24 12:20:18,609 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:24 [2018-01-24 12:20:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:18,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:20:18,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-01-24 12:20:18,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:20:18,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:20:18,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=431, Unknown=8, NotChecked=0, Total=506 [2018-01-24 12:20:18,678 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 23 states. [2018-01-24 12:20:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:19,265 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-01-24 12:20:19,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:20:19,265 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-01-24 12:20:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:19,266 INFO L225 Difference]: With dead ends: 104 [2018-01-24 12:20:19,266 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 12:20:19,267 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1020, Unknown=13, NotChecked=0, Total=1190 [2018-01-24 12:20:19,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 12:20:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-01-24 12:20:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 12:20:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-01-24 12:20:19,277 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 37 [2018-01-24 12:20:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:19,278 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-01-24 12:20:19,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:20:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-01-24 12:20:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 12:20:19,278 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:19,278 INFO L322 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-01-24 12:20:19,278 INFO L371 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash -124647017, now seen corresponding path program 1 times [2018-01-24 12:20:19,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:19,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:19,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:19,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:19,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:19,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:19,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:20:19,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:19,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:20:19,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:20:19,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:20:19,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:20:19,348 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 7 states. [2018-01-24 12:20:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:19,407 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-24 12:20:19,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:20:19,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-24 12:20:19,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:19,408 INFO L225 Difference]: With dead ends: 140 [2018-01-24 12:20:19,408 INFO L226 Difference]: Without dead ends: 90 [2018-01-24 12:20:19,409 INFO L525 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-01-24 12:20:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-24 12:20:19,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-01-24 12:20:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:20:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-24 12:20:19,422 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 39 [2018-01-24 12:20:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:19,422 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-24 12:20:19,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:20:19,423 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-24 12:20:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:20:19,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:19,423 INFO L322 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-01-24 12:20:19,424 INFO L371 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:19,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1308023878, now seen corresponding path program 1 times [2018-01-24 12:20:19,424 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:19,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:19,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:19,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:19,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:19,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:19,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:19,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:20:19,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:20:19,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:20:19,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:20:19,465 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 6 states. [2018-01-24 12:20:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:19,700 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-01-24 12:20:19,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:20:19,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-24 12:20:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:19,701 INFO L225 Difference]: With dead ends: 105 [2018-01-24 12:20:19,701 INFO L226 Difference]: Without dead ends: 104 [2018-01-24 12:20:19,702 INFO L525 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-01-24 12:20:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-24 12:20:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-01-24 12:20:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 12:20:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-01-24 12:20:19,717 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 44 [2018-01-24 12:20:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:19,717 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-01-24 12:20:19,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:20:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-01-24 12:20:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:20:19,718 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:19,718 INFO L322 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-01-24 12:20:19,718 INFO L371 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:19,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1308023877, now seen corresponding path program 1 times [2018-01-24 12:20:19,719 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:19,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:19,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:19,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:19,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:19,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:20:19,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:19,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:20:19,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:20:19,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:20:19,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:20:19,813 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 6 states. [2018-01-24 12:20:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:19,868 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2018-01-24 12:20:19,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:20:19,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-24 12:20:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:19,870 INFO L225 Difference]: With dead ends: 145 [2018-01-24 12:20:19,870 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 12:20:19,870 INFO L525 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-01-24 12:20:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 12:20:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-24 12:20:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 12:20:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-01-24 12:20:19,884 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 44 [2018-01-24 12:20:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:19,884 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-01-24 12:20:19,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:20:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-01-24 12:20:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:20:19,885 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:19,885 INFO L322 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-01-24 12:20:19,885 INFO L371 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:19,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1813582502, now seen corresponding path program 1 times [2018-01-24 12:20:19,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:19,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:19,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:19,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:19,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:19,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:20:19,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:19,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:20:19,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:20:19,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:20:19,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:20:19,937 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 5 states. [2018-01-24 12:20:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:20,003 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-24 12:20:20,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:20:20,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-01-24 12:20:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:20,004 INFO L225 Difference]: With dead ends: 139 [2018-01-24 12:20:20,004 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 12:20:20,005 INFO L525 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-01-24 12:20:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 12:20:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-01-24 12:20:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:20:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-01-24 12:20:20,018 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 44 [2018-01-24 12:20:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:20,018 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-01-24 12:20:20,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:20:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-01-24 12:20:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:20:20,019 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:20,019 INFO L322 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-01-24 12:20:20,019 INFO L371 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:20,020 INFO L82 PathProgramCache]: Analyzing trace with hash 182043132, now seen corresponding path program 1 times [2018-01-24 12:20:20,020 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:20,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:20,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:20,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:20,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:20,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:20:20,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:20,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:20:20,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:20:20,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:20:20,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:20:20,115 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 8 states. [2018-01-24 12:20:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:20,246 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-01-24 12:20:20,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:20:20,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-01-24 12:20:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:20,247 INFO L225 Difference]: With dead ends: 97 [2018-01-24 12:20:20,248 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 12:20:20,248 INFO L525 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-01-24 12:20:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 12:20:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2018-01-24 12:20:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-24 12:20:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-01-24 12:20:20,262 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 46 [2018-01-24 12:20:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:20,263 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-01-24 12:20:20,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:20:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-01-24 12:20:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:20:20,264 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:20,264 INFO L322 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-01-24 12:20:20,264 INFO L371 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:20,264 INFO L82 PathProgramCache]: Analyzing trace with hash 182043133, now seen corresponding path program 1 times [2018-01-24 12:20:20,264 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:20,264 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:20,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:20,265 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:20,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:20,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:20:20,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:20,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:20:20,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:20:20,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:20:20,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:20:20,443 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 11 states. [2018-01-24 12:20:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:20,570 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-01-24 12:20:20,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:20:20,570 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-01-24 12:20:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:20,571 INFO L225 Difference]: With dead ends: 97 [2018-01-24 12:20:20,571 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 12:20:20,571 INFO L525 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-01-24 12:20:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 12:20:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-01-24 12:20:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 12:20:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-24 12:20:20,585 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 46 [2018-01-24 12:20:20,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:20,586 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-24 12:20:20,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:20:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-24 12:20:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:20:20,587 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:20,587 INFO L322 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-01-24 12:20:20,587 INFO L371 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1348369820, now seen corresponding path program 1 times [2018-01-24 12:20:20,587 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:20,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:20,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:20,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:20,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:20,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:20:20,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:20,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:20:20,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:20:20,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:20:20,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:20:20,724 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 11 states. [2018-01-24 12:20:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:20,916 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-01-24 12:20:20,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:20:20,918 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-01-24 12:20:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:20,919 INFO L225 Difference]: With dead ends: 96 [2018-01-24 12:20:20,919 INFO L226 Difference]: Without dead ends: 95 [2018-01-24 12:20:20,920 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:20:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-24 12:20:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-01-24 12:20:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 12:20:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-01-24 12:20:20,933 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 47 [2018-01-24 12:20:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:20,934 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-01-24 12:20:20,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:20:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-01-24 12:20:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:20:20,935 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:20,935 INFO L322 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-01-24 12:20:20,935 INFO L371 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:20,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1348369821, now seen corresponding path program 1 times [2018-01-24 12:20:20,935 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:20,936 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:20,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:20,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:20,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:20,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:20:21,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:21,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:20:21,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:20:21,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:20:21,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:20:21,112 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 11 states. [2018-01-24 12:20:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:21,720 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-01-24 12:20:21,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:20:21,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-01-24 12:20:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:21,721 INFO L225 Difference]: With dead ends: 97 [2018-01-24 12:20:21,721 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 12:20:21,721 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:20:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 12:20:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-01-24 12:20:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 12:20:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-01-24 12:20:21,733 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 47 [2018-01-24 12:20:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:21,733 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-01-24 12:20:21,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:20:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-01-24 12:20:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:20:21,733 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:21,734 INFO L322 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-01-24 12:20:21,734 INFO L371 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:21,734 INFO L82 PathProgramCache]: Analyzing trace with hash -32858344, now seen corresponding path program 1 times [2018-01-24 12:20:21,734 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:21,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:21,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:21,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:21,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:21,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:22,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:20:22,143 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:20:22,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:22,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:20:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:20:22,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:20:22,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 25 [2018-01-24 12:20:22,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 12:20:22,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 12:20:22,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-01-24 12:20:22,325 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 25 states. [2018-01-24 12:20:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:23,449 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2018-01-24 12:20:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-24 12:20:23,450 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-01-24 12:20:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:23,450 INFO L225 Difference]: With dead ends: 144 [2018-01-24 12:20:23,451 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 12:20:23,451 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=2057, Unknown=0, NotChecked=0, Total=2256 [2018-01-24 12:20:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 12:20:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-01-24 12:20:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 12:20:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-01-24 12:20:23,467 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 46 [2018-01-24 12:20:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:23,467 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-01-24 12:20:23,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 12:20:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-01-24 12:20:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 12:20:23,468 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:23,468 INFO L322 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-01-24 12:20:23,468 INFO L371 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:23,469 INFO L82 PathProgramCache]: Analyzing trace with hash -301259046, now seen corresponding path program 1 times [2018-01-24 12:20:23,469 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:23,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:23,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:23,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:23,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:23,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:23,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:23,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 12:20:23,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:20:23,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:20:23,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:20:23,737 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 15 states. [2018-01-24 12:20:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:24,220 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-01-24 12:20:24,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:20:24,220 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-01-24 12:20:24,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:24,221 INFO L225 Difference]: With dead ends: 107 [2018-01-24 12:20:24,221 INFO L226 Difference]: Without dead ends: 106 [2018-01-24 12:20:24,222 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:20:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-24 12:20:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-24 12:20:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 12:20:24,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-24 12:20:24,232 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 50 [2018-01-24 12:20:24,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:24,232 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-24 12:20:24,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:20:24,233 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-24 12:20:24,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:20:24,233 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:24,233 INFO L322 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-01-24 12:20:24,233 INFO L371 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:24,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1444311673, now seen corresponding path program 1 times [2018-01-24 12:20:24,233 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:24,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:24,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:24,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:24,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:24,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:20:24,790 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:20:24,791 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:20:24,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:24,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:20:24,933 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-01-24 12:20:24,940 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-01-24 12:20:24,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:24,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:24,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:24,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-01-24 12:20:25,029 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 45 treesize of output 36 [2018-01-24 12:20:25,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:20:25,036 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 36 treesize of output 47 [2018-01-24 12:20:25,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:25,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:25,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:25,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-24 12:20:25,054 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-01-24 12:20:25,056 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-01-24 12:20:25,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:25,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:25,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:25,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:16 [2018-01-24 12:20:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:20:25,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:20:25,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-01-24 12:20:25,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 12:20:25,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 12:20:25,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=644, Unknown=21, NotChecked=0, Total=756 [2018-01-24 12:20:25,213 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 28 states. [2018-01-24 12:20:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:26,192 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-01-24 12:20:26,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:20:26,193 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-01-24 12:20:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:26,194 INFO L225 Difference]: With dead ends: 112 [2018-01-24 12:20:26,194 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 12:20:26,194 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=1357, Unknown=26, NotChecked=0, Total=1560 [2018-01-24 12:20:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 12:20:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-24 12:20:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:20:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-01-24 12:20:26,204 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 48 [2018-01-24 12:20:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:26,204 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-01-24 12:20:26,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 12:20:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-01-24 12:20:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:20:26,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:26,205 INFO L322 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-01-24 12:20:26,205 INFO L371 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash -612693804, now seen corresponding path program 1 times [2018-01-24 12:20:26,206 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:26,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:26,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:26,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:26,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:26,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:26,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:26,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 12:20:26,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:20:26,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:20:26,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:20:26,401 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 13 states. [2018-01-24 12:20:26,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:26,797 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-01-24 12:20:26,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:20:26,798 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-01-24 12:20:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:26,798 INFO L225 Difference]: With dead ends: 88 [2018-01-24 12:20:26,798 INFO L226 Difference]: Without dead ends: 87 [2018-01-24 12:20:26,799 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:20:26,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-24 12:20:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-24 12:20:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-24 12:20:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-01-24 12:20:26,807 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 51 [2018-01-24 12:20:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:26,808 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-01-24 12:20:26,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:20:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-01-24 12:20:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:20:26,808 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:26,808 INFO L322 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-01-24 12:20:26,808 INFO L371 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:26,809 INFO L82 PathProgramCache]: Analyzing trace with hash -749095891, now seen corresponding path program 1 times [2018-01-24 12:20:26,809 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:26,809 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:26,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:26,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:26,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:26,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:27,137 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 20 DAG size of output 14 [2018-01-24 12:20:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 12:20:27,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:20:27,337 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:20:27,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:27,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:20:27,429 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-01-24 12:20:27,431 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-01-24 12:20:27,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:27,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:27,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:27,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-24 12:20:27,487 WARN L1029 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-01-24 12:20:27,503 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-01-24 12:20:27,507 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 16 treesize of output 17 [2018-01-24 12:20:27,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:27,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:27,514 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-01-24 12:20:27,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-24 12:20:27,634 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-01-24 12:20:27,635 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-01-24 12:20:27,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:27,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:27,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:27,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-24 12:20:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:20:27,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:20:27,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 30 [2018-01-24 12:20:27,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-24 12:20:27,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-24 12:20:27,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=779, Unknown=1, NotChecked=56, Total=930 [2018-01-24 12:20:27,663 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 31 states. [2018-01-24 12:20:32,448 WARN L146 SmtUtils]: Spent 4029ms on a formula simplification. DAG size of input: 34 DAG size of output 31 [2018-01-24 12:20:32,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:32,723 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-01-24 12:20:32,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 12:20:32,723 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2018-01-24 12:20:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:32,724 INFO L225 Difference]: With dead ends: 93 [2018-01-24 12:20:32,724 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 12:20:32,725 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=257, Invalid=2000, Unknown=3, NotChecked=92, Total=2352 [2018-01-24 12:20:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 12:20:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-01-24 12:20:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-24 12:20:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-01-24 12:20:32,738 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 51 [2018-01-24 12:20:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:32,738 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-01-24 12:20:32,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-24 12:20:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-01-24 12:20:32,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:20:32,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:32,739 INFO L322 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-01-24 12:20:32,739 INFO L371 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash -749095890, now seen corresponding path program 1 times [2018-01-24 12:20:32,740 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:32,740 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:32,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:32,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:32,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:32,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:33,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:20:33,607 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:20:33,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:33,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:20:33,651 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-01-24 12:20:33,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:33,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:33,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:20:33,698 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-01-24 12:20:33,699 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-01-24 12:20:33,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:33,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:33,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:33,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-24 12:20:33,796 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret2.base| Int) (f19_~a.offset Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) f19_~a.offset |f19_#t~ret2.base|))) (= |c_#valid| (store |c_old(#valid)| |f19_#t~ret2.base| 1)))) is different from true [2018-01-24 12:20:33,805 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-01-24 12:20:33,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:33,812 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-01-24 12:20:33,821 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2018-01-24 12:20:33,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:20:33,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:33,831 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-01-24 12:20:33,831 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:21 [2018-01-24 12:20:33,983 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-01-24 12:20:33,986 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-01-24 12:20:33,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:33,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:33,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:33,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-01-24 12:20:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:34,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:20:34,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 36 [2018-01-24 12:20:34,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-24 12:20:34,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-24 12:20:34,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1142, Unknown=1, NotChecked=68, Total=1332 [2018-01-24 12:20:34,015 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 37 states. [2018-01-24 12:20:39,095 WARN L146 SmtUtils]: Spent 4049ms on a formula simplification. DAG size of input: 50 DAG size of output 44 [2018-01-24 12:20:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:39,533 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-01-24 12:20:39,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 12:20:39,533 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 51 [2018-01-24 12:20:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:39,533 INFO L225 Difference]: With dead ends: 95 [2018-01-24 12:20:39,534 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 12:20:39,534 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=313, Invalid=2658, Unknown=3, NotChecked=106, Total=3080 [2018-01-24 12:20:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 12:20:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-01-24 12:20:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 12:20:39,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-24 12:20:39,543 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 51 [2018-01-24 12:20:39,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:39,544 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-24 12:20:39,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-24 12:20:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-24 12:20:39,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:20:39,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:39,544 INFO L322 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-01-24 12:20:39,544 INFO L371 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:39,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1813638726, now seen corresponding path program 1 times [2018-01-24 12:20:39,544 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:39,544 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:39,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:39,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:39,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:39,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:40,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:20:40,206 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:20:40,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:40,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:20:40,241 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-01-24 12:20:40,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:40,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:40,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:20:40,269 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-01-24 12:20:40,271 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-01-24 12:20:40,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:40,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:40,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:40,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-24 12:20:40,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:20:40,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:20:40,440 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-01-24 12:20:40,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:40,451 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-01-24 12:20:40,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:20:40,454 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 26 treesize of output 35 [2018-01-24 12:20:40,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:40,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:40,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:40,465 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:43 [2018-01-24 12:20:40,583 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 21 treesize of output 14 [2018-01-24 12:20:40,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:40,589 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-01-24 12:20:40,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:26 [2018-01-24 12:20:44,777 WARN L143 SmtUtils]: Spent 4017ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-24 12:20:44,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:20:44,891 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 31 treesize of output 47 [2018-01-24 12:20:44,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:44,905 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-01-24 12:20:44,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:51 [2018-01-24 12:20:44,972 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-01-24 12:20:44,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:20:44,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:20:44,982 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-01-24 12:20:44,983 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:20:44,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:20:45,003 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-01-24 12:20:45,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-01-24 12:20:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:45,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:20:45,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 35 [2018-01-24 12:20:45,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-24 12:20:45,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-24 12:20:45,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1144, Unknown=8, NotChecked=0, Total=1260 [2018-01-24 12:20:45,073 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 36 states. [2018-01-24 12:20:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:48,207 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-01-24 12:20:48,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 12:20:48,207 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2018-01-24 12:20:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:48,208 INFO L225 Difference]: With dead ends: 94 [2018-01-24 12:20:48,208 INFO L226 Difference]: Without dead ends: 93 [2018-01-24 12:20:48,209 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=250, Invalid=2498, Unknown=8, NotChecked=0, Total=2756 [2018-01-24 12:20:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-24 12:20:48,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-01-24 12:20:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-24 12:20:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-01-24 12:20:48,218 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 52 [2018-01-24 12:20:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:48,218 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-01-24 12:20:48,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-24 12:20:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-01-24 12:20:48,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:20:48,218 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:48,218 INFO L322 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-01-24 12:20:48,218 INFO L371 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:48,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1679349496, now seen corresponding path program 1 times [2018-01-24 12:20:48,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:48,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:48,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:48,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:48,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:48,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:20:48,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:20:48,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:20:48,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:20:48,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:20:48,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:20:48,272 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 5 states. [2018-01-24 12:20:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:20:48,291 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-01-24 12:20:48,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:20:48,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-01-24 12:20:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:20:48,293 INFO L225 Difference]: With dead ends: 102 [2018-01-24 12:20:48,293 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 12:20:48,294 INFO L525 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-01-24 12:20:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 12:20:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-01-24 12:20:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-24 12:20:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-01-24 12:20:48,311 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 52 [2018-01-24 12:20:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:20:48,312 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-01-24 12:20:48,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:20:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-01-24 12:20:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 12:20:48,312 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:20:48,313 INFO L322 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-01-24 12:20:48,313 INFO L371 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-24 12:20:48,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1775270255, now seen corresponding path program 1 times [2018-01-24 12:20:48,313 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:20:48,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:20:48,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:48,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:48,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:20:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:48,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:20:48,625 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 17 DAG size of output 15 [2018-01-24 12:20:48,849 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 23 DAG size of output 21 [2018-01-24 12:20:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:49,318 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:20:49,318 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:20:49,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:20:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:20:49,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:20:49,359 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-01-24 12:20:49,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:49,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:49,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:20:49,467 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-01-24 12:20:49,468 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-01-24 12:20:49,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:49,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:49,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:49,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-24 12:20:49,571 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-01-24 12:20:49,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:20:49,574 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-01-24 12:20:49,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:49,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:49,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:49,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2018-01-24 12:20:49,614 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 11 treesize of output 1 [2018-01-24 12:20:49,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:49,617 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-01-24 12:20:49,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-24 12:20:55,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:20:55,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:20:55,732 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 17 treesize of output 10 [2018-01-24 12:20:55,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:55,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:55,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-01-24 12:20:55,817 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 30 treesize of output 24 [2018-01-24 12:20:55,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 9 [2018-01-24 12:20:55,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:55,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:55,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:20:55,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:14 [2018-01-24 12:20:55,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:20:55,860 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 12 treesize of output 21 [2018-01-24 12:20:55,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:20:55,911 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-01-24 12:20:55,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-24 12:20:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:20:56,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:20:56,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-01-24 12:20:56,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-24 12:20:56,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-24 12:20:56,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1379, Unknown=5, NotChecked=0, Total=1482 [2018-01-24 12:20:56,343 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 39 states. [2018-01-24 12:21:01,621 WARN L146 SmtUtils]: Spent 1517ms on a formula simplification. DAG size of input: 38 DAG size of output 24 Received shutdown request... [2018-01-24 12:21:05,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:21:05,332 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:21:05,336 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:21:05,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:21:05 BoogieIcfgContainer [2018-01-24 12:21:05,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:21:05,337 INFO L168 Benchmark]: Toolchain (without parser) took 55049.37 ms. Allocated memory was 300.9 MB in the beginning and 713.6 MB in the end (delta: 412.6 MB). Free memory was 260.0 MB in the beginning and 563.1 MB in the end (delta: -303.1 MB). Peak memory consumption was 109.5 MB. Max. memory is 5.3 GB. [2018-01-24 12:21:05,338 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:21:05,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.07 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 246.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:21:05,338 INFO L168 Benchmark]: Boogie Preprocessor took 33.73 ms. Allocated memory is still 300.9 MB. Free memory was 246.9 MB in the beginning and 244.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:21:05,339 INFO L168 Benchmark]: RCFGBuilder took 313.74 ms. Allocated memory is still 300.9 MB. Free memory was 244.9 MB in the beginning and 221.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:21:05,339 INFO L168 Benchmark]: TraceAbstraction took 54477.69 ms. Allocated memory was 300.9 MB in the beginning and 713.6 MB in the end (delta: 412.6 MB). Free memory was 221.2 MB in the beginning and 563.1 MB in the end (delta: -341.9 MB). Peak memory consumption was 70.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:21:05,341 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 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.07 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 246.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.73 ms. Allocated memory is still 300.9 MB. Free memory was 246.9 MB in the beginning and 244.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 313.74 ms. Allocated memory is still 300.9 MB. Free memory was 244.9 MB in the beginning and 221.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54477.69 ms. Allocated memory was 300.9 MB in the beginning and 713.6 MB in the end (delta: 412.6 MB). Free memory was 221.2 MB in the beginning and 563.1 MB in the end (delta: -341.9 MB). Peak memory consumption was 70.7 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 constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1457). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1458). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1458). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1457). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1491]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1491). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1441). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1441). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1440). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1440). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 19 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 89 locations, 21 error locations. TIMEOUT Result, 54.4s OverallTime, 32 OverallIterations, 2 TraceHistogramMax, 32.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2122 SDtfs, 2236 SDslu, 10632 SDs, 0 SdLazy, 11203 SolverSat, 757 SolverUnsat, 87 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 977 GetRequests, 357 SyntacticMatches, 23 SemanticMatches, 596 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3962 ImplicationChecksByTransitivity, 32.4s 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, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 330 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 1615 NumberOfCodeBlocks, 1615 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1574 ConstructedInterpolants, 73 QuantifiedInterpolants, 604616 SizeOfPredicates, 86 NumberOfNonLiveVariables, 1810 ConjunctsInSsa, 287 ConjunctsInUnsatCore, 41 InterpolantComputations, 29 PerfectInterpolantSequences, 127/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-21-05-348.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-21-05-348.csv Completed graceful shutdown