java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:30:20,835 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:30:20,837 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:30:20,849 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:30:20,849 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:30:20,850 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:30:20,851 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:30:20,853 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:30:20,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:30:20,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:30:20,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:30:20,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:30:20,857 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:30:20,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:30:20,859 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:30:20,861 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:30:20,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:30:20,864 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:30:20,865 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:30:20,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:30:20,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:30:20,869 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:30:20,869 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:30:20,871 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:30:20,872 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:30:20,874 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:30:20,874 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:30:20,875 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:30:20,875 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:30:20,875 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:30:20,876 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:30:20,876 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:30:20,887 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:30:20,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:30:20,888 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:30:20,889 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:30:20,889 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:30:20,889 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:30:20,889 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:30:20,889 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:30:20,890 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:30:20,890 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:30:20,890 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:30:20,890 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:30:20,890 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:30:20,890 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:30:20,890 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:30:20,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:30:20,891 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:30:20,891 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:30:20,891 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:30:20,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:30:20,891 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:30:20,892 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:30:20,892 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:30:20,892 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:30:20,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:30:20,933 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:30:20,936 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:30:20,937 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:30:20,937 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:30:20,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i [2018-02-04 12:30:21,090 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:30:21,091 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:30:21,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:30:21,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:30:21,099 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:30:21,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:30:21" (1/1) ... [2018-02-04 12:30:21,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3643a13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:21, skipping insertion in model container [2018-02-04 12:30:21,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:30:21" (1/1) ... [2018-02-04 12:30:21,118 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:30:21,147 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:30:21,238 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:30:21,253 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:30:21,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:21 WrapperNode [2018-02-04 12:30:21,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:30:21,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:30:21,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:30:21,260 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:30:21,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:21" (1/1) ... [2018-02-04 12:30:21,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:21" (1/1) ... [2018-02-04 12:30:21,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:21" (1/1) ... [2018-02-04 12:30:21,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:21" (1/1) ... [2018-02-04 12:30:21,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:21" (1/1) ... [2018-02-04 12:30:21,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:21" (1/1) ... [2018-02-04 12:30:21,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:21" (1/1) ... [2018-02-04 12:30:21,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:30:21,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:30:21,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:30:21,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:30:21,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:21" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:30:21,341 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:30:21,341 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:30:21,341 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 12:30:21,341 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:30:21,341 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 12:30:21,341 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 12:30:21,342 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:30:21,342 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:30:21,342 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:30:21,342 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 12:30:21,342 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 12:30:21,342 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:30:21,342 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 12:30:21,342 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:30:21,343 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:30:21,343 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:30:21,703 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:30:21,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:30:21 BoogieIcfgContainer [2018-02-04 12:30:21,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:30:21,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:30:21,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:30:21,707 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:30:21,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:30:21" (1/3) ... [2018-02-04 12:30:21,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4ef7f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:30:21, skipping insertion in model container [2018-02-04 12:30:21,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:21" (2/3) ... [2018-02-04 12:30:21,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4ef7f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:30:21, skipping insertion in model container [2018-02-04 12:30:21,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:30:21" (3/3) ... [2018-02-04 12:30:21,710 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-02-04 12:30:21,717 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:30:21,727 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-02-04 12:30:21,760 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:30:21,760 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:30:21,760 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:30:21,760 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:30:21,761 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:30:21,761 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:30:21,761 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:30:21,761 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:30:21,762 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:30:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2018-02-04 12:30:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 12:30:21,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:21,781 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:21,781 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:21,785 INFO L82 PathProgramCache]: Analyzing trace with hash -758648706, now seen corresponding path program 1 times [2018-02-04 12:30:21,787 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:21,787 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:21,826 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:21,826 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:21,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:21,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:21,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:21,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:30:21,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:30:21,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:30:21,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:30:21,919 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 3 states. [2018-02-04 12:30:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:22,214 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 12:30:22,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:30:22,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 12:30:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:22,224 INFO L225 Difference]: With dead ends: 92 [2018-02-04 12:30:22,224 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 12:30:22,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:30:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 12:30:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-02-04 12:30:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 12:30:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-02-04 12:30:22,258 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 7 [2018-02-04 12:30:22,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:22,258 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-02-04 12:30:22,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:30:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-02-04 12:30:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 12:30:22,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:22,258 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:22,258 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash -758648705, now seen corresponding path program 1 times [2018-02-04 12:30:22,259 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:22,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:22,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:22,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:22,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:22,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:22,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:22,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:30:22,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:30:22,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:30:22,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:30:22,314 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 3 states. [2018-02-04 12:30:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:22,373 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-02-04 12:30:22,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:30:22,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 12:30:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:22,374 INFO L225 Difference]: With dead ends: 88 [2018-02-04 12:30:22,374 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 12:30:22,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:30:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 12:30:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-02-04 12:30:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 12:30:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-02-04 12:30:22,380 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 7 [2018-02-04 12:30:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:22,381 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-02-04 12:30:22,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:30:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-02-04 12:30:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:30:22,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:22,381 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:22,382 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:22,382 INFO L82 PathProgramCache]: Analyzing trace with hash 689934579, now seen corresponding path program 1 times [2018-02-04 12:30:22,382 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:22,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:22,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:22,383 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:22,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:22,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:22,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:22,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:30:22,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:30:22,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:30:22,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:30:22,462 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 5 states. [2018-02-04 12:30:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:22,842 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-02-04 12:30:22,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:30:22,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 12:30:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:22,843 INFO L225 Difference]: With dead ends: 83 [2018-02-04 12:30:22,843 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 12:30:22,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:30:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 12:30:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 12:30:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 12:30:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-02-04 12:30:22,851 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 13 [2018-02-04 12:30:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:22,852 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-02-04 12:30:22,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:30:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-02-04 12:30:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:30:22,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:22,852 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:22,852 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:22,853 INFO L82 PathProgramCache]: Analyzing trace with hash 689934580, now seen corresponding path program 1 times [2018-02-04 12:30:22,853 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:22,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:22,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:22,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:22,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:22,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:23,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:23,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:30:23,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:30:23,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:30:23,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:30:23,001 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 7 states. [2018-02-04 12:30:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:23,227 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-02-04 12:30:23,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:30:23,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-02-04 12:30:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:23,228 INFO L225 Difference]: With dead ends: 113 [2018-02-04 12:30:23,228 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 12:30:23,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:30:23,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 12:30:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2018-02-04 12:30:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 12:30:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-02-04 12:30:23,232 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 13 [2018-02-04 12:30:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:23,232 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-02-04 12:30:23,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:30:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-02-04 12:30:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:30:23,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:23,233 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:23,233 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:23,233 INFO L82 PathProgramCache]: Analyzing trace with hash -86864468, now seen corresponding path program 1 times [2018-02-04 12:30:23,233 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:23,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:23,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:23,234 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:23,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:23,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:23,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:23,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:30:23,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:30:23,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:30:23,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:30:23,262 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 4 states. [2018-02-04 12:30:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:23,325 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-02-04 12:30:23,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:30:23,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:30:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:23,326 INFO L225 Difference]: With dead ends: 99 [2018-02-04 12:30:23,326 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 12:30:23,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:30:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 12:30:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-02-04 12:30:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 12:30:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-04 12:30:23,332 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 14 [2018-02-04 12:30:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:23,332 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-04 12:30:23,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:30:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-04 12:30:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:30:23,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:23,332 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:23,332 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:23,332 INFO L82 PathProgramCache]: Analyzing trace with hash -86864467, now seen corresponding path program 1 times [2018-02-04 12:30:23,333 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:23,333 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:23,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:23,333 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:23,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:23,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:23,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:23,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:30:23,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:30:23,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:30:23,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:30:23,383 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 4 states. [2018-02-04 12:30:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:23,436 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-02-04 12:30:23,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:30:23,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:30:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:23,437 INFO L225 Difference]: With dead ends: 95 [2018-02-04 12:30:23,437 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 12:30:23,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:30:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 12:30:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-04 12:30:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 12:30:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-02-04 12:30:23,443 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 14 [2018-02-04 12:30:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:23,444 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-02-04 12:30:23,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:30:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-02-04 12:30:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:30:23,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:23,444 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:23,444 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:23,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1124026018, now seen corresponding path program 1 times [2018-02-04 12:30:23,444 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:23,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:23,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:23,445 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:23,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:23,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:23,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:23,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:30:23,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:30:23,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:30:23,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:30:23,528 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 8 states. [2018-02-04 12:30:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:23,799 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-02-04 12:30:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:30:23,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 12:30:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:23,800 INFO L225 Difference]: With dead ends: 92 [2018-02-04 12:30:23,800 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 12:30:23,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:30:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 12:30:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-04 12:30:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 12:30:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-04 12:30:23,806 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 19 [2018-02-04 12:30:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:23,806 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-04 12:30:23,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:30:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-04 12:30:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:30:23,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:23,807 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:23,811 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash -858054687, now seen corresponding path program 1 times [2018-02-04 12:30:23,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:23,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:23,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:23,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:23,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:23,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:23,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:23,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:30:23,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:30:23,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:30:23,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:30:23,977 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 6 states. [2018-02-04 12:30:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:24,167 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-02-04 12:30:24,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:30:24,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 12:30:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:24,168 INFO L225 Difference]: With dead ends: 95 [2018-02-04 12:30:24,169 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 12:30:24,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:30:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 12:30:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-02-04 12:30:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 12:30:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-04 12:30:24,172 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 27 [2018-02-04 12:30:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:24,173 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-04 12:30:24,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:30:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-04 12:30:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:30:24,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:24,174 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:24,174 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1338134626, now seen corresponding path program 1 times [2018-02-04 12:30:24,174 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:24,174 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:24,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:24,175 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:24,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:24,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:24,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:24,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:30:24,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:30:24,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:30:24,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:30:24,232 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 7 states. [2018-02-04 12:30:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:24,419 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-02-04 12:30:24,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:30:24,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 12:30:24,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:24,421 INFO L225 Difference]: With dead ends: 101 [2018-02-04 12:30:24,421 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 12:30:24,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:30:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 12:30:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2018-02-04 12:30:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 12:30:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-02-04 12:30:24,425 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 30 [2018-02-04 12:30:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:24,426 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-02-04 12:30:24,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:30:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-02-04 12:30:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:30:24,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:24,429 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:24,429 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:24,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1338134627, now seen corresponding path program 1 times [2018-02-04 12:30:24,430 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:24,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:24,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:24,431 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:24,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:24,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:24,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:24,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:30:24,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:30:24,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:30:24,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:30:24,562 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 9 states. [2018-02-04 12:30:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:24,718 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-02-04 12:30:24,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:30:24,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-04 12:30:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:24,718 INFO L225 Difference]: With dead ends: 104 [2018-02-04 12:30:24,719 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 12:30:24,719 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:30:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 12:30:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2018-02-04 12:30:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 12:30:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-02-04 12:30:24,721 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 30 [2018-02-04 12:30:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:24,728 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-02-04 12:30:24,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:30:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-02-04 12:30:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:30:24,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:24,729 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:24,729 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1019097774, now seen corresponding path program 1 times [2018-02-04 12:30:24,729 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:24,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:24,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:24,729 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:24,730 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:24,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:24,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:30:24,827 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:30:24,833 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:24,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:24,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:30:24,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:30:24,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:30:24,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:24,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:30:24,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:24,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:30:24,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 12:30:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:25,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:30:25,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-04 12:30:25,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:30:25,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:30:25,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:30:25,035 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 13 states. [2018-02-04 12:30:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:25,206 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-02-04 12:30:25,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:30:25,206 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-04 12:30:25,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:25,207 INFO L225 Difference]: With dead ends: 83 [2018-02-04 12:30:25,207 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 12:30:25,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:30:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 12:30:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2018-02-04 12:30:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 12:30:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-02-04 12:30:25,210 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 32 [2018-02-04 12:30:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:25,210 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-02-04 12:30:25,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:30:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-02-04 12:30:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:30:25,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:25,211 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:25,211 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:25,211 INFO L82 PathProgramCache]: Analyzing trace with hash -952870546, now seen corresponding path program 1 times [2018-02-04 12:30:25,211 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:25,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:25,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:25,212 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:25,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:25,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:25,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:25,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:30:25,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:30:25,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:30:25,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:30:25,261 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 5 states. [2018-02-04 12:30:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:25,318 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-02-04 12:30:25,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:30:25,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-04 12:30:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:25,319 INFO L225 Difference]: With dead ends: 86 [2018-02-04 12:30:25,319 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 12:30:25,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:30:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 12:30:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-02-04 12:30:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 12:30:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-02-04 12:30:25,322 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 33 [2018-02-04 12:30:25,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:25,322 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-02-04 12:30:25,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:30:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-02-04 12:30:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:30:25,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:25,327 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:25,327 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:25,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1517792313, now seen corresponding path program 1 times [2018-02-04 12:30:25,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:25,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:25,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:25,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:25,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:25,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:25,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:25,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:30:25,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:30:25,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:30:25,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:30:25,399 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 8 states. [2018-02-04 12:30:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:25,524 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-02-04 12:30:25,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:30:25,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 12:30:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:25,525 INFO L225 Difference]: With dead ends: 85 [2018-02-04 12:30:25,525 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 12:30:25,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:30:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 12:30:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-02-04 12:30:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 12:30:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-02-04 12:30:25,528 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 33 [2018-02-04 12:30:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:25,528 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-02-04 12:30:25,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:30:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-02-04 12:30:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:30:25,529 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:25,529 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:25,529 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1517792312, now seen corresponding path program 1 times [2018-02-04 12:30:25,530 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:25,530 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:25,530 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:25,531 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:25,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:25,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:25,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:25,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:30:25,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:30:25,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:30:25,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:30:25,562 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 5 states. [2018-02-04 12:30:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:25,632 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-02-04 12:30:25,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:30:25,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-04 12:30:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:25,633 INFO L225 Difference]: With dead ends: 81 [2018-02-04 12:30:25,633 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 12:30:25,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:30:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 12:30:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 12:30:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 12:30:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-02-04 12:30:25,635 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 33 [2018-02-04 12:30:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:25,635 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-02-04 12:30:25,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:30:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-02-04 12:30:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 12:30:25,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:25,636 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:25,636 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash -881792853, now seen corresponding path program 1 times [2018-02-04 12:30:25,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:25,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:25,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:25,637 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:25,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:25,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:25,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:25,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:30:25,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:30:25,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:30:25,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:30:25,689 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 8 states. [2018-02-04 12:30:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:25,820 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-02-04 12:30:25,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:30:25,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-04 12:30:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:25,821 INFO L225 Difference]: With dead ends: 78 [2018-02-04 12:30:25,822 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 12:30:25,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:30:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 12:30:25,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 12:30:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 12:30:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-02-04 12:30:25,824 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 35 [2018-02-04 12:30:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:25,825 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-02-04 12:30:25,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:30:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-02-04 12:30:25,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 12:30:25,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:25,826 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:25,826 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:25,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1690468264, now seen corresponding path program 1 times [2018-02-04 12:30:25,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:25,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:25,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:25,855 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:25,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:25,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:25,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:25,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 12:30:25,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:30:25,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:30:25,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:30:25,979 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 12 states. [2018-02-04 12:30:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:26,127 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-02-04 12:30:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:30:26,128 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-04 12:30:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:26,129 INFO L225 Difference]: With dead ends: 77 [2018-02-04 12:30:26,129 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 12:30:26,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:30:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 12:30:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 12:30:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 12:30:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-02-04 12:30:26,132 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 35 [2018-02-04 12:30:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:26,133 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-02-04 12:30:26,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:30:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-02-04 12:30:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:30:26,133 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:26,134 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:26,134 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:26,134 INFO L82 PathProgramCache]: Analyzing trace with hash 403683132, now seen corresponding path program 1 times [2018-02-04 12:30:26,134 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:26,134 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:26,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:26,135 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:26,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:26,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:26,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:30:26,270 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:30:26,277 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:26,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:26,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:30:26,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:30:26,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:26,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:26,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:26,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 12:30:26,361 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 15 [2018-02-04 12:30:26,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:26,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:26,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-02-04 12:30:26,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-02-04 12:30:26,464 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 26 treesize of output 25 [2018-02-04 12:30:26,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:26,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:26,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:30:26,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-04 12:30:26,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-02-04 12:30:26,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-02-04 12:30:26,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:26,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:26,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:30:26,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-02-04 12:30:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:26,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:30:26,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2018-02-04 12:30:26,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 12:30:26,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 12:30:26,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:30:26,579 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 21 states. [2018-02-04 12:30:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:27,183 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-02-04 12:30:27,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:30:27,183 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-02-04 12:30:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:27,184 INFO L225 Difference]: With dead ends: 78 [2018-02-04 12:30:27,184 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 12:30:27,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2018-02-04 12:30:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 12:30:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-02-04 12:30:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 12:30:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-02-04 12:30:27,186 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 38 [2018-02-04 12:30:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:27,186 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-02-04 12:30:27,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 12:30:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-02-04 12:30:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:30:27,187 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:27,187 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:27,187 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:27,187 INFO L82 PathProgramCache]: Analyzing trace with hash 403683133, now seen corresponding path program 1 times [2018-02-04 12:30:27,187 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:27,187 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:27,188 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:27,188 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:27,188 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:27,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:27,334 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:30:27,334 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:30:27,339 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:27,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:27,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:30:27,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:30:27,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:30:27,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:30:27,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-02-04 12:30:27,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:30:27,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:30:27,473 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 15 treesize of output 8 [2018-02-04 12:30:27,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 12:30:27,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-02-04 12:30:27,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-02-04 12:30:27,584 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 34 treesize of output 33 [2018-02-04 12:30:27,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-02-04 12:30:27,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-04 12:30:27,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:30:27,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-02-04 12:30:27,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-02-04 12:30:27,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-02-04 12:30:27,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-02-04 12:30:27,731 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 22 treesize of output 15 [2018-02-04 12:30:27,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,739 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 8 [2018-02-04 12:30:27,740 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-02-04 12:30:27,748 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:27,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:30:27,759 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-02-04 12:30:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:27,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:30:27,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21 [2018-02-04 12:30:27,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 12:30:27,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 12:30:27,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:30:27,807 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 22 states. [2018-02-04 12:30:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:28,358 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-02-04 12:30:28,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:30:28,358 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-02-04 12:30:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:28,358 INFO L225 Difference]: With dead ends: 77 [2018-02-04 12:30:28,358 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 12:30:28,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:30:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 12:30:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-04 12:30:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 12:30:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-02-04 12:30:28,360 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 38 [2018-02-04 12:30:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:28,360 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-02-04 12:30:28,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 12:30:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-02-04 12:30:28,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 12:30:28,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:28,361 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:28,361 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:28,361 INFO L82 PathProgramCache]: Analyzing trace with hash 467955640, now seen corresponding path program 1 times [2018-02-04 12:30:28,361 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:28,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:28,361 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:28,361 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:28,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:28,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:30:28,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:28,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 12:30:28,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 12:30:28,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 12:30:28,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:30:28,766 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 19 states. [2018-02-04 12:30:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:29,275 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-02-04 12:30:29,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:30:29,275 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-02-04 12:30:29,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:29,276 INFO L225 Difference]: With dead ends: 94 [2018-02-04 12:30:29,276 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 12:30:29,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:30:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 12:30:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-02-04 12:30:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 12:30:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-02-04 12:30:29,278 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 40 [2018-02-04 12:30:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:29,278 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-02-04 12:30:29,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 12:30:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-02-04 12:30:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 12:30:29,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:29,279 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:29,279 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 12:30:29,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1267428235, now seen corresponding path program 1 times [2018-02-04 12:30:29,279 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:29,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:29,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:29,280 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:29,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 12:30:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 12:30:29,317 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 12:30:29,330 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 12:30:29,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:30:29 BoogieIcfgContainer [2018-02-04 12:30:29,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:30:29,344 INFO L168 Benchmark]: Toolchain (without parser) took 8253.86 ms. Allocated memory was 398.5 MB in the beginning and 764.4 MB in the end (delta: 366.0 MB). Free memory was 355.3 MB in the beginning and 540.4 MB in the end (delta: -185.1 MB). Peak memory consumption was 180.9 MB. Max. memory is 5.3 GB. [2018-02-04 12:30:29,345 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:30:29,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.83 ms. Allocated memory is still 398.5 MB. Free memory was 355.3 MB in the beginning and 344.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:30:29,345 INFO L168 Benchmark]: Boogie Preprocessor took 39.47 ms. Allocated memory is still 398.5 MB. Free memory was 344.8 MB in the beginning and 343.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:30:29,346 INFO L168 Benchmark]: RCFGBuilder took 404.14 ms. Allocated memory is still 398.5 MB. Free memory was 343.4 MB in the beginning and 314.8 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:30:29,346 INFO L168 Benchmark]: TraceAbstraction took 7639.94 ms. Allocated memory was 398.5 MB in the beginning and 764.4 MB in the end (delta: 366.0 MB). Free memory was 314.8 MB in the beginning and 540.4 MB in the end (delta: -225.6 MB). Peak memory consumption was 140.4 MB. Max. memory is 5.3 GB. [2018-02-04 12:30:29,347 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.14 ms. Allocated memory is still 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.83 ms. Allocated memory is still 398.5 MB. Free memory was 355.3 MB in the beginning and 344.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.47 ms. Allocated memory is still 398.5 MB. Free memory was 344.8 MB in the beginning and 343.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 404.14 ms. Allocated memory is still 398.5 MB. Free memory was 343.4 MB in the beginning and 314.8 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7639.94 ms. Allocated memory was 398.5 MB in the beginning and 764.4 MB in the end (delta: 366.0 MB). Free memory was 314.8 MB in the beginning and 540.4 MB in the end (delta: -225.6 MB). Peak memory consumption was 140.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 633]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L635] FCALL struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] EXPR, FCALL malloc(sizeof *item) VAL [malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] EXPR, FCALL \read(**plist) VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] FCALL item->next = *plist VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628] EXPR, FCALL item->next VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L630] EXPR, FCALL malloc(sizeof *item) VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L631] RET, FCALL *plist = item VAL [item={11:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L637] append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) VAL [\read(*list)={11:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) VAL [\read(*list)={11:0}, list={10:0}] [L640] EXPR, FCALL list->next VAL [\read(*list)={11:0}, list={10:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={0:0}] [L641] FCALL free(list) VAL [\read(*list)={11:0}, list={10:0}, next={0:0}] [L642] FCALL list = next VAL [list={10:0}, next={0:0}] [L644] FCALL \read(*list) VAL [\read(*list)={0:0}, list={10:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; VAL [\result=0, list={10:0}, next={0:0}] [L635] FCALL struct item *list = ((void *)0); VAL [\result=0, list={10:0}, next={0:0}] [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 41 error locations. UNSAFE Result, 7.5s OverallTime, 20 OverallIterations, 2 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1043 SDtfs, 1114 SDslu, 3209 SDs, 0 SdLazy, 3422 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 102 SyntacticMatches, 17 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 71 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 641 NumberOfCodeBlocks, 641 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 577 ConstructedInterpolants, 13 QuantifiedInterpolants, 182044 SizeOfPredicates, 42 NumberOfNonLiveVariables, 529 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 18/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-30-29-352.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-30-29-352.csv Received shutdown request...