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/array-memsafety/lis_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 11:59:26,205 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 11:59:26,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 11:59:26,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 11:59:26,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 11:59:26,218 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 11:59:26,219 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 11:59:26,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 11:59:26,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 11:59:26,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 11:59:26,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 11:59:26,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 11:59:26,223 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 11:59:26,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 11:59:26,225 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 11:59:26,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 11:59:26,228 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 11:59:26,230 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 11:59:26,231 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 11:59:26,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 11:59:26,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 11:59:26,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 11:59:26,234 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 11:59:26,235 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 11:59:26,235 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 11:59:26,236 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 11:59:26,236 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 11:59:26,237 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 11:59:26,237 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 11:59:26,237 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 11:59:26,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 11:59:26,238 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 11:59:26,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 11:59:26,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 11:59:26,248 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 11:59:26,248 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 11:59:26,249 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 11:59:26,249 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 11:59:26,249 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 11:59:26,249 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 11:59:26,249 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 11:59:26,249 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 11:59:26,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 11:59:26,250 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 11:59:26,250 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 11:59:26,250 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 11:59:26,250 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 11:59:26,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 11:59:26,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 11:59:26,250 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 11:59:26,250 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 11:59:26,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 11:59:26,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 11:59:26,251 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 11:59:26,251 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 11:59:26,251 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 11:59:26,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 11:59:26,294 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 11:59:26,298 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 11:59:26,299 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 11:59:26,299 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 11:59:26,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i [2018-02-04 11:59:26,443 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 11:59:26,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 11:59:26,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 11:59:26,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 11:59:26,452 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 11:59:26,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 11:59:26" (1/1) ... [2018-02-04 11:59:26,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca8cb3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:26, skipping insertion in model container [2018-02-04 11:59:26,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 11:59:26" (1/1) ... [2018-02-04 11:59:26,472 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 11:59:26,506 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 11:59:26,595 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 11:59:26,611 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 11:59:26,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:26 WrapperNode [2018-02-04 11:59:26,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 11:59:26,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 11:59:26,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 11:59:26,619 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 11:59:26,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:26" (1/1) ... [2018-02-04 11:59:26,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:26" (1/1) ... [2018-02-04 11:59:26,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:26" (1/1) ... [2018-02-04 11:59:26,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:26" (1/1) ... [2018-02-04 11:59:26,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:26" (1/1) ... [2018-02-04 11:59:26,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:26" (1/1) ... [2018-02-04 11:59:26,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:26" (1/1) ... [2018-02-04 11:59:26,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 11:59:26,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 11:59:26,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 11:59:26,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 11:59:26,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:26" (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 11:59:26,692 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 11:59:26,692 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 11:59:26,692 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-02-04 11:59:26,692 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 11:59:26,692 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 11:59:26,693 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 11:59:26,693 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 11:59:26,693 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 11:59:26,693 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 11:59:26,693 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 11:59:26,693 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 11:59:26,693 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 11:59:26,694 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-02-04 11:59:26,694 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 11:59:26,694 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 11:59:26,694 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 11:59:26,929 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 11:59:26,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 11:59:26 BoogieIcfgContainer [2018-02-04 11:59:26,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 11:59:26,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 11:59:26,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 11:59:26,931 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 11:59:26,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 11:59:26" (1/3) ... [2018-02-04 11:59:26,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d59de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 11:59:26, skipping insertion in model container [2018-02-04 11:59:26,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 11:59:26" (2/3) ... [2018-02-04 11:59:26,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d59de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 11:59:26, skipping insertion in model container [2018-02-04 11:59:26,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 11:59:26" (3/3) ... [2018-02-04 11:59:26,933 INFO L107 eAbstractionObserver]: Analyzing ICFG lis_unsafe_false-valid-deref.i [2018-02-04 11:59:26,937 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 11:59:26,942 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-02-04 11:59:26,962 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 11:59:26,962 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 11:59:26,962 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 11:59:26,962 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 11:59:26,963 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 11:59:26,963 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 11:59:26,963 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 11:59:26,963 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 11:59:26,963 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 11:59:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-02-04 11:59:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 11:59:26,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:26,988 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:26,988 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 11:59:26,991 INFO L82 PathProgramCache]: Analyzing trace with hash -40654889, now seen corresponding path program 1 times [2018-02-04 11:59:26,992 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:26,992 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:27,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:27,022 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:27,022 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:27,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:27,144 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 11:59:27,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:27,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 11:59:27,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 11:59:27,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 11:59:27,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 11:59:27,212 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2018-02-04 11:59:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:27,303 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-02-04 11:59:27,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 11:59:27,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 11:59:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:27,311 INFO L225 Difference]: With dead ends: 73 [2018-02-04 11:59:27,312 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 11:59:27,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:59:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 11:59:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 11:59:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 11:59:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 11:59:27,340 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 15 [2018-02-04 11:59:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:27,340 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 11:59:27,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 11:59:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 11:59:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 11:59:27,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:27,341 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:27,341 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 11:59:27,341 INFO L82 PathProgramCache]: Analyzing trace with hash -40654888, now seen corresponding path program 1 times [2018-02-04 11:59:27,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:27,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:27,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:27,342 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:27,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:27,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:27,460 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 11:59:27,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:27,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 11:59:27,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 11:59:27,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 11:59:27,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 11:59:27,463 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 7 states. [2018-02-04 11:59:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:27,691 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-02-04 11:59:27,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 11:59:27,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-04 11:59:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:27,694 INFO L225 Difference]: With dead ends: 91 [2018-02-04 11:59:27,694 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 11:59:27,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 11:59:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 11:59:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-02-04 11:59:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 11:59:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-02-04 11:59:27,701 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2018-02-04 11:59:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:27,702 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-02-04 11:59:27,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 11:59:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-02-04 11:59:27,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 11:59:27,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:27,703 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:27,703 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 11:59:27,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1260301570, now seen corresponding path program 1 times [2018-02-04 11:59:27,703 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:27,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:27,704 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:27,705 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:27,705 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:27,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:27,742 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 11:59:27,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:27,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 11:59:27,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 11:59:27,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 11:59:27,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 11:59:27,743 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 4 states. [2018-02-04 11:59:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:27,794 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-02-04 11:59:27,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 11:59:27,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 11:59:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:27,796 INFO L225 Difference]: With dead ends: 75 [2018-02-04 11:59:27,796 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 11:59:27,796 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 11:59:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 11:59:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 11:59:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 11:59:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2018-02-04 11:59:27,801 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 16 [2018-02-04 11:59:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:27,801 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-02-04 11:59:27,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 11:59:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-02-04 11:59:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 11:59:27,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:27,802 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:27,802 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 11:59:27,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1260301569, now seen corresponding path program 1 times [2018-02-04 11:59:27,802 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:27,802 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:27,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:27,803 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:27,804 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:27,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:27,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:27,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 11:59:27,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 11:59:27,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 11:59:27,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 11:59:27,902 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 8 states. [2018-02-04 11:59:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:28,058 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2018-02-04 11:59:28,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 11:59:28,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-04 11:59:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:28,060 INFO L225 Difference]: With dead ends: 91 [2018-02-04 11:59:28,060 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 11:59:28,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-04 11:59:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 11:59:28,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2018-02-04 11:59:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 11:59:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-04 11:59:28,065 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2018-02-04 11:59:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:28,066 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-04 11:59:28,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 11:59:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-04 11:59:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 11:59:28,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:28,067 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] [2018-02-04 11:59:28,067 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 11:59:28,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1752664061, now seen corresponding path program 1 times [2018-02-04 11:59:28,067 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:28,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:28,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:28,068 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:28,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:28,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:28,106 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 11:59:28,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:28,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 11:59:28,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 11:59:28,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 11:59:28,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 11:59:28,107 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 5 states. [2018-02-04 11:59:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:28,176 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-02-04 11:59:28,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 11:59:28,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 11:59:28,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:28,178 INFO L225 Difference]: With dead ends: 88 [2018-02-04 11:59:28,178 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 11:59:28,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 11:59:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 11:59:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-02-04 11:59:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 11:59:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-02-04 11:59:28,182 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 20 [2018-02-04 11:59:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:28,182 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-02-04 11:59:28,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 11:59:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-02-04 11:59:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 11:59:28,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:28,182 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:28,182 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 11:59:28,183 INFO L82 PathProgramCache]: Analyzing trace with hash -304076685, now seen corresponding path program 1 times [2018-02-04 11:59:28,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:28,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:28,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:28,183 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:28,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:28,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:28,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 11:59:28,297 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 11:59:28,303 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:28,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 11:59:28,365 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 11:59:28,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 11:59:28,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 11:59:28,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 11:59:28,385 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 11:59:28,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 11:59:28,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 11:59:28,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-02-04 11:59:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:28,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 11:59:28,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-02-04 11:59:28,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 11:59:28,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 11:59:28,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 11:59:28,477 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 11 states. [2018-02-04 11:59:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:28,785 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-02-04 11:59:28,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 11:59:28,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-02-04 11:59:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:28,786 INFO L225 Difference]: With dead ends: 83 [2018-02-04 11:59:28,786 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 11:59:28,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-02-04 11:59:28,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 11:59:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2018-02-04 11:59:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 11:59:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-02-04 11:59:28,790 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 20 [2018-02-04 11:59:28,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:28,790 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-02-04 11:59:28,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 11:59:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-02-04 11:59:28,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 11:59:28,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:28,791 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] [2018-02-04 11:59:28,791 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 11:59:28,791 INFO L82 PathProgramCache]: Analyzing trace with hash -692554244, now seen corresponding path program 1 times [2018-02-04 11:59:28,791 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:28,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:28,792 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:28,792 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:28,793 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:28,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:28,869 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 11:59:28,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:28,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 11:59:28,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 11:59:28,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 11:59:28,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 11:59:28,871 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 7 states. [2018-02-04 11:59:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:28,951 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-02-04 11:59:28,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 11:59:28,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 11:59:28,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:28,952 INFO L225 Difference]: With dead ends: 66 [2018-02-04 11:59:28,952 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 11:59:28,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-02-04 11:59:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 11:59:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 11:59:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 11:59:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-04 11:59:28,955 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 22 [2018-02-04 11:59:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:28,956 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-04 11:59:28,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 11:59:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-04 11:59:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 11:59:28,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:28,956 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] [2018-02-04 11:59:28,957 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 11:59:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1804279880, now seen corresponding path program 1 times [2018-02-04 11:59:28,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:28,957 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:28,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:28,957 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:28,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:28,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:28,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 11:59:28,995 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 11:59:29,000 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:29,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 11:59:29,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 11:59:29,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 11:59:29,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 11:59:29,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 11:59:29,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 11:59:29,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 11:59:29,044 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 8 states. [2018-02-04 11:59:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:29,132 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2018-02-04 11:59:29,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 11:59:29,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-04 11:59:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:29,134 INFO L225 Difference]: With dead ends: 141 [2018-02-04 11:59:29,134 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 11:59:29,134 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 11:59:29,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 11:59:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2018-02-04 11:59:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 11:59:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-02-04 11:59:29,142 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 25 [2018-02-04 11:59:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:29,143 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-02-04 11:59:29,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 11:59:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-02-04 11:59:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 11:59:29,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:29,144 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 11:59:29,144 INFO L371 AbstractCegarLoop]: === Iteration 9 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 11:59:29,145 INFO L82 PathProgramCache]: Analyzing trace with hash -186387055, now seen corresponding path program 1 times [2018-02-04 11:59:29,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:29,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:29,145 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:29,146 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:29,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 11:59:29,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 11:59:29,369 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 11:59:29,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 11:59:29,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 11:59:29,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 11:59:29,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 11:59:29,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 11:59:29,371 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 8 states. [2018-02-04 11:59:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 11:59:29,580 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-02-04 11:59:29,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 11:59:29,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-04 11:59:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 11:59:29,581 INFO L225 Difference]: With dead ends: 83 [2018-02-04 11:59:29,581 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 11:59:29,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 11:59:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 11:59:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-02-04 11:59:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 11:59:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-04 11:59:29,583 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 27 [2018-02-04 11:59:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 11:59:29,583 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-04 11:59:29,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 11:59:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-04 11:59:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 11:59:29,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 11:59:29,583 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 11:59:29,583 INFO L371 AbstractCegarLoop]: === Iteration 10 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 11:59:29,584 INFO L82 PathProgramCache]: Analyzing trace with hash -324019421, now seen corresponding path program 2 times [2018-02-04 11:59:29,584 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 11:59:29,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 11:59:29,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:29,584 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 11:59:29,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 11:59:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 11:59:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 11:59:29,623 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 11:59:29,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 11:59:29 BoogieIcfgContainer [2018-02-04 11:59:29,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 11:59:29,663 INFO L168 Benchmark]: Toolchain (without parser) took 3219.91 ms. Allocated memory was 403.7 MB in the beginning and 682.1 MB in the end (delta: 278.4 MB). Free memory was 360.2 MB in the beginning and 583.8 MB in the end (delta: -223.6 MB). Peak memory consumption was 54.8 MB. Max. memory is 5.3 GB. [2018-02-04 11:59:29,665 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 403.7 MB. Free memory is still 366.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 11:59:29,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.05 ms. Allocated memory is still 403.7 MB. Free memory was 360.2 MB in the beginning and 349.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 11:59:29,665 INFO L168 Benchmark]: Boogie Preprocessor took 31.02 ms. Allocated memory is still 403.7 MB. Free memory was 349.6 MB in the beginning and 348.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 11:59:29,665 INFO L168 Benchmark]: RCFGBuilder took 279.18 ms. Allocated memory is still 403.7 MB. Free memory was 348.3 MB in the beginning and 321.8 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-02-04 11:59:29,666 INFO L168 Benchmark]: TraceAbstraction took 2733.44 ms. Allocated memory was 403.7 MB in the beginning and 682.1 MB in the end (delta: 278.4 MB). Free memory was 321.8 MB in the beginning and 583.8 MB in the end (delta: -262.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 5.3 GB. [2018-02-04 11:59:29,667 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 403.7 MB. Free memory is still 366.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.05 ms. Allocated memory is still 403.7 MB. Free memory was 360.2 MB in the beginning and 349.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.02 ms. Allocated memory is still 403.7 MB. Free memory was 349.6 MB in the beginning and 348.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 279.18 ms. Allocated memory is still 403.7 MB. Free memory was 348.3 MB in the beginning and 321.8 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2733.44 ms. Allocated memory was 403.7 MB in the beginning and 682.1 MB in the end (delta: 278.4 MB). Free memory was 321.8 MB in the beginning and 583.8 MB in the end (delta: -262.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) VAL [\old(N)=2, a={10:-5}] [L542] int *best, *prev, i, j, max = 0; VAL [\old(N)=2, a={10:-5}, a={10:-5}, max=0, N=2] [L543] EXPR, FCALL malloc(sizeof(int) * N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, malloc(sizeof(int) * N)={12:0}, max=0, N=2] [L543] best = (int*) malloc(sizeof(int) * N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2] [L544] EXPR, FCALL malloc(sizeof(int) * N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2] [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L545] COND TRUE i < N VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L546] FCALL best[i] = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L546] FCALL prev[i] = i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L545] i++ VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L545] COND TRUE i < N VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L546] FCALL best[i] = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L546] FCALL prev[i] = i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L545] i++ VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=2, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L545] COND FALSE !(i < N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=2, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L547] i = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L547] COND TRUE i < N [L548] j = 0 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, j=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L548] COND TRUE j < i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, j=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L549] FCALL a[i] VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, j=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 81 locations, 27 error locations. UNSAFE Result, 2.7s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 428 SDtfs, 1399 SDslu, 717 SDs, 0 SdLazy, 779 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=8, 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, 9 MinimizatonAttempts, 118 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 210 ConstructedInterpolants, 1 QuantifiedInterpolants, 31196 SizeOfPredicates, 8 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 4/10 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/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_11-59-29-673.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_11-59-29-673.csv Received shutdown request...