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_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:29:38,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:29:38,913 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:29:38,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:29:38,925 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:29:38,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:29:38,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:29:38,929 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:29:38,930 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:29:38,931 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:29:38,931 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:29:38,932 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:29:38,932 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:29:38,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:29:38,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:29:38,936 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:29:38,938 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:29:38,940 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:29:38,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:29:38,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:29:38,944 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:29:38,945 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:29:38,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:29:38,946 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:29:38,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:29:38,948 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:29:38,948 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:29:38,949 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:29:38,949 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:29:38,949 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:29:38,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:29:38,950 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:29:38,959 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:29:38,959 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:29:38,960 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:29:38,960 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:29:38,960 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:29:38,961 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:29:38,961 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:29:38,961 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:29:38,961 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:29:38,962 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:29:38,962 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:29:38,962 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:29:38,962 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:29:38,962 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:29:38,963 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:29:38,963 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:29:38,963 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:29:38,963 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:29:38,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:29:38,963 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:29:38,964 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:29:38,964 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:29:38,964 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:29:38,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:29:38,964 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:29:38,965 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:29:38,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:29:38,965 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:29:38,965 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:29:38,965 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:29:38,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:29:38,966 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:29:38,966 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:29:38,966 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:29:38,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:29:39,010 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:29:39,013 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:29:39,015 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:29:39,015 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:29:39,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-24 12:29:39,199 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:29:39,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:29:39,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:29:39,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:29:39,210 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:29:39,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:29:39" (1/1) ... [2018-01-24 12:29:39,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:29:39, skipping insertion in model container [2018-01-24 12:29:39,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:29:39" (1/1) ... [2018-01-24 12:29:39,231 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:29:39,279 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:29:39,391 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:29:39,410 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:29:39,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:29:39 WrapperNode [2018-01-24 12:29:39,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:29:39,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:29:39,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:29:39,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:29:39,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:29:39" (1/1) ... [2018-01-24 12:29:39,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:29:39" (1/1) ... [2018-01-24 12:29:39,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:29:39" (1/1) ... [2018-01-24 12:29:39,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:29:39" (1/1) ... [2018-01-24 12:29:39,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:29:39" (1/1) ... [2018-01-24 12:29:39,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:29:39" (1/1) ... [2018-01-24 12:29:39,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:29:39" (1/1) ... [2018-01-24 12:29:39,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:29:39,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:29:39,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:29:39,456 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:29:39,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:29:39" (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:29:39,504 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:29:39,505 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:29:39,505 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:29:39,505 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-01-24 12:29:39,505 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-01-24 12:29:39,505 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-01-24 12:29:39,505 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-01-24 12:29:39,505 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-01-24 12:29:39,506 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:29:39,506 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:29:39,506 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:29:39,506 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:29:39,506 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:29:39,506 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:29:39,506 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:29:39,506 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:29:39,506 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:29:39,506 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:29:39,507 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:29:39,507 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-01-24 12:29:39,507 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-01-24 12:29:39,507 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-01-24 12:29:39,507 INFO L128 BoogieDeclarations]: Found specification of procedure probe_19 [2018-01-24 12:29:39,507 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-01-24 12:29:39,507 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:29:39,507 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:29:39,507 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:29:39,508 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:29:39,793 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:29:39,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:29:39 BoogieIcfgContainer [2018-01-24 12:29:39,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:29:39,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:29:39,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:29:39,798 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:29:39,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:29:39" (1/3) ... [2018-01-24 12:29:39,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1449c7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:29:39, skipping insertion in model container [2018-01-24 12:29:39,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:29:39" (2/3) ... [2018-01-24 12:29:39,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1449c7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:29:39, skipping insertion in model container [2018-01-24 12:29:39,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:29:39" (3/3) ... [2018-01-24 12:29:39,802 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-24 12:29:39,808 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:29:39,814 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-24 12:29:39,859 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:29:39,859 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:29:39,859 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:29:39,859 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:29:39,859 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:29:39,859 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:29:39,859 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:29:39,860 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:29:39,860 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:29:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-01-24 12:29:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:29:39,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:39,883 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:29:39,883 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:39,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506467, now seen corresponding path program 1 times [2018-01-24 12:29:39,888 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:39,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:39,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:39,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:39,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:40,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:40,149 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:29:40,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:40,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:29:40,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:29:40,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:29:40,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:29:40,244 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 6 states. [2018-01-24 12:29:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:40,742 INFO L93 Difference]: Finished difference Result 139 states and 163 transitions. [2018-01-24 12:29:40,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:29:40,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 12:29:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:40,791 INFO L225 Difference]: With dead ends: 139 [2018-01-24 12:29:40,792 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 12:29:40,795 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:29:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 12:29:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-01-24 12:29:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 12:29:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-01-24 12:29:40,846 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-01-24 12:29:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:40,847 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-01-24 12:29:40,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:29:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-01-24 12:29:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:29:40,849 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:40,849 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:29:40,849 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:40,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506468, now seen corresponding path program 1 times [2018-01-24 12:29:40,849 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:40,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:40,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:40,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:40,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:40,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:41,012 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:29:41,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:41,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:29:41,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:29:41,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:29:41,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:29:41,015 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-01-24 12:29:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:41,322 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2018-01-24 12:29:41,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:29:41,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 12:29:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:41,324 INFO L225 Difference]: With dead ends: 129 [2018-01-24 12:29:41,324 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 12:29:41,325 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 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:29:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 12:29:41,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-01-24 12:29:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 12:29:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-01-24 12:29:41,338 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 15 [2018-01-24 12:29:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:41,338 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-01-24 12:29:41,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:29:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-01-24 12:29:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:29:41,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:41,339 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:29:41,340 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:41,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488357, now seen corresponding path program 1 times [2018-01-24 12:29:41,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:41,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:41,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:41,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:41,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:41,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:41,480 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:29:41,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:41,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:29:41,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:29:41,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:29:41,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:29:41,481 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 8 states. [2018-01-24 12:29:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:41,994 INFO L93 Difference]: Finished difference Result 149 states and 177 transitions. [2018-01-24 12:29:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:29:41,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-24 12:29:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:41,997 INFO L225 Difference]: With dead ends: 149 [2018-01-24 12:29:41,997 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 12:29:41,997 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:29:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 12:29:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2018-01-24 12:29:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 12:29:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2018-01-24 12:29:42,017 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 17 [2018-01-24 12:29:42,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:42,017 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2018-01-24 12:29:42,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:29:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2018-01-24 12:29:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:29:42,018 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:42,018 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:29:42,019 INFO L371 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488358, now seen corresponding path program 1 times [2018-01-24 12:29:42,019 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:42,019 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:42,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:42,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:42,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:42,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:42,167 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:29:42,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:42,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:29:42,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:29:42,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:29:42,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:29:42,168 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 9 states. [2018-01-24 12:29:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:42,560 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2018-01-24 12:29:42,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:29:42,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-01-24 12:29:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:42,563 INFO L225 Difference]: With dead ends: 152 [2018-01-24 12:29:42,563 INFO L226 Difference]: Without dead ends: 149 [2018-01-24 12:29:42,563 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:29:42,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-24 12:29:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 82. [2018-01-24 12:29:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 12:29:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-01-24 12:29:42,576 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 17 [2018-01-24 12:29:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:42,577 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-01-24 12:29:42,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:29:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-01-24 12:29:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:29:42,578 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:42,578 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:29:42,579 INFO L371 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1193563309, now seen corresponding path program 1 times [2018-01-24 12:29:42,579 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:42,579 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:42,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:42,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:42,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:42,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:42,710 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:29:42,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:29:42,710 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:29:42,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:42,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:29:42,824 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:29:42,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:42,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:42,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:29:42,928 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:29:42,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:29:42,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2018-01-24 12:29:42,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:29:42,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:29:42,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:29:42,951 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 12 states. [2018-01-24 12:29:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:43,387 INFO L93 Difference]: Finished difference Result 180 states and 204 transitions. [2018-01-24 12:29:43,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:29:43,388 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-01-24 12:29:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:43,389 INFO L225 Difference]: With dead ends: 180 [2018-01-24 12:29:43,389 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 12:29:43,390 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:29:43,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 12:29:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2018-01-24 12:29:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:29:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-01-24 12:29:43,403 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 26 [2018-01-24 12:29:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:43,403 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-01-24 12:29:43,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:29:43,403 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-01-24 12:29:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:29:43,404 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:43,404 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:29:43,405 INFO L371 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:43,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443383, now seen corresponding path program 1 times [2018-01-24 12:29:43,405 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:43,405 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:43,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:43,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:43,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:43,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:43,469 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:29:43,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:43,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:29:43,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:29:43,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:29:43,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:29:43,470 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 8 states. [2018-01-24 12:29:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:43,590 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2018-01-24 12:29:43,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:29:43,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-01-24 12:29:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:43,592 INFO L225 Difference]: With dead ends: 102 [2018-01-24 12:29:43,592 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 12:29:43,592 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:29:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 12:29:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-01-24 12:29:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 12:29:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-01-24 12:29:43,608 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 26 [2018-01-24 12:29:43,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:43,608 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-01-24 12:29:43,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:29:43,608 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-01-24 12:29:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:29:43,609 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:43,610 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:29:43,610 INFO L371 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:43,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443382, now seen corresponding path program 1 times [2018-01-24 12:29:43,610 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:43,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:43,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:43,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:43,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:43,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:43,672 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:29:43,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:43,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:29:43,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:29:43,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:29:43,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:29:43,673 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 6 states. [2018-01-24 12:29:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:43,726 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-01-24 12:29:43,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:29:43,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 12:29:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:43,728 INFO L225 Difference]: With dead ends: 124 [2018-01-24 12:29:43,728 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 12:29:43,729 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:29:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 12:29:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-01-24 12:29:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 12:29:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-01-24 12:29:43,743 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 26 [2018-01-24 12:29:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:43,744 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-01-24 12:29:43,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:29:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-01-24 12:29:43,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:29:43,745 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:43,745 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:29:43,745 INFO L371 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:43,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265042, now seen corresponding path program 1 times [2018-01-24 12:29:43,746 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:43,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:43,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:43,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:43,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:43,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:43,872 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:29:43,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:43,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:29:43,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:29:43,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:29:43,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:29:43,874 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 9 states. [2018-01-24 12:29:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:44,234 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-01-24 12:29:44,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:29:44,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-24 12:29:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:44,235 INFO L225 Difference]: With dead ends: 114 [2018-01-24 12:29:44,235 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 12:29:44,236 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:29:44,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 12:29:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2018-01-24 12:29:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 12:29:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-01-24 12:29:44,246 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 28 [2018-01-24 12:29:44,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:44,247 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-01-24 12:29:44,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:29:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-01-24 12:29:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:29:44,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:44,248 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:29:44,248 INFO L371 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860499, now seen corresponding path program 1 times [2018-01-24 12:29:44,249 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:44,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:44,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:44,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:44,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:44,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:44,550 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:29:44,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:44,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:29:44,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:29:44,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:29:44,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:29:44,552 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 8 states. [2018-01-24 12:29:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:44,962 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-01-24 12:29:44,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:29:44,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-01-24 12:29:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:44,964 INFO L225 Difference]: With dead ends: 118 [2018-01-24 12:29:44,964 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 12:29:44,964 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:29:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 12:29:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2018-01-24 12:29:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 12:29:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-01-24 12:29:44,975 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 30 [2018-01-24 12:29:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:44,976 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-01-24 12:29:44,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:29:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-01-24 12:29:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:29:44,977 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:44,977 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:29:44,977 INFO L371 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:44,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860500, now seen corresponding path program 1 times [2018-01-24 12:29:44,978 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:44,978 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:44,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:44,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:44,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:44,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:45,306 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:29:45,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:45,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 12:29:45,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:29:45,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:29:45,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:29:45,308 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 12 states. [2018-01-24 12:29:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:45,855 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-01-24 12:29:45,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:29:45,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-01-24 12:29:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:45,856 INFO L225 Difference]: With dead ends: 126 [2018-01-24 12:29:45,857 INFO L226 Difference]: Without dead ends: 124 [2018-01-24 12:29:45,857 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-01-24 12:29:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-24 12:29:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-01-24 12:29:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 12:29:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-01-24 12:29:45,875 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2018-01-24 12:29:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:45,875 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-01-24 12:29:45,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:29:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-01-24 12:29:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:29:45,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:45,877 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:29:45,877 INFO L371 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:45,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1708399928, now seen corresponding path program 1 times [2018-01-24 12:29:45,877 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:45,877 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:45,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:45,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:45,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:45,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:45,961 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:29:45,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:45,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:29:45,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:29:45,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:29:45,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:29:45,963 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 4 states. [2018-01-24 12:29:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:46,082 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-01-24 12:29:46,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:29:46,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-24 12:29:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:46,084 INFO L225 Difference]: With dead ends: 106 [2018-01-24 12:29:46,084 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 12:29:46,084 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:29:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 12:29:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-01-24 12:29:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-24 12:29:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-24 12:29:46,095 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 28 [2018-01-24 12:29:46,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:46,095 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-24 12:29:46,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:29:46,096 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-24 12:29:46,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:29:46,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:46,097 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:29:46,097 INFO L371 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:46,097 INFO L82 PathProgramCache]: Analyzing trace with hash -526031434, now seen corresponding path program 1 times [2018-01-24 12:29:46,097 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:46,097 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:46,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:46,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:46,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:46,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:46,146 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:29:46,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:46,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:29:46,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:29:46,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:29:46,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:29:46,147 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-01-24 12:29:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:46,206 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2018-01-24 12:29:46,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:29:46,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-24 12:29:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:46,207 INFO L225 Difference]: With dead ends: 91 [2018-01-24 12:29:46,207 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 12:29:46,207 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:29:46,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 12:29:46,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-24 12:29:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 12:29:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-01-24 12:29:46,216 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 30 [2018-01-24 12:29:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:46,216 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-01-24 12:29:46,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:29:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-01-24 12:29:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 12:29:46,217 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:46,217 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:29:46,217 INFO L371 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:46,218 INFO L82 PathProgramCache]: Analyzing trace with hash 850149805, now seen corresponding path program 1 times [2018-01-24 12:29:46,218 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:46,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:46,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:46,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:46,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:46,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:46,296 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:29:46,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:46,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:29:46,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:29:46,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:29:46,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:29:46,297 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 5 states. [2018-01-24 12:29:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:46,336 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-01-24 12:29:46,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:29:46,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-24 12:29:46,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:46,338 INFO L225 Difference]: With dead ends: 124 [2018-01-24 12:29:46,338 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 12:29:46,339 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:29:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 12:29:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-01-24 12:29:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 12:29:46,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-24 12:29:46,347 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 37 [2018-01-24 12:29:46,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:46,347 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-24 12:29:46,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:29:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-24 12:29:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 12:29:46,348 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:46,348 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:29:46,348 INFO L371 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:46,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653486, now seen corresponding path program 1 times [2018-01-24 12:29:46,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:46,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:46,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:46,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:46,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:46,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:46,602 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:29:46,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:29:46,602 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:29:46,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:46,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:29:46,667 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:29:46,668 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:29:46,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:46,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:46,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:46,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-24 12:29:46,713 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:29:46,724 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:29:46,727 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:29:46,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:46,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:46,734 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:29:46,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-24 12:29:46,748 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:29:46,750 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:29:46,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:46,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:46,752 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:29:46,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-24 12:29:46,757 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:29:46,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:29:46,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2018-01-24 12:29:46,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:29:46,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:29:46,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2018-01-24 12:29:46,790 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 19 states. [2018-01-24 12:29:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:47,230 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-24 12:29:47,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:29:47,231 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2018-01-24 12:29:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:47,231 INFO L225 Difference]: With dead ends: 84 [2018-01-24 12:29:47,231 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 12:29:47,232 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=4, NotChecked=56, Total=930 [2018-01-24 12:29:47,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 12:29:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-24 12:29:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 12:29:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-01-24 12:29:47,241 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 37 [2018-01-24 12:29:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:47,241 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-01-24 12:29:47,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:29:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-01-24 12:29:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 12:29:47,242 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:47,242 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:29:47,242 INFO L371 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:47,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653487, now seen corresponding path program 1 times [2018-01-24 12:29:47,242 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:47,242 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:47,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:47,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:47,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:47,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:47,520 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:29:47,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:29:47,520 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:29:47,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:47,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:29:47,552 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:29:47,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:47,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:47,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:29:47,568 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:29:47,570 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:29:47,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:47,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:47,575 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:29:47,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-24 12:29:47,679 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:29:47,692 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:29:47,694 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:29:47,707 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:29:47,730 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:29:47,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:35 [2018-01-24 12:29:47,771 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:29:47,774 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:29:47,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:47,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:47,791 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:29:47,799 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:29:47,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 12:29:47,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:29:47,824 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:29:47,824 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:24 [2018-01-24 12:29:47,864 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:29:47,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:29:47,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-01-24 12:29:47,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:29:47,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:29:47,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=431, Unknown=8, NotChecked=0, Total=506 [2018-01-24 12:29:47,887 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 23 states. [2018-01-24 12:29:48,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:48,432 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-01-24 12:29:48,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:29:48,433 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-01-24 12:29:48,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:48,434 INFO L225 Difference]: With dead ends: 104 [2018-01-24 12:29:48,434 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 12:29:48,435 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1020, Unknown=13, NotChecked=0, Total=1190 [2018-01-24 12:29:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 12:29:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-01-24 12:29:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 12:29:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-01-24 12:29:48,449 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 37 [2018-01-24 12:29:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:48,450 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-01-24 12:29:48,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:29:48,450 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-01-24 12:29:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 12:29:48,451 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:48,451 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:29:48,451 INFO L371 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:48,451 INFO L82 PathProgramCache]: Analyzing trace with hash 695150445, now seen corresponding path program 1 times [2018-01-24 12:29:48,451 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:48,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:48,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:48,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:48,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:48,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:29:48,524 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:29:48,524 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:48,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:29:48,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:29:48,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:29:48,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:29:48,525 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 7 states. [2018-01-24 12:29:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:48,586 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-24 12:29:48,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:29:48,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-24 12:29:48,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:48,588 INFO L225 Difference]: With dead ends: 140 [2018-01-24 12:29:48,588 INFO L226 Difference]: Without dead ends: 90 [2018-01-24 12:29:48,589 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:29:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-24 12:29:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-01-24 12:29:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:29:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-24 12:29:48,604 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 39 [2018-01-24 12:29:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:48,605 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-24 12:29:48,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:29:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-24 12:29:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:29:48,606 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:48,606 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:29:48,606 INFO L371 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:48,606 INFO L82 PathProgramCache]: Analyzing trace with hash -200066512, now seen corresponding path program 1 times [2018-01-24 12:29:48,606 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:48,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:48,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:48,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:48,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:48,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:48,659 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:29:48,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:48,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:29:48,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:29:48,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:29:48,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:29:48,660 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 6 states. [2018-01-24 12:29:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:48,838 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-01-24 12:29:48,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:29:48,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-24 12:29:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:48,839 INFO L225 Difference]: With dead ends: 105 [2018-01-24 12:29:48,839 INFO L226 Difference]: Without dead ends: 104 [2018-01-24 12:29:48,840 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:29:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-24 12:29:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-01-24 12:29:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 12:29:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-01-24 12:29:48,851 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 44 [2018-01-24 12:29:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:48,851 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-01-24 12:29:48,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:29:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-01-24 12:29:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:29:48,852 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:48,852 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:29:48,852 INFO L371 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:48,852 INFO L82 PathProgramCache]: Analyzing trace with hash -200066511, now seen corresponding path program 1 times [2018-01-24 12:29:48,852 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:48,852 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:48,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:48,853 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:48,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:48,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:48,962 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:29:48,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:48,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:29:48,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:29:48,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:29:48,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:29:48,963 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 6 states. [2018-01-24 12:29:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:49,127 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2018-01-24 12:29:49,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:29:49,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-24 12:29:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:49,128 INFO L225 Difference]: With dead ends: 145 [2018-01-24 12:29:49,128 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 12:29:49,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:29:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 12:29:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-24 12:29:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 12:29:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-01-24 12:29:49,146 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 44 [2018-01-24 12:29:49,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:49,147 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-01-24 12:29:49,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:29:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-01-24 12:29:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:29:49,147 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:49,147 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:29:49,148 INFO L371 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:49,148 INFO L82 PathProgramCache]: Analyzing trace with hash -705625136, now seen corresponding path program 1 times [2018-01-24 12:29:49,148 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:49,148 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:49,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:49,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:49,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:49,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:49,207 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:29:49,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:49,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:29:49,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:29:49,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:29:49,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:29:49,208 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 5 states. [2018-01-24 12:29:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:49,251 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-24 12:29:49,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:29:49,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-01-24 12:29:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:49,253 INFO L225 Difference]: With dead ends: 139 [2018-01-24 12:29:49,253 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 12:29:49,254 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:29:49,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 12:29:49,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-01-24 12:29:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:29:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-01-24 12:29:49,265 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 44 [2018-01-24 12:29:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:49,265 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-01-24 12:29:49,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:29:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-01-24 12:29:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:29:49,266 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:49,266 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:29:49,266 INFO L371 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:49,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1264018930, now seen corresponding path program 1 times [2018-01-24 12:29:49,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:49,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:49,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:49,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:49,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:49,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:49,405 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:29:49,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:49,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:29:49,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:29:49,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:29:49,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:29:49,407 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 8 states. [2018-01-24 12:29:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:49,587 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-01-24 12:29:49,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:29:49,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-01-24 12:29:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:49,588 INFO L225 Difference]: With dead ends: 97 [2018-01-24 12:29:49,589 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 12:29:49,589 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:29:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 12:29:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2018-01-24 12:29:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-24 12:29:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-01-24 12:29:49,603 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 46 [2018-01-24 12:29:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:49,604 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-01-24 12:29:49,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:29:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-01-24 12:29:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:29:49,605 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:49,605 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:29:49,605 INFO L371 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:49,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1264018931, now seen corresponding path program 1 times [2018-01-24 12:29:49,606 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:49,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:49,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:49,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:49,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:49,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:49,770 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:29:49,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:49,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:29:49,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:29:49,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:29:49,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:29:49,771 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 11 states. [2018-01-24 12:29:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:49,939 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-01-24 12:29:49,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:29:49,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-01-24 12:29:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:49,940 INFO L225 Difference]: With dead ends: 97 [2018-01-24 12:29:49,940 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 12:29:49,941 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:29:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 12:29:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-01-24 12:29:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 12:29:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-24 12:29:49,949 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 46 [2018-01-24 12:29:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:49,949 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-24 12:29:49,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:29:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-24 12:29:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:29:49,950 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:49,950 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:29:49,950 INFO L371 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:49,950 INFO L82 PathProgramCache]: Analyzing trace with hash 529881151, now seen corresponding path program 1 times [2018-01-24 12:29:49,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:49,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:49,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:49,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:49,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:49,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:50,069 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:29:50,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:50,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:29:50,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:29:50,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:29:50,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:29:50,070 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 11 states. [2018-01-24 12:29:50,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:50,576 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2018-01-24 12:29:50,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:29:50,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-01-24 12:29:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:50,580 INFO L225 Difference]: With dead ends: 98 [2018-01-24 12:29:50,580 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 12:29:50,580 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:29:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 12:29:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-01-24 12:29:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 12:29:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-01-24 12:29:50,596 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 47 [2018-01-24 12:29:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:50,597 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-01-24 12:29:50,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:29:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-01-24 12:29:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:29:50,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:50,598 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:29:50,598 INFO L371 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:50,598 INFO L82 PathProgramCache]: Analyzing trace with hash 529881150, now seen corresponding path program 1 times [2018-01-24 12:29:50,598 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:50,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:50,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:50,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:50,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:50,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:50,757 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:29:50,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:50,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:29:50,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:29:50,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:29:50,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:29:50,759 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 11 states. [2018-01-24 12:29:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:50,932 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-01-24 12:29:50,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:29:50,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-01-24 12:29:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:50,934 INFO L225 Difference]: With dead ends: 95 [2018-01-24 12:29:50,935 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 12:29:50,935 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:29:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 12:29:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-24 12:29:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 12:29:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-01-24 12:29:50,945 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 47 [2018-01-24 12:29:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:50,945 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-01-24 12:29:50,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:29:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-01-24 12:29:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:29:50,946 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:50,946 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:29:50,946 INFO L371 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:50,946 INFO L82 PathProgramCache]: Analyzing trace with hash 365897592, now seen corresponding path program 1 times [2018-01-24 12:29:50,946 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:50,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:50,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:50,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:50,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:50,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:51,351 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:29:51,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:29:51,352 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:29:51,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:51,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:29:51,499 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:29:51,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:29:51,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 25 [2018-01-24 12:29:51,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 12:29:51,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 12:29:51,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-01-24 12:29:51,520 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 25 states. [2018-01-24 12:29:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:52,662 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2018-01-24 12:29:52,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-24 12:29:52,662 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-01-24 12:29:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:52,663 INFO L225 Difference]: With dead ends: 144 [2018-01-24 12:29:52,663 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 12:29:52,664 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:29:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 12:29:52,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-01-24 12:29:52,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 12:29:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-01-24 12:29:52,677 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 46 [2018-01-24 12:29:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:52,678 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-01-24 12:29:52,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 12:29:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-01-24 12:29:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 12:29:52,678 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:52,678 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:29:52,678 INFO L371 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:52,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1831313542, now seen corresponding path program 1 times [2018-01-24 12:29:52,679 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:52,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:52,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:52,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:52,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:52,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:52,932 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:29:52,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:52,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 12:29:52,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:29:52,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:29:52,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:29:52,933 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 15 states. [2018-01-24 12:29:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:53,429 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-01-24 12:29:53,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:29:53,429 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-01-24 12:29:53,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:53,430 INFO L225 Difference]: With dead ends: 107 [2018-01-24 12:29:53,430 INFO L226 Difference]: Without dead ends: 106 [2018-01-24 12:29:53,430 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:29:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-24 12:29:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-24 12:29:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 12:29:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-24 12:29:53,444 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 50 [2018-01-24 12:29:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:53,444 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-24 12:29:53,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:29:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-24 12:29:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:29:53,445 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:53,445 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:29:53,445 INFO L371 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:53,445 INFO L82 PathProgramCache]: Analyzing trace with hash -522729561, now seen corresponding path program 1 times [2018-01-24 12:29:53,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:53,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:53,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:53,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:53,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:53,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:54,022 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:29:54,022 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:29:54,022 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:29:54,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:54,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:29:54,183 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:29:54,187 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:29:54,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:54,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:54,204 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:29:54,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-01-24 12:29:54,282 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:29:54,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:29:54,290 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:29:54,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:54,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:54,302 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:29:54,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-24 12:29:54,305 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:29:54,307 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:29:54,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:54,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:54,313 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:29:54,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:16 [2018-01-24 12:29:54,429 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:29:54,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:29:54,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-01-24 12:29:54,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 12:29:54,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 12:29:54,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=644, Unknown=21, NotChecked=0, Total=756 [2018-01-24 12:29:54,450 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 28 states. [2018-01-24 12:29:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:55,317 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-01-24 12:29:55,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:29:55,317 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-01-24 12:29:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:55,318 INFO L225 Difference]: With dead ends: 112 [2018-01-24 12:29:55,318 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 12:29:55,319 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=177, Invalid=1357, Unknown=26, NotChecked=0, Total=1560 [2018-01-24 12:29:55,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 12:29:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-24 12:29:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:29:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-01-24 12:29:55,334 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 48 [2018-01-24 12:29:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:55,334 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-01-24 12:29:55,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 12:29:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-01-24 12:29:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:29:55,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:55,337 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:29:55,337 INFO L371 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:55,338 INFO L82 PathProgramCache]: Analyzing trace with hash 680328992, now seen corresponding path program 1 times [2018-01-24 12:29:55,338 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:55,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:55,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:55,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:55,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:55,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:55,535 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:29:55,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:29:55,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 12:29:55,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:29:55,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:29:55,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:29:55,537 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 13 states. [2018-01-24 12:29:55,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:29:55,870 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-01-24 12:29:55,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:29:55,897 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-01-24 12:29:55,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:29:55,898 INFO L225 Difference]: With dead ends: 88 [2018-01-24 12:29:55,898 INFO L226 Difference]: Without dead ends: 87 [2018-01-24 12:29:55,898 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:29:55,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-24 12:29:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-24 12:29:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-24 12:29:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-01-24 12:29:55,907 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 51 [2018-01-24 12:29:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:29:55,907 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-01-24 12:29:55,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:29:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-01-24 12:29:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:29:55,907 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:29:55,908 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:29:55,908 INFO L371 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:29:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash -936145011, now seen corresponding path program 1 times [2018-01-24 12:29:55,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:29:55,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:29:55,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:55,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:55,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:29:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:55,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:29:56,106 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 14 DAG size of output 11 [2018-01-24 12:29:56,357 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:29:56,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:29:56,357 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:29:56,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:29:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:29:56,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:29:56,450 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:29:56,451 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:29:56,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:56,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:56,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:56,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-24 12:29:56,504 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:29:56,523 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:29:56,526 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:29:56,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:56,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:56,532 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:29:56,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-24 12:29:56,639 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:29:56,640 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:29:56,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:29:56,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:29:56,642 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:29:56,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-24 12:29:56,645 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:29:56,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:29:56,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 30 [2018-01-24 12:29:56,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-24 12:29:56,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-24 12:29:56,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=779, Unknown=1, NotChecked=56, Total=930 [2018-01-24 12:29:56,665 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 31 states. [2018-01-24 12:30:01,125 WARN L146 SmtUtils]: Spent 4026ms on a formula simplification. DAG size of input: 34 DAG size of output 31 [2018-01-24 12:30:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:01,412 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-01-24 12:30:01,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 12:30:01,412 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2018-01-24 12:30:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:01,413 INFO L225 Difference]: With dead ends: 93 [2018-01-24 12:30:01,413 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 12:30:01,413 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=257, Invalid=2000, Unknown=3, NotChecked=92, Total=2352 [2018-01-24 12:30:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 12:30:01,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-01-24 12:30:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-24 12:30:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-01-24 12:30:01,422 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 51 [2018-01-24 12:30:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:01,423 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-01-24 12:30:01,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-24 12:30:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-01-24 12:30:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:30:01,424 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:01,424 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:30:01,424 INFO L371 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:30:01,424 INFO L82 PathProgramCache]: Analyzing trace with hash -936145010, now seen corresponding path program 1 times [2018-01-24 12:30:01,424 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:01,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:01,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:01,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:01,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:01,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:01,648 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 14 DAG size of output 11 [2018-01-24 12:30:02,222 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:30:02,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:30:02,222 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:30:02,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:02,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:30:02,276 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:30:02,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:02,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:30:02,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:30:02,338 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:30:02,340 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:30:02,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:02,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:30:02,346 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:30:02,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-24 12:30:02,447 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:30:02,456 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:30:02,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:02,463 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:30:02,471 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:30:02,472 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:30:02,478 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:30:02,482 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:30:02,483 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:21 [2018-01-24 12:30:02,610 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:30:02,612 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:30:02,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:02,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:30:02,613 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:30:02,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-01-24 12:30:02,617 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:30:02,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:30:02,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 36 [2018-01-24 12:30:02,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-24 12:30:02,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-24 12:30:02,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1142, Unknown=1, NotChecked=68, Total=1332 [2018-01-24 12:30:02,639 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 37 states. [2018-01-24 12:30:07,657 WARN L146 SmtUtils]: Spent 4053ms on a formula simplification. DAG size of input: 50 DAG size of output 44 [2018-01-24 12:30:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:08,050 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-01-24 12:30:08,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 12:30:08,050 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 51 [2018-01-24 12:30:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:08,051 INFO L225 Difference]: With dead ends: 95 [2018-01-24 12:30:08,051 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 12:30:08,052 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=313, Invalid=2658, Unknown=3, NotChecked=106, Total=3080 [2018-01-24 12:30:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 12:30:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-01-24 12:30:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 12:30:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-24 12:30:08,063 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 51 [2018-01-24 12:30:08,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:08,063 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-24 12:30:08,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-24 12:30:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-24 12:30:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:30:08,064 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:08,064 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:30:08,064 INFO L371 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:30:08,064 INFO L82 PathProgramCache]: Analyzing trace with hash -384637660, now seen corresponding path program 1 times [2018-01-24 12:30:08,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:08,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:08,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:08,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:08,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:08,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:08,774 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:30:08,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:30:08,774 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:30:08,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:08,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:30:08,806 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:30:08,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:08,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:30:08,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:30:08,830 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:30:08,832 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:30:08,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:08,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:30:08,836 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:30:08,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-24 12:30:08,996 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:30:08,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:30:08,998 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:30:08,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:09,010 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:30:09,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:30:09,012 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:30:09,013 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:09,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:30:09,024 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:30:09,024 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:43 [2018-01-24 12:30:09,143 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:30:09,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:09,148 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:30:09,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:26 [2018-01-24 12:30:13,339 WARN L143 SmtUtils]: Spent 4016ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-24 12:30:13,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:30:13,432 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 35 [2018-01-24 12:30:13,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:13,442 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:30:13,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:51 [2018-01-24 12:30:13,502 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:30:13,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:30:13,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:30:13,506 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:30:13,508 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:30:13,514 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:30:13,518 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:30:13,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-01-24 12:30:13,565 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:30:13,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:30:13,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 35 [2018-01-24 12:30:13,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-24 12:30:13,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-24 12:30:13,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1144, Unknown=8, NotChecked=0, Total=1260 [2018-01-24 12:30:13,588 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 36 states. [2018-01-24 12:30:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:16,670 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-01-24 12:30:16,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 12:30:16,670 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2018-01-24 12:30:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:16,670 INFO L225 Difference]: With dead ends: 94 [2018-01-24 12:30:16,670 INFO L226 Difference]: Without dead ends: 93 [2018-01-24 12:30:16,672 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=250, Invalid=2498, Unknown=8, NotChecked=0, Total=2756 [2018-01-24 12:30:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-24 12:30:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-01-24 12:30:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-24 12:30:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-01-24 12:30:16,681 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 52 [2018-01-24 12:30:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:16,681 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-01-24 12:30:16,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-24 12:30:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-01-24 12:30:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:30:16,682 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:16,682 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:30:16,682 INFO L371 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:30:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1081279336, now seen corresponding path program 1 times [2018-01-24 12:30:16,682 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:16,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:16,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:16,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:16,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:16,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:16,734 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:30:16,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:30:16,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:30:16,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:30:16,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:30:16,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:30:16,735 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 5 states. [2018-01-24 12:30:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:30:16,760 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-01-24 12:30:16,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:30:16,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-01-24 12:30:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:30:16,761 INFO L225 Difference]: With dead ends: 102 [2018-01-24 12:30:16,762 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 12:30:16,762 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:30:16,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 12:30:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-01-24 12:30:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-24 12:30:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-01-24 12:30:16,779 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 52 [2018-01-24 12:30:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:30:16,779 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-01-24 12:30:16,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:30:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-01-24 12:30:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 12:30:16,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:30:16,780 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:30:16,780 INFO L371 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-24 12:30:16,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1569562575, now seen corresponding path program 1 times [2018-01-24 12:30:16,780 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:30:16,780 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:30:16,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:16,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:16,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:30:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:16,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:30:17,401 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:30:17,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:30:17,401 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:30:17,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:30:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:30:17,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:30:17,433 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:30:17,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:17,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:30:17,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:30:17,558 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:30:17,560 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:30:17,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:17,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:30:17,567 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:30:17,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-24 12:30:17,670 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:30:17,673 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:30:17,674 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:30:17,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:17,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:30:17,686 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:30:17,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2018-01-24 12:30:17,713 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:30:17,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:17,716 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:30:17,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-24 12:30:22,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:30:22,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:30:22,288 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:30:22,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:22,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:30:22,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-01-24 12:30:22,384 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:30:22,385 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:30:22,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:22,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:30:22,391 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:30:22,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:14 [2018-01-24 12:30:22,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:30:22,420 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:30:22,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:30:22,426 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:30:22,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-24 12:30:22,570 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:30:22,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:30:22,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-01-24 12:30:22,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-24 12:30:22,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-24 12:30:22,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1375, Unknown=5, NotChecked=0, Total=1482 [2018-01-24 12:30:22,592 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 39 states. [2018-01-24 12:30:29,031 WARN L146 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 38 DAG size of output 24 Received shutdown request... [2018-01-24 12:30:37,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 12:30:37,426 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:30:37,431 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:30:37,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:30:37 BoogieIcfgContainer [2018-01-24 12:30:37,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:30:37,432 INFO L168 Benchmark]: Toolchain (without parser) took 58232.29 ms. Allocated memory was 300.9 MB in the beginning and 699.9 MB in the end (delta: 399.0 MB). Free memory was 259.8 MB in the beginning and 602.4 MB in the end (delta: -342.6 MB). Peak memory consumption was 56.4 MB. Max. memory is 5.3 GB. [2018-01-24 12:30:37,433 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 300.9 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:30:37,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.13 ms. Allocated memory is still 300.9 MB. Free memory was 259.8 MB in the beginning and 245.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:30:37,434 INFO L168 Benchmark]: Boogie Preprocessor took 33.13 ms. Allocated memory is still 300.9 MB. Free memory was 245.9 MB in the beginning and 243.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:30:37,434 INFO L168 Benchmark]: RCFGBuilder took 338.87 ms. Allocated memory is still 300.9 MB. Free memory was 243.9 MB in the beginning and 220.7 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:30:37,434 INFO L168 Benchmark]: TraceAbstraction took 57636.24 ms. Allocated memory was 300.9 MB in the beginning and 699.9 MB in the end (delta: 399.0 MB). Free memory was 220.7 MB in the beginning and 602.4 MB in the end (delta: -381.7 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:30:37,435 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.16 ms. Allocated memory is still 300.9 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.13 ms. Allocated memory is still 300.9 MB. Free memory was 259.8 MB in the beginning and 245.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.13 ms. Allocated memory is still 300.9 MB. Free memory was 245.9 MB in the beginning and 243.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 338.87 ms. Allocated memory is still 300.9 MB. Free memory was 243.9 MB in the beginning and 220.7 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57636.24 ms. Allocated memory was 300.9 MB in the beginning and 699.9 MB in the end (delta: 399.0 MB). Free memory was 220.7 MB in the beginning and 602.4 MB in the end (delta: -381.7 MB). Peak memory consumption was 17.3 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1490]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (92states) and interpolant automaton (currently 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - 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 20 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 89 locations, 21 error locations. TIMEOUT Result, 57.5s OverallTime, 32 OverallIterations, 2 TraceHistogramMax, 37.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2118 SDtfs, 2265 SDslu, 10661 SDs, 0 SdLazy, 11075 SolverSat, 777 SolverUnsat, 72 SolverUnknown, 0 SolverNotchecked, 18.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 974 GetRequests, 356 SyntacticMatches, 21 SemanticMatches, 597 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4030 ImplicationChecksByTransitivity, 32.6s 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, 325 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 1615 NumberOfCodeBlocks, 1615 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1574 ConstructedInterpolants, 73 QuantifiedInterpolants, 606928 SizeOfPredicates, 86 NumberOfNonLiveVariables, 1812 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_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-30-37-443.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-30-37-443.csv Completed graceful shutdown