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/cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:47:52,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:47:52,354 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:47:52,363 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:47:52,363 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:47:52,364 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:47:52,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:47:52,366 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:47:52,367 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:47:52,368 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:47:52,368 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:47:52,368 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:47:52,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:47:52,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:47:52,370 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:47:52,371 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:47:52,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:47:52,373 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:47:52,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:47:52,375 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:47:52,376 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:47:52,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:47:52,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:47:52,377 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:47:52,378 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:47:52,379 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:47:52,379 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:47:52,380 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:47:52,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:47:52,380 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:47:52,380 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:47:52,380 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-03 22:47:52,390 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:47:52,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:47:52,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:47:52,392 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:47:52,392 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:47:52,392 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:47:52,392 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:47:52,392 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:47:52,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:47:52,393 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:47:52,393 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:47:52,393 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:47:52,393 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:47:52,393 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:47:52,393 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:47:52,393 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:47:52,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:47:52,394 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:47:52,394 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:47:52,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:47:52,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:47:52,394 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:47:52,394 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:47:52,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:47:52,394 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:47:52,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:47:52,429 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:47:52,432 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:47:52,433 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:47:52,433 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:47:52,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:47:52,548 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:47:52,549 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:47:52,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:47:52,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:47:52,555 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:47:52,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:47:52" (1/1) ... [2018-02-03 22:47:52,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4762d03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:52, skipping insertion in model container [2018-02-03 22:47:52,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:47:52" (1/1) ... [2018-02-03 22:47:52,569 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:47:52,596 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:47:52,691 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:47:52,707 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:47:52,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:52 WrapperNode [2018-02-03 22:47:52,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:47:52,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:47:52,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:47:52,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:47:52,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:52" (1/1) ... [2018-02-03 22:47:52,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:52" (1/1) ... [2018-02-03 22:47:52,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:52" (1/1) ... [2018-02-03 22:47:52,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:52" (1/1) ... [2018-02-03 22:47:52,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:52" (1/1) ... [2018-02-03 22:47:52,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:52" (1/1) ... [2018-02-03 22:47:52,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:52" (1/1) ... [2018-02-03 22:47:52,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:47:52,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:47:52,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:47:52,743 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:47:52,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:52" (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-03 22:47:52,784 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:47:52,784 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:47:52,784 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-02-03 22:47:52,785 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:47:52,785 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:47:52,785 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:47:52,785 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:47:52,785 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:47:52,785 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:47:52,785 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:47:52,785 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-02-03 22:47:52,785 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:47:52,785 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:47:52,785 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:47:52,931 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:47:52,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:47:52 BoogieIcfgContainer [2018-02-03 22:47:52,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:47:52,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:47:52,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:47:52,934 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:47:52,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:47:52" (1/3) ... [2018-02-03 22:47:52,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0e9408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:47:52, skipping insertion in model container [2018-02-03 22:47:52,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:52" (2/3) ... [2018-02-03 22:47:52,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0e9408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:47:52, skipping insertion in model container [2018-02-03 22:47:52,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:47:52" (3/3) ... [2018-02-03 22:47:52,936 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:47:52,941 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:47:52,946 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-03 22:47:52,976 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:47:52,977 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:47:52,977 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:47:52,977 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:47:52,977 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:47:52,977 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:47:52,977 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:47:52,977 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:47:52,978 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:47:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-03 22:47:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:47:52,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:53,000 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:53,000 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:53,004 INFO L82 PathProgramCache]: Analyzing trace with hash 118579097, now seen corresponding path program 1 times [2018-02-03 22:47:53,006 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:53,006 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:53,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:53,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:53,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:53,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:53,180 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-03 22:47:53,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:53,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:47:53,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:47:53,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:47:53,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:47:53,195 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-02-03 22:47:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:53,280 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-02-03 22:47:53,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:47:53,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-03 22:47:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:53,336 INFO L225 Difference]: With dead ends: 45 [2018-02-03 22:47:53,336 INFO L226 Difference]: Without dead ends: 42 [2018-02-03 22:47:53,338 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-03 22:47:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-03 22:47:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-03 22:47:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-03 22:47:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-03 22:47:53,361 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-02-03 22:47:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:53,361 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-03 22:47:53,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:47:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-03 22:47:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:47:53,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:53,361 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:53,361 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:53,362 INFO L82 PathProgramCache]: Analyzing trace with hash 118579098, now seen corresponding path program 1 times [2018-02-03 22:47:53,362 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:53,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:53,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:53,363 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:53,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:53,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:53,453 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-03 22:47:53,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:53,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:47:53,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:47:53,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:47:53,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:47:53,455 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-02-03 22:47:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:53,505 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-02-03 22:47:53,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:47:53,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-03 22:47:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:53,506 INFO L225 Difference]: With dead ends: 41 [2018-02-03 22:47:53,507 INFO L226 Difference]: Without dead ends: 41 [2018-02-03 22:47:53,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-03 22:47:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-03 22:47:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-03 22:47:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-03 22:47:53,512 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 13 [2018-02-03 22:47:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:53,512 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-03 22:47:53,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:47:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-03 22:47:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:47:53,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:53,512 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:53,513 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:53,513 INFO L82 PathProgramCache]: Analyzing trace with hash -539609344, now seen corresponding path program 1 times [2018-02-03 22:47:53,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:53,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:53,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:53,514 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:53,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:53,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:53,573 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-03 22:47:53,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:53,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:47:53,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:47:53,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:47:53,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:53,575 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2018-02-03 22:47:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:53,637 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-02-03 22:47:53,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:47:53,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-03 22:47:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:53,639 INFO L225 Difference]: With dead ends: 40 [2018-02-03 22:47:53,639 INFO L226 Difference]: Without dead ends: 40 [2018-02-03 22:47:53,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:47:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-03 22:47:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-03 22:47:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-03 22:47:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-02-03 22:47:53,643 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2018-02-03 22:47:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:53,643 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-02-03 22:47:53,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:47:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-02-03 22:47:53,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:47:53,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:53,644 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:53,644 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:53,644 INFO L82 PathProgramCache]: Analyzing trace with hash -539609343, now seen corresponding path program 1 times [2018-02-03 22:47:53,644 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:53,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:53,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:53,645 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:53,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:53,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:53,752 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-03 22:47:53,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:53,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:47:53,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:47:53,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:47:53,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:47:53,753 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 9 states. [2018-02-03 22:47:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:53,868 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-02-03 22:47:53,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:47:53,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-03 22:47:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:53,872 INFO L225 Difference]: With dead ends: 50 [2018-02-03 22:47:53,872 INFO L226 Difference]: Without dead ends: 50 [2018-02-03 22:47:53,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:47:53,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-03 22:47:53,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-02-03 22:47:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-03 22:47:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-03 22:47:53,877 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2018-02-03 22:47:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:53,877 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-03 22:47:53,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:47:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-03 22:47:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 22:47:53,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:53,878 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:53,878 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:53,878 INFO L82 PathProgramCache]: Analyzing trace with hash 451979505, now seen corresponding path program 1 times [2018-02-03 22:47:53,878 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:53,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:53,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:53,879 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:53,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:53,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:53,981 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-03 22:47:53,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:53,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:47:53,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:47:53,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:47:53,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:47:53,982 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 9 states. [2018-02-03 22:47:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:54,128 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-02-03 22:47:54,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:47:54,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-03 22:47:54,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:54,130 INFO L225 Difference]: With dead ends: 49 [2018-02-03 22:47:54,130 INFO L226 Difference]: Without dead ends: 49 [2018-02-03 22:47:54,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:47:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-03 22:47:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2018-02-03 22:47:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-03 22:47:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-02-03 22:47:54,134 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 19 [2018-02-03 22:47:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:54,134 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-02-03 22:47:54,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:47:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-02-03 22:47:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 22:47:54,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:54,135 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:54,135 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:54,135 INFO L82 PathProgramCache]: Analyzing trace with hash 451979504, now seen corresponding path program 1 times [2018-02-03 22:47:54,135 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:54,136 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:54,136 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:54,137 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:54,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:54,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:54,206 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-03 22:47:54,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:54,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:47:54,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:47:54,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:47:54,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:47:54,207 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 9 states. [2018-02-03 22:47:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:54,323 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-02-03 22:47:54,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:47:54,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-03 22:47:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:54,323 INFO L225 Difference]: With dead ends: 43 [2018-02-03 22:47:54,323 INFO L226 Difference]: Without dead ends: 43 [2018-02-03 22:47:54,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:47:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-03 22:47:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-03 22:47:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-03 22:47:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-03 22:47:54,327 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-02-03 22:47:54,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:54,327 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-03 22:47:54,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:47:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-03 22:47:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:47:54,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:54,328 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:54,328 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:54,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1872127023, now seen corresponding path program 1 times [2018-02-03 22:47:54,329 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:54,329 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:54,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:54,329 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:54,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:54,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:54,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:54,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:47:54,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:47:54,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:47:54,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:54,377 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 6 states. [2018-02-03 22:47:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:54,407 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-03 22:47:54,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:47:54,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-03 22:47:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:54,408 INFO L225 Difference]: With dead ends: 77 [2018-02-03 22:47:54,408 INFO L226 Difference]: Without dead ends: 77 [2018-02-03 22:47:54,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:47:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-03 22:47:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-02-03 22:47:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-03 22:47:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-02-03 22:47:54,412 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 23 [2018-02-03 22:47:54,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:54,413 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-02-03 22:47:54,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:47:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-02-03 22:47:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:47:54,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:54,414 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:54,414 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:54,414 INFO L82 PathProgramCache]: Analyzing trace with hash 851058669, now seen corresponding path program 1 times [2018-02-03 22:47:54,414 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:54,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:54,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:54,415 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:54,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:54,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:54,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:54,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 22:47:54,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 22:47:54,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 22:47:54,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:47:54,533 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 10 states. [2018-02-03 22:47:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:54,648 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-02-03 22:47:54,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 22:47:54,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-03 22:47:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:54,649 INFO L225 Difference]: With dead ends: 121 [2018-02-03 22:47:54,649 INFO L226 Difference]: Without dead ends: 121 [2018-02-03 22:47:54,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-03 22:47:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-03 22:47:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2018-02-03 22:47:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-03 22:47:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-02-03 22:47:54,657 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 23 [2018-02-03 22:47:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:54,657 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-02-03 22:47:54,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 22:47:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-02-03 22:47:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:47:54,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:54,658 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:54,658 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:54,658 INFO L82 PathProgramCache]: Analyzing trace with hash -737289233, now seen corresponding path program 1 times [2018-02-03 22:47:54,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:54,659 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:54,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:54,659 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:54,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:54,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:54,843 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:54,843 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-03 22:47:54,849 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:54,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:54,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:47:54,934 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 11 treesize of output 10 [2018-02-03 22:47:54,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:54,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:54,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:47:54,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:47:55,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-03 22:47:55,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:47:55,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:55,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:55,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:55,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-03 22:47:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:55,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:55,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-02-03 22:47:55,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-03 22:47:55,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-03 22:47:55,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-03 22:47:55,150 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 17 states. [2018-02-03 22:47:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:56,448 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2018-02-03 22:47:56,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 22:47:56,448 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-02-03 22:47:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:56,450 INFO L225 Difference]: With dead ends: 115 [2018-02-03 22:47:56,450 INFO L226 Difference]: Without dead ends: 115 [2018-02-03 22:47:56,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-02-03 22:47:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-03 22:47:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2018-02-03 22:47:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-03 22:47:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2018-02-03 22:47:56,457 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 23 [2018-02-03 22:47:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:56,457 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2018-02-03 22:47:56,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-03 22:47:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2018-02-03 22:47:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:47:56,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:56,458 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] [2018-02-03 22:47:56,459 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:56,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2111493848, now seen corresponding path program 1 times [2018-02-03 22:47:56,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:56,459 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:56,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:56,460 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:56,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:56,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:56,499 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-03 22:47:56,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:56,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:47:56,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:47:56,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:47:56,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:56,501 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand 6 states. [2018-02-03 22:47:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:56,564 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-02-03 22:47:56,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:47:56,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-03 22:47:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:56,566 INFO L225 Difference]: With dead ends: 104 [2018-02-03 22:47:56,566 INFO L226 Difference]: Without dead ends: 104 [2018-02-03 22:47:56,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:47:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-03 22:47:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-02-03 22:47:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-03 22:47:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2018-02-03 22:47:56,571 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 24 [2018-02-03 22:47:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:56,571 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-02-03 22:47:56,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:47:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2018-02-03 22:47:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:47:56,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:56,572 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] [2018-02-03 22:47:56,572 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:56,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2111493847, now seen corresponding path program 1 times [2018-02-03 22:47:56,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:56,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:56,573 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:56,574 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:56,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:56,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:56,647 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-03 22:47:56,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:56,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:47:56,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:47:56,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:47:56,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:47:56,648 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 8 states. [2018-02-03 22:47:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:56,728 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-02-03 22:47:56,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:47:56,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-02-03 22:47:56,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:56,729 INFO L225 Difference]: With dead ends: 112 [2018-02-03 22:47:56,729 INFO L226 Difference]: Without dead ends: 112 [2018-02-03 22:47:56,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:47:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-03 22:47:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2018-02-03 22:47:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-03 22:47:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-02-03 22:47:56,734 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2018-02-03 22:47:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:56,734 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-02-03 22:47:56,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:47:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-02-03 22:47:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:47:56,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:56,735 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] [2018-02-03 22:47:56,735 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:56,735 INFO L82 PathProgramCache]: Analyzing trace with hash 595125547, now seen corresponding path program 1 times [2018-02-03 22:47:56,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:56,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:56,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:56,736 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:56,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:56,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:56,921 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-03 22:47:56,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:56,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-03 22:47:56,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-03 22:47:56,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-03 22:47:56,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-03 22:47:56,922 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 14 states. [2018-02-03 22:47:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:57,201 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-02-03 22:47:57,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 22:47:57,201 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-02-03 22:47:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:57,202 INFO L225 Difference]: With dead ends: 121 [2018-02-03 22:47:57,202 INFO L226 Difference]: Without dead ends: 121 [2018-02-03 22:47:57,202 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-03 22:47:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-03 22:47:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-02-03 22:47:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-03 22:47:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-03 22:47:57,207 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 24 [2018-02-03 22:47:57,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:57,207 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-03 22:47:57,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-03 22:47:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-03 22:47:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:47:57,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:57,208 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] [2018-02-03 22:47:57,208 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1399019159, now seen corresponding path program 1 times [2018-02-03 22:47:57,208 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:57,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:57,209 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:57,209 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:57,209 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:57,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:57,386 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-03 22:47:57,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:57,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 22:47:57,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 22:47:57,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 22:47:57,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:47:57,388 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 12 states. [2018-02-03 22:47:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:57,696 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2018-02-03 22:47:57,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 22:47:57,697 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-02-03 22:47:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:57,698 INFO L225 Difference]: With dead ends: 121 [2018-02-03 22:47:57,698 INFO L226 Difference]: Without dead ends: 121 [2018-02-03 22:47:57,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-03 22:47:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-03 22:47:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2018-02-03 22:47:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-03 22:47:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-02-03 22:47:57,703 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 24 [2018-02-03 22:47:57,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:57,703 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-02-03 22:47:57,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 22:47:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-02-03 22:47:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:47:57,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:57,705 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:57,705 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:57,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1381129789, now seen corresponding path program 1 times [2018-02-03 22:47:57,705 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:57,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:57,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:57,706 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:57,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:57,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:57,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:57,812 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-03 22:47:57,824 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:57,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:57,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:47:57,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:47:57,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:47:57,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:57,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:57,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:47:57,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-03 22:47:57,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-03 22:47:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:57,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:57,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-02-03 22:47:57,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-03 22:47:57,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-03 22:47:57,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-03 22:47:57,985 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 19 states. [2018-02-03 22:47:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:58,272 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-02-03 22:47:58,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:47:58,273 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-02-03 22:47:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:58,274 INFO L225 Difference]: With dead ends: 133 [2018-02-03 22:47:58,274 INFO L226 Difference]: Without dead ends: 133 [2018-02-03 22:47:58,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2018-02-03 22:47:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-03 22:47:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2018-02-03 22:47:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-03 22:47:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-02-03 22:47:58,278 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 24 [2018-02-03 22:47:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:58,278 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-02-03 22:47:58,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-03 22:47:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-02-03 22:47:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 22:47:58,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:58,279 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:58,279 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:58,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2091617170, now seen corresponding path program 1 times [2018-02-03 22:47:58,280 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:58,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:58,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:58,280 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:58,280 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:58,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:58,302 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-03 22:47:58,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:58,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:47:58,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:47:58,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:47:58,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:47:58,303 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 5 states. [2018-02-03 22:47:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:58,315 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2018-02-03 22:47:58,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:47:58,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-03 22:47:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:58,316 INFO L225 Difference]: With dead ends: 118 [2018-02-03 22:47:58,316 INFO L226 Difference]: Without dead ends: 112 [2018-02-03 22:47:58,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:58,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-03 22:47:58,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-03 22:47:58,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-03 22:47:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-02-03 22:47:58,319 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 26 [2018-02-03 22:47:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:58,319 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2018-02-03 22:47:58,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:47:58,320 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-02-03 22:47:58,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:47:58,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:58,320 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:58,320 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:58,320 INFO L82 PathProgramCache]: Analyzing trace with hash -156851199, now seen corresponding path program 2 times [2018-02-03 22:47:58,320 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:58,320 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:58,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:58,321 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:58,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:58,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:58,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:58,585 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:47:58,589 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:47:58,604 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:47:58,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:47:58,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:58,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:47:58,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:58,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:58,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 22:47:58,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:58,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:58,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:47:58,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:58,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:47:58,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:58,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:58,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-03 22:47:58,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:47:58,649 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 13 treesize of output 12 [2018-02-03 22:47:58,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:58,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:58,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:47:58,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-03 22:47:58,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-02-03 22:47:58,772 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-03 22:47:58,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:58,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:58,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:47:58,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-02-03 22:47:58,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-02-03 22:47:58,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-03 22:47:58,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:58,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:58,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:58,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-03 22:47:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:58,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:58,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-02-03 22:47:58,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 22:47:58,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 22:47:58,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-02-03 22:47:58,959 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 26 states. [2018-02-03 22:47:59,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:59,752 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2018-02-03 22:47:59,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 22:47:59,753 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2018-02-03 22:47:59,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:59,753 INFO L225 Difference]: With dead ends: 129 [2018-02-03 22:47:59,753 INFO L226 Difference]: Without dead ends: 129 [2018-02-03 22:47:59,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=1601, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 22:47:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-03 22:47:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2018-02-03 22:47:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-03 22:47:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-02-03 22:47:59,757 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 28 [2018-02-03 22:47:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:59,757 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-02-03 22:47:59,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 22:47:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-02-03 22:47:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:47:59,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:59,757 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:59,758 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:59,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1429135806, now seen corresponding path program 1 times [2018-02-03 22:47:59,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:59,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:59,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:59,758 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:47:59,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:59,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:59,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:59,932 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:47:59,937 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:59,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:59,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:47:59,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:59,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:47:59,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:59,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:59,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:48:00,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:00,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-03 22:48:00,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:00,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:00,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:48:00,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-03 22:48:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:00,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:00,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-02-03 22:48:00,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-03 22:48:00,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-03 22:48:00,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2018-02-03 22:48:00,255 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 28 states. [2018-02-03 22:48:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:01,265 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-02-03 22:48:01,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-03 22:48:01,265 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2018-02-03 22:48:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:01,266 INFO L225 Difference]: With dead ends: 143 [2018-02-03 22:48:01,266 INFO L226 Difference]: Without dead ends: 143 [2018-02-03 22:48:01,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=328, Invalid=2324, Unknown=0, NotChecked=0, Total=2652 [2018-02-03 22:48:01,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-03 22:48:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 96. [2018-02-03 22:48:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-03 22:48:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-02-03 22:48:01,269 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 29 [2018-02-03 22:48:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:01,270 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-02-03 22:48:01,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-03 22:48:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-02-03 22:48:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-03 22:48:01,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:01,270 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, 1] [2018-02-03 22:48:01,270 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:48:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1810852380, now seen corresponding path program 1 times [2018-02-03 22:48:01,270 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:01,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:01,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:01,271 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:01,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:01,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-03 22:48:01,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:01,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:48:01,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:48:01,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:48:01,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:48:01,322 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 6 states. [2018-02-03 22:48:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:01,368 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-02-03 22:48:01,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:48:01,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-03 22:48:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:01,368 INFO L225 Difference]: With dead ends: 95 [2018-02-03 22:48:01,368 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:48:01,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:48:01,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:48:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:48:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:48:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:48:01,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-02-03 22:48:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:01,369 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:48:01,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:48:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:48:01,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:48:01,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:48:01 BoogieIcfgContainer [2018-02-03 22:48:01,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:48:01,373 INFO L168 Benchmark]: Toolchain (without parser) took 8824.26 ms. Allocated memory was 406.3 MB in the beginning and 733.5 MB in the end (delta: 327.2 MB). Free memory was 361.7 MB in the beginning and 559.0 MB in the end (delta: -197.3 MB). Peak memory consumption was 129.9 MB. Max. memory is 5.3 GB. [2018-02-03 22:48:01,374 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 406.3 MB. Free memory is still 369.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:48:01,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.08 ms. Allocated memory is still 406.3 MB. Free memory was 360.4 MB in the beginning and 349.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:48:01,374 INFO L168 Benchmark]: Boogie Preprocessor took 28.71 ms. Allocated memory is still 406.3 MB. Free memory was 349.7 MB in the beginning and 348.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:48:01,374 INFO L168 Benchmark]: RCFGBuilder took 189.07 ms. Allocated memory is still 406.3 MB. Free memory was 348.4 MB in the beginning and 328.6 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-03 22:48:01,374 INFO L168 Benchmark]: TraceAbstraction took 8440.29 ms. Allocated memory was 406.3 MB in the beginning and 733.5 MB in the end (delta: 327.2 MB). Free memory was 328.6 MB in the beginning and 559.0 MB in the end (delta: -230.4 MB). Peak memory consumption was 96.7 MB. Max. memory is 5.3 GB. [2018-02-03 22:48:01,375 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.15 ms. Allocated memory is still 406.3 MB. Free memory is still 369.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 163.08 ms. Allocated memory is still 406.3 MB. Free memory was 360.4 MB in the beginning and 349.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.71 ms. Allocated memory is still 406.3 MB. Free memory was 349.7 MB in the beginning and 348.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 189.07 ms. Allocated memory is still 406.3 MB. Free memory was 348.4 MB in the beginning and 328.6 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8440.29 ms. Allocated memory was 406.3 MB in the beginning and 733.5 MB in the end (delta: 327.2 MB). Free memory was 328.6 MB in the beginning and 559.0 MB in the end (delta: -230.4 MB). Peak memory consumption was 96.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 9 error locations. SAFE Result, 8.4s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 618 SDtfs, 989 SDslu, 3437 SDs, 0 SdLazy, 2651 SolverSat, 304 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=13, 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, 18 MinimizatonAttempts, 218 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 485 ConstructedInterpolants, 15 QuantifiedInterpolants, 90180 SizeOfPredicates, 56 NumberOfNonLiveVariables, 649 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 8/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-48-01-380.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-48-01-380.csv Received shutdown request...