java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:10:41,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:10:41,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:10:41,132 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:10:41,133 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:10:41,134 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:10:41,135 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:10:41,136 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:10:41,138 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:10:41,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:10:41,140 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:10:41,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:10:41,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:10:41,142 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:10:41,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:10:41,144 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:10:41,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:10:41,148 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:10:41,149 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:10:41,150 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:10:41,152 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:10:41,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:10:41,153 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:10:41,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:10:41,154 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:10:41,155 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:10:41,156 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:10:41,156 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:10:41,156 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:10:41,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:10:41,157 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:10:41,157 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:10:41,169 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:10:41,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:10:41,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:10:41,171 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:10:41,171 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:10:41,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:10:41,171 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:10:41,171 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:10:41,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:10:41,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:10:41,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:10:41,172 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:10:41,172 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:10:41,172 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:10:41,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:10:41,172 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:10:41,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:10:41,173 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:10:41,173 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:10:41,173 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:10:41,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:10:41,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:10:41,173 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:10:41,174 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:10:41,174 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:10:41,206 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:10:41,215 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:10:41,218 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:10:41,220 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:10:41,220 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:10:41,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i [2018-02-04 04:10:41,374 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:10:41,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:10:41,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:10:41,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:10:41,383 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:10:41,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:10:41" (1/1) ... [2018-02-04 04:10:41,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c420ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:41, skipping insertion in model container [2018-02-04 04:10:41,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:10:41" (1/1) ... [2018-02-04 04:10:41,401 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:10:41,430 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:10:41,531 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:10:41,547 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:10:41,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:41 WrapperNode [2018-02-04 04:10:41,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:10:41,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:10:41,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:10:41,556 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:10:41,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:41" (1/1) ... [2018-02-04 04:10:41,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:41" (1/1) ... [2018-02-04 04:10:41,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:41" (1/1) ... [2018-02-04 04:10:41,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:41" (1/1) ... [2018-02-04 04:10:41,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:41" (1/1) ... [2018-02-04 04:10:41,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:41" (1/1) ... [2018-02-04 04:10:41,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:41" (1/1) ... [2018-02-04 04:10:41,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:10:41,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:10:41,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:10:41,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:10:41,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:41" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:10:41,616 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:10:41,616 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:10:41,616 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-04 04:10:41,616 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:10:41,616 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:10:41,616 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:10:41,616 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:10:41,616 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:10:41,616 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:10:41,616 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:10:41,617 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:10:41,617 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 04:10:41,617 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:10:41,617 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:10:41,617 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:10:41,617 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-04 04:10:41,617 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:10:41,617 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:10:41,617 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:10:41,895 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:10:41,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:10:41 BoogieIcfgContainer [2018-02-04 04:10:41,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:10:41,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:10:41,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:10:41,899 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:10:41,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:10:41" (1/3) ... [2018-02-04 04:10:41,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b97242b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:10:41, skipping insertion in model container [2018-02-04 04:10:41,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:10:41" (2/3) ... [2018-02-04 04:10:41,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b97242b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:10:41, skipping insertion in model container [2018-02-04 04:10:41,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:10:41" (3/3) ... [2018-02-04 04:10:41,902 INFO L107 eAbstractionObserver]: Analyzing ICFG list-ext_false-unreach-call_false-valid-deref.i [2018-02-04 04:10:41,907 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:10:41,913 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-02-04 04:10:41,943 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:10:41,943 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:10:41,943 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:10:41,943 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:10:41,944 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:10:41,944 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:10:41,944 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:10:41,944 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:10:41,945 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:10:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-02-04 04:10:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 04:10:41,967 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:10:41,968 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:10:41,968 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 04:10:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2135487731, now seen corresponding path program 1 times [2018-02-04 04:10:41,973 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:10:41,973 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:10:42,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:42,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:10:42,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:10:42,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:10:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:10:42,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:10:42,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:10:42,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 04:10:42,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 04:10:42,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 04:10:42,094 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 2 states. [2018-02-04 04:10:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:10:42,185 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-02-04 04:10:42,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 04:10:42,186 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-04 04:10:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:10:42,192 INFO L225 Difference]: With dead ends: 99 [2018-02-04 04:10:42,192 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 04:10:42,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 04:10:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 04:10:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-02-04 04:10:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 04:10:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-02-04 04:10:42,219 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 13 [2018-02-04 04:10:42,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:10:42,219 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-02-04 04:10:42,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 04:10:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-02-04 04:10:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 04:10:42,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:10:42,220 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:10:42,220 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 04:10:42,220 INFO L82 PathProgramCache]: Analyzing trace with hash 757106509, now seen corresponding path program 1 times [2018-02-04 04:10:42,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:10:42,221 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:10:42,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:42,221 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:10:42,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:10:42,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:10:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:10:42,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:10:42,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:10:42,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:10:42,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:10:42,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:10:42,298 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 5 states. [2018-02-04 04:10:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:10:42,455 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-02-04 04:10:42,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:10:42,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 04:10:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:10:42,457 INFO L225 Difference]: With dead ends: 111 [2018-02-04 04:10:42,457 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 04:10:42,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:10:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 04:10:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2018-02-04 04:10:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 04:10:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-02-04 04:10:42,464 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-02-04 04:10:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:10:42,464 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-02-04 04:10:42,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:10:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-02-04 04:10:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 04:10:42,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:10:42,465 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:10:42,465 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 04:10:42,465 INFO L82 PathProgramCache]: Analyzing trace with hash 757106510, now seen corresponding path program 1 times [2018-02-04 04:10:42,465 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:10:42,465 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:10:42,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:42,466 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:10:42,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:10:42,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:10:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:10:42,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:10:42,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:10:42,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:10:42,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:10:42,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:10:42,544 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 5 states. [2018-02-04 04:10:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:10:42,678 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2018-02-04 04:10:42,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:10:42,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 04:10:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:10:42,679 INFO L225 Difference]: With dead ends: 130 [2018-02-04 04:10:42,680 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 04:10:42,680 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:10:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 04:10:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2018-02-04 04:10:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 04:10:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2018-02-04 04:10:42,689 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 15 [2018-02-04 04:10:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:10:42,690 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2018-02-04 04:10:42,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:10:42,690 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2018-02-04 04:10:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 04:10:42,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:10:42,691 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:10:42,691 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 04:10:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1442918817, now seen corresponding path program 1 times [2018-02-04 04:10:42,691 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:10:42,691 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:10:42,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:42,692 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:10:42,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:10:42,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:10:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:10:42,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:10:42,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:10:42,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:10:42,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:10:42,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:10:42,761 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand 7 states. [2018-02-04 04:10:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:10:43,082 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2018-02-04 04:10:43,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:10:43,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-04 04:10:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:10:43,084 INFO L225 Difference]: With dead ends: 226 [2018-02-04 04:10:43,084 INFO L226 Difference]: Without dead ends: 226 [2018-02-04 04:10:43,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:10:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-04 04:10:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 124. [2018-02-04 04:10:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 04:10:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2018-02-04 04:10:43,089 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 26 [2018-02-04 04:10:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:10:43,090 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2018-02-04 04:10:43,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:10:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2018-02-04 04:10:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 04:10:43,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:10:43,090 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:10:43,090 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 04:10:43,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1442918818, now seen corresponding path program 1 times [2018-02-04 04:10:43,091 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:10:43,091 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:10:43,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:43,092 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:10:43,092 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:10:43,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:10:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:10:43,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:10:43,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:10:43,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:10:43,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:10:43,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:10:43,178 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 7 states. [2018-02-04 04:10:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:10:43,509 INFO L93 Difference]: Finished difference Result 242 states and 271 transitions. [2018-02-04 04:10:43,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:10:43,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-04 04:10:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:10:43,511 INFO L225 Difference]: With dead ends: 242 [2018-02-04 04:10:43,511 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 04:10:43,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:10:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 04:10:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 105. [2018-02-04 04:10:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 04:10:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-02-04 04:10:43,519 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 26 [2018-02-04 04:10:43,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:10:43,521 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-02-04 04:10:43,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:10:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-02-04 04:10:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:10:43,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:10:43,522 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:10:43,522 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 04:10:43,522 INFO L82 PathProgramCache]: Analyzing trace with hash 317364595, now seen corresponding path program 1 times [2018-02-04 04:10:43,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:10:43,523 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:10:43,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:43,524 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:10:43,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:10:43,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:10:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:10:43,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:10:43,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:10:43,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:10:43,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:10:43,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:10:43,577 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2018-02-04 04:10:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:10:43,710 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2018-02-04 04:10:43,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:10:43,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 04:10:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:10:43,712 INFO L225 Difference]: With dead ends: 187 [2018-02-04 04:10:43,712 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 04:10:43,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:10:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 04:10:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 118. [2018-02-04 04:10:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 04:10:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2018-02-04 04:10:43,717 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 27 [2018-02-04 04:10:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:10:43,717 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2018-02-04 04:10:43,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:10:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2018-02-04 04:10:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 04:10:43,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:10:43,719 INFO L351 BasicCegarLoop]: trace histogram [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 04:10:43,719 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 04:10:43,719 INFO L82 PathProgramCache]: Analyzing trace with hash 135192649, now seen corresponding path program 1 times [2018-02-04 04:10:43,719 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:10:43,719 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:10:43,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:43,720 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:10:43,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:10:43,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:10:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:10:43,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:10:43,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:10:43,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:10:43,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:10:43,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:10:43,770 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand 7 states. [2018-02-04 04:10:43,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:10:43,904 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-02-04 04:10:43,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:10:43,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 04:10:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:10:43,905 INFO L225 Difference]: With dead ends: 157 [2018-02-04 04:10:43,905 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 04:10:43,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:10:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 04:10:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2018-02-04 04:10:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 04:10:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2018-02-04 04:10:43,910 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 30 [2018-02-04 04:10:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:10:43,910 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2018-02-04 04:10:43,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:10:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2018-02-04 04:10:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 04:10:43,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:10:43,911 INFO L351 BasicCegarLoop]: trace histogram [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 04:10:43,911 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 04:10:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash 135192650, now seen corresponding path program 1 times [2018-02-04 04:10:43,912 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:10:43,912 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:10:43,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:43,913 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:10:43,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:10:43,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:10:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:10:44,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:10:44,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:10:44,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:10:44,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:10:44,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:10:44,003 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand 7 states. [2018-02-04 04:10:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:10:44,222 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2018-02-04 04:10:44,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:10:44,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 04:10:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:10:44,223 INFO L225 Difference]: With dead ends: 171 [2018-02-04 04:10:44,223 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 04:10:44,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:10:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 04:10:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 101. [2018-02-04 04:10:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 04:10:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-02-04 04:10:44,226 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 30 [2018-02-04 04:10:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:10:44,226 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-02-04 04:10:44,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:10:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-02-04 04:10:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 04:10:44,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:10:44,227 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:10:44,231 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 04:10:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1848368372, now seen corresponding path program 1 times [2018-02-04 04:10:44,231 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:10:44,231 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:10:44,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:44,232 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:10:44,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:10:44,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:10:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:10:44,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:10:44,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:10:44,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:10:44,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:10:44,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:10:44,278 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-02-04 04:10:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:10:44,382 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2018-02-04 04:10:44,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:10:44,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 04:10:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:10:44,383 INFO L225 Difference]: With dead ends: 156 [2018-02-04 04:10:44,384 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 04:10:44,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:10:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 04:10:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 104. [2018-02-04 04:10:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 04:10:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2018-02-04 04:10:44,387 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 30 [2018-02-04 04:10:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:10:44,388 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2018-02-04 04:10:44,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:10:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-02-04 04:10:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 04:10:44,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:10:44,389 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 04:10:44,389 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 04:10:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash 772815435, now seen corresponding path program 1 times [2018-02-04 04:10:44,389 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:10:44,389 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:10:44,390 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:44,390 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:10:44,390 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:10:44,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:10:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:10:44,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:10:44,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:10:44,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:10:44,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:10:44,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:10:44,420 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 3 states. [2018-02-04 04:10:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:10:44,433 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2018-02-04 04:10:44,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:10:44,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-02-04 04:10:44,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:10:44,434 INFO L225 Difference]: With dead ends: 105 [2018-02-04 04:10:44,434 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 04:10:44,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 04:10:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 04:10:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-04 04:10:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 04:10:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-02-04 04:10:44,437 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 35 [2018-02-04 04:10:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:10:44,437 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-02-04 04:10:44,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:10:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-02-04 04:10:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 04:10:44,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:10:44,438 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:10:44,438 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 04:10:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1113019023, now seen corresponding path program 1 times [2018-02-04 04:10:44,439 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:10:44,439 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:10:44,439 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:44,439 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:10:44,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:10:44,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:10:44,464 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 04:10:44,467 INFO L168 Benchmark]: Toolchain (without parser) took 3092.06 ms. Allocated memory was 404.2 MB in the beginning and 676.9 MB in the end (delta: 272.6 MB). Free memory was 361.1 MB in the beginning and 571.1 MB in the end (delta: -210.0 MB). Peak memory consumption was 62.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:10:44,468 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 404.2 MB. Free memory is still 366.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:10:44,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.81 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:10:44,468 INFO L168 Benchmark]: Boogie Preprocessor took 27.32 ms. Allocated memory is still 404.2 MB. Free memory was 350.5 MB in the beginning and 347.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:10:44,469 INFO L168 Benchmark]: RCFGBuilder took 312.77 ms. Allocated memory is still 404.2 MB. Free memory was 347.9 MB in the beginning and 318.0 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:10:44,469 INFO L168 Benchmark]: TraceAbstraction took 2569.91 ms. Allocated memory was 404.2 MB in the beginning and 676.9 MB in the end (delta: 272.6 MB). Free memory was 318.0 MB in the beginning and 571.1 MB in the end (delta: -253.1 MB). Peak memory consumption was 19.5 MB. Max. memory is 5.3 GB. [2018-02-04 04:10:44,470 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.13 ms. Allocated memory is still 404.2 MB. Free memory is still 366.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 178.81 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.32 ms. Allocated memory is still 404.2 MB. Free memory was 350.5 MB in the beginning and 347.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 312.77 ms. Allocated memory is still 404.2 MB. Free memory was 347.9 MB in the beginning and 318.0 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2569.91 ms. Allocated memory was 404.2 MB in the beginning and 676.9 MB in the end (delta: 272.6 MB). Free memory was 318.0 MB in the beginning and 571.1 MB in the end (delta: -253.1 MB). Peak memory consumption was 19.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-10-44-476.csv Received shutdown request...