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/cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:04:18,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:04:18,845 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:04:18,857 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:04:18,858 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:04:18,858 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:04:18,859 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:04:18,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:04:18,862 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:04:18,863 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:04:18,864 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:04:18,864 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:04:18,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:04:18,866 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:04:18,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:04:18,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:04:18,869 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:04:18,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:04:18,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:04:18,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:04:18,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:04:18,875 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:04:18,875 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:04:18,876 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:04:18,876 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:04:18,877 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:04:18,877 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:04:18,878 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:04:18,878 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:04:18,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:04:18,878 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:04:18,878 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:04:18,887 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:04:18,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:04:18,888 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:04:18,888 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:04:18,888 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:04:18,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:04:18,889 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:04:18,889 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:04:18,889 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:04:18,889 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:04:18,889 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:04:18,889 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:04:18,889 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:04:18,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:04:18,889 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:04:18,889 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:04:18,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:04:18,890 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:04:18,890 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:04:18,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:04:18,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:04:18,890 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:04:18,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:04:18,890 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:04:18,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:04:18,927 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:04:18,930 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:04:18,931 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:04:18,931 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:04:18,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:04:19,055 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:04:19,056 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:04:19,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:04:19,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:04:19,060 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:04:19,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:04:19" (1/1) ... [2018-02-04 12:04:19,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f13a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:19, skipping insertion in model container [2018-02-04 12:04:19,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:04:19" (1/1) ... [2018-02-04 12:04:19,073 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:04:19,100 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:04:19,188 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:04:19,204 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:04:19,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:19 WrapperNode [2018-02-04 12:04:19,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:04:19,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:04:19,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:04:19,211 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:04:19,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:19" (1/1) ... [2018-02-04 12:04:19,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:19" (1/1) ... [2018-02-04 12:04:19,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:19" (1/1) ... [2018-02-04 12:04:19,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:19" (1/1) ... [2018-02-04 12:04:19,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:19" (1/1) ... [2018-02-04 12:04:19,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:19" (1/1) ... [2018-02-04 12:04:19,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:19" (1/1) ... [2018-02-04 12:04:19,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:04:19,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:04:19,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:04:19,239 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:04:19,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:19" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:04:19,279 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:04:19,279 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:04:19,280 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-02-04 12:04:19,280 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:04:19,280 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:04:19,280 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:04:19,280 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:04:19,280 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:04:19,280 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:04:19,280 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:04:19,281 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-02-04 12:04:19,281 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:04:19,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:04:19,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:04:19,462 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:04:19,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:04:19 BoogieIcfgContainer [2018-02-04 12:04:19,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:04:19,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:04:19,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:04:19,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:04:19,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:04:19" (1/3) ... [2018-02-04 12:04:19,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274f91c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:04:19, skipping insertion in model container [2018-02-04 12:04:19,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:04:19" (2/3) ... [2018-02-04 12:04:19,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274f91c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:04:19, skipping insertion in model container [2018-02-04 12:04:19,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:04:19" (3/3) ... [2018-02-04 12:04:19,467 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:04:19,472 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:04:19,476 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 12:04:19,504 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:04:19,504 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:04:19,504 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:04:19,504 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:04:19,505 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:04:19,505 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:04:19,505 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:04:19,505 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:04:19,505 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:04:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-04 12:04:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:04:19,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:19,520 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:19,521 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash 380982983, now seen corresponding path program 1 times [2018-02-04 12:04:19,526 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:19,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:19,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:19,558 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:19,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:19,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:19,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:19,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:04:19,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:04:19,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:04:19,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:04:19,727 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-02-04 12:04:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:19,885 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-04 12:04:19,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:04:19,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:04:19,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:19,895 INFO L225 Difference]: With dead ends: 57 [2018-02-04 12:04:19,895 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 12:04:19,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:04:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 12:04:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 12:04:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 12:04:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 12:04:19,922 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-02-04 12:04:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:19,922 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 12:04:19,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:04:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 12:04:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:04:19,923 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:19,923 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:19,923 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:19,923 INFO L82 PathProgramCache]: Analyzing trace with hash 380982984, now seen corresponding path program 1 times [2018-02-04 12:04:19,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:19,924 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:19,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:19,924 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:19,925 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:19,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:20,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:20,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:04:20,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:04:20,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:04:20,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:04:20,024 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-02-04 12:04:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:20,075 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-04 12:04:20,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:04:20,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 12:04:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:20,077 INFO L225 Difference]: With dead ends: 53 [2018-02-04 12:04:20,077 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 12:04:20,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:04:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 12:04:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 12:04:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:04:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-04 12:04:20,083 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-02-04 12:04:20,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:20,083 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-04 12:04:20,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:04:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-04 12:04:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:04:20,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:20,084 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:20,084 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:20,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1074429420, now seen corresponding path program 1 times [2018-02-04 12:04:20,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:20,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:20,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,085 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:20,086 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:20,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:20,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:20,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:04:20,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:04:20,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:04:20,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:04:20,119 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-04 12:04:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:20,175 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-04 12:04:20,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:04:20,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:04:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:20,177 INFO L225 Difference]: With dead ends: 52 [2018-02-04 12:04:20,177 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 12:04:20,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:04:20,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 12:04:20,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 12:04:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:04:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 12:04:20,182 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-02-04 12:04:20,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:20,182 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 12:04:20,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:04:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 12:04:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:04:20,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:20,183 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:20,183 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:20,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1074429419, now seen corresponding path program 1 times [2018-02-04 12:04:20,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:20,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:20,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,184 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:20,185 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:20,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:20,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:20,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:04:20,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:04:20,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:04:20,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:04:20,264 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-04 12:04:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:20,288 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-04 12:04:20,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:04:20,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 12:04:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:20,289 INFO L225 Difference]: With dead ends: 51 [2018-02-04 12:04:20,289 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 12:04:20,289 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-04 12:04:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 12:04:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 12:04:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:04:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 12:04:20,292 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-02-04 12:04:20,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:20,292 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 12:04:20,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:04:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 12:04:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:04:20,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:20,292 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-04 12:04:20,292 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:20,293 INFO L82 PathProgramCache]: Analyzing trace with hash -425895657, now seen corresponding path program 1 times [2018-02-04 12:04:20,293 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:20,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:20,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,293 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:20,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:20,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:20,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:20,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:04:20,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:04:20,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:04:20,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:04:20,333 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-04 12:04:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:20,373 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 12:04:20,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:04:20,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 12:04:20,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:20,375 INFO L225 Difference]: With dead ends: 49 [2018-02-04 12:04:20,375 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 12:04:20,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:04:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 12:04:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 12:04:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 12:04:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 12:04:20,379 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-02-04 12:04:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:20,379 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 12:04:20,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:04:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 12:04:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:04:20,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:20,380 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-04 12:04:20,380 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:20,381 INFO L82 PathProgramCache]: Analyzing trace with hash -425895656, now seen corresponding path program 1 times [2018-02-04 12:04:20,381 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:20,381 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:20,382 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,382 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:20,382 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:20,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:20,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:20,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:04:20,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:04:20,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:04:20,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:04:20,467 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-02-04 12:04:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:20,566 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-02-04 12:04:20,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:04:20,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 12:04:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:20,569 INFO L225 Difference]: With dead ends: 73 [2018-02-04 12:04:20,569 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 12:04:20,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:04:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 12:04:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-02-04 12:04:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:04:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-04 12:04:20,573 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-02-04 12:04:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:20,573 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-04 12:04:20,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:04:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-04 12:04:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:04:20,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:20,574 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] [2018-02-04 12:04:20,574 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:20,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1156031168, now seen corresponding path program 1 times [2018-02-04 12:04:20,574 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:20,575 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:20,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,575 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:20,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:20,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:20,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:20,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:04:20,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:04:20,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:04:20,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:04:20,611 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-02-04 12:04:20,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:20,661 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-04 12:04:20,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:04:20,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 12:04:20,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:20,661 INFO L225 Difference]: With dead ends: 53 [2018-02-04 12:04:20,661 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 12:04:20,662 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-04 12:04:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 12:04:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-02-04 12:04:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:04:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 12:04:20,664 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-02-04 12:04:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:20,664 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 12:04:20,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:04:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 12:04:20,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:04:20,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:20,665 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] [2018-02-04 12:04:20,665 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:20,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1156031167, now seen corresponding path program 1 times [2018-02-04 12:04:20,666 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:20,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:20,666 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,667 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:20,667 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:20,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:20,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:20,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:04:20,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:04:20,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:04:20,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:04:20,758 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-02-04 12:04:20,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:20,849 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-04 12:04:20,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:04:20,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-04 12:04:20,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:20,850 INFO L225 Difference]: With dead ends: 67 [2018-02-04 12:04:20,850 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 12:04:20,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:04:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 12:04:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-04 12:04:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 12:04:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-04 12:04:20,852 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-02-04 12:04:20,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:20,853 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-04 12:04:20,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:04:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-04 12:04:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:04:20,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:20,853 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] [2018-02-04 12:04:20,853 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:20,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1785224664, now seen corresponding path program 1 times [2018-02-04 12:04:20,853 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:20,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:20,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:20,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:20,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:20,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:20,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:04:20,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:04:20,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:04:20,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:04:20,885 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 3 states. [2018-02-04 12:04:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:20,889 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-02-04 12:04:20,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:04:20,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-04 12:04:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:20,890 INFO L225 Difference]: With dead ends: 60 [2018-02-04 12:04:20,890 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 12:04:20,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:04:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 12:04:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 12:04:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 12:04:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-02-04 12:04:20,894 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 28 [2018-02-04 12:04:20,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:20,894 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-02-04 12:04:20,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:04:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-02-04 12:04:20,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:04:20,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:20,895 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:20,895 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash -419708018, now seen corresponding path program 1 times [2018-02-04 12:04:20,895 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:20,896 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:20,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,896 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:20,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:20,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:20,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:20,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:04:20,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:04:20,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:04:20,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:04:20,961 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 6 states. [2018-02-04 12:04:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:21,057 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-02-04 12:04:21,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:04:21,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 12:04:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:21,058 INFO L225 Difference]: With dead ends: 59 [2018-02-04 12:04:21,058 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 12:04:21,059 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-04 12:04:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 12:04:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 12:04:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:04:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 12:04:21,061 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-02-04 12:04:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:21,061 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 12:04:21,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:04:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 12:04:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:04:21,061 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:21,061 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:21,061 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:21,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2090509973, now seen corresponding path program 1 times [2018-02-04 12:04:21,062 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:21,062 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:21,062 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:21,062 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:21,062 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:21,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:21,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:21,225 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:04:21,230 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:21,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:21,318 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-04 12:04:21,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:04:21,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:21,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:21,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:04:21,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:04:21,410 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 11 treesize of output 8 [2018-02-04 12:04:21,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:04:21,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-02-04 12:04:21,445 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 22 treesize of output 23 [2018-02-04 12:04:21,448 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-04 12:04:21,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:21,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-02-04 12:04:21,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-02-04 12:04:21,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-04 12:04:21,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 12:04:21,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:21,580 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2018-02-04 12:04:21,600 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-04 12:04:21,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:04:21,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2018-02-04 12:04:21,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 12:04:21,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 12:04:21,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:04:21,629 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 23 states. [2018-02-04 12:04:23,448 WARN L143 SmtUtils]: Spent 1497ms on a formula simplification that was a NOOP. DAG size: 49 [2018-02-04 12:04:26,015 WARN L143 SmtUtils]: Spent 2533ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-04 12:04:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:26,272 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-02-04 12:04:26,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 12:04:26,273 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-02-04 12:04:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:26,274 INFO L225 Difference]: With dead ends: 90 [2018-02-04 12:04:26,274 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 12:04:26,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 12:04:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 12:04:26,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2018-02-04 12:04:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 12:04:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-02-04 12:04:26,279 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 30 [2018-02-04 12:04:26,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:26,279 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-02-04 12:04:26,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 12:04:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-02-04 12:04:26,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:04:26,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:26,280 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-04 12:04:26,280 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1058376373, now seen corresponding path program 1 times [2018-02-04 12:04:26,280 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:26,281 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:26,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:26,281 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:26,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:26,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:26,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:26,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:04:26,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:04:26,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:04:26,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:04:26,338 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 10 states. [2018-02-04 12:04:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:26,457 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-02-04 12:04:26,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:04:26,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-04 12:04:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:26,458 INFO L225 Difference]: With dead ends: 62 [2018-02-04 12:04:26,458 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 12:04:26,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:04:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 12:04:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-02-04 12:04:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 12:04:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-02-04 12:04:26,461 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2018-02-04 12:04:26,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:26,462 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-02-04 12:04:26,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:04:26,462 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-02-04 12:04:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:04:26,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:26,463 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, 1, 1] [2018-02-04 12:04:26,463 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:26,463 INFO L82 PathProgramCache]: Analyzing trace with hash 532181010, now seen corresponding path program 1 times [2018-02-04 12:04:26,463 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:26,463 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:26,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:26,464 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:26,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:26,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:26,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:26,635 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:04:26,651 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:26,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:26,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:26,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:26,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:26,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:04:26,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:26,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:26,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:04:26,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:26,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:26,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:04:26,716 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 14 treesize of output 11 [2018-02-04 12:04:26,718 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-04 12:04:26,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:26,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:26,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:26,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:04:26,743 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 25 treesize of output 26 [2018-02-04 12:04:26,745 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-04 12:04:26,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:26,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:26,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:26,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-04 12:04:27,700 WARN L143 SmtUtils]: Spent 663ms on a formula simplification that was a NOOP. DAG size: 46 [2018-02-04 12:04:27,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-02-04 12:04:27,806 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 45 treesize of output 43 [2018-02-04 12:04:27,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:27,865 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 37 treesize of output 35 [2018-02-04 12:04:27,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:27,912 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 31 treesize of output 23 [2018-02-04 12:04:27,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:27,924 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 27 treesize of output 19 [2018-02-04 12:04:27,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2018-02-04 12:04:28,010 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 12:04:28,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-02-04 12:04:28,080 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-02-04 12:04:28,082 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-02-04 12:04:28,137 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-02-04 12:04:28,138 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-02-04 12:04:28,140 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-02-04 12:04:28,181 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-02-04 12:04:28,184 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 12:04:28,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:04:28,303 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-02-04 12:04:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:28,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:28,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2018-02-04 12:04:28,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 12:04:28,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 12:04:28,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:04:28,397 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 29 states. [2018-02-04 12:04:29,649 WARN L146 SmtUtils]: Spent 714ms on a formula simplification. DAG size of input: 71 DAG size of output 62 [2018-02-04 12:04:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:30,449 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-02-04 12:04:30,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:04:30,450 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2018-02-04 12:04:30,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:30,450 INFO L225 Difference]: With dead ends: 124 [2018-02-04 12:04:30,450 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 12:04:30,453 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=331, Invalid=1831, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 12:04:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 12:04:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 87. [2018-02-04 12:04:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 12:04:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2018-02-04 12:04:30,457 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 33 [2018-02-04 12:04:30,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:30,463 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2018-02-04 12:04:30,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 12:04:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-02-04 12:04:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 12:04:30,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:30,464 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:30,464 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:30,464 INFO L82 PathProgramCache]: Analyzing trace with hash -360199549, now seen corresponding path program 1 times [2018-02-04 12:04:30,464 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:30,464 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:30,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:30,465 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:30,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:30,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:30,757 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-04 12:04:30,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:30,757 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:04:30,764 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:30,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:30,787 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-04 12:04:30,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:04:30,809 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 15 treesize of output 12 [2018-02-04 12:04:30,810 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 12 treesize of output 11 [2018-02-04 12:04:30,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 12:04:30,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 12:04:30,920 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 15 treesize of output 12 [2018-02-04 12:04:30,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:30,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:30,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:30,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 12:04:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:31,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:31,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-02-04 12:04:31,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 12:04:31,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 12:04:31,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:04:31,007 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 22 states. [2018-02-04 12:04:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:31,611 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2018-02-04 12:04:31,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:04:31,611 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-02-04 12:04:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:31,612 INFO L225 Difference]: With dead ends: 108 [2018-02-04 12:04:31,612 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 12:04:31,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 12:04:31,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 12:04:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 52. [2018-02-04 12:04:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:04:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-04 12:04:31,615 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 37 [2018-02-04 12:04:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:31,615 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-04 12:04:31,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 12:04:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-04 12:04:31,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:04:31,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:31,616 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:31,617 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1944116138, now seen corresponding path program 2 times [2018-02-04 12:04:31,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:31,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:31,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:31,618 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:31,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:31,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:31,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:31,912 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-04 12:04:31,916 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:04:31,935 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:04:31,935 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:04:31,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:31,941 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-04 12:04:31,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:31,946 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-04 12:04:31,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:31,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:31,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:04:31,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:31,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:31,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:04:31,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:31,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:04:31,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:31,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:31,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 12:04:32,047 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-04 12:04:32,049 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-04 12:04:32,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:32,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:32,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:32,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-04 12:04:32,080 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 29 treesize of output 30 [2018-02-04 12:04:32,081 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-04 12:04:32,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:32,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:32,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:32,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-02-04 12:04:32,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-02-04 12:04:32,584 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-04 12:04:32,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:32,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-02-04 12:04:32,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:32,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:32,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 12:04:32,613 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-02-04 12:04:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:32,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:32,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-02-04 12:04:32,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 12:04:32,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 12:04:32,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:04:32,876 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 33 states. [2018-02-04 12:04:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:36,507 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-02-04 12:04:36,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 12:04:36,508 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-02-04 12:04:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:36,508 INFO L225 Difference]: With dead ends: 123 [2018-02-04 12:04:36,508 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 12:04:36,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=840, Invalid=5322, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 12:04:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 12:04:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 71. [2018-02-04 12:04:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 12:04:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-02-04 12:04:36,511 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 48 [2018-02-04 12:04:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:36,511 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-02-04 12:04:36,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 12:04:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-02-04 12:04:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 12:04:36,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:36,512 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:36,512 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-04 12:04:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2133346040, now seen corresponding path program 1 times [2018-02-04 12:04:36,512 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:36,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:36,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:36,513 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:04:36,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:36,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 12:04:36,718 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:36,718 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:04:36,723 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:36,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:36,745 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-04 12:04:36,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:36,749 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-04 12:04:36,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:36,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:36,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:04:36,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:36,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:36,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:04:36,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:36,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:04:36,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:36,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:36,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:04:36,805 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-04 12:04:36,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:04:36,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:36,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:36,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:36,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 12:04:36,831 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 29 treesize of output 30 [2018-02-04 12:04:36,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:04:36,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:36,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:36,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:36,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-04 12:04:39,321 WARN L143 SmtUtils]: Spent 2027ms on a formula simplification that was a NOOP. DAG size: 46 [2018-02-04 12:04:39,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 57 [2018-02-04 12:04:39,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-02-04 12:04:39,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:39,419 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 41 treesize of output 39 [2018-02-04 12:04:39,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:39,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-02-04 12:04:39,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:39,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-02-04 12:04:39,487 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:39,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-02-04 12:04:39,532 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 12:04:39,595 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 28 treesize of output 26 [2018-02-04 12:04:39,596 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:39,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2018-02-04 12:04:39,653 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-04 12:04:39,721 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 35 treesize of output 27 [2018-02-04 12:04:39,722 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:39,723 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 29 treesize of output 21 [2018-02-04 12:04:39,723 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:39,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 12:04:39,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 12:04:39,811 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:67, output treesize:106 [2018-02-04 12:04:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:04:39,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:39,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-02-04 12:04:39,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 12:04:39,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 12:04:39,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:04:39,943 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 33 states. [2018-02-04 12:04:40,333 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 39 DAG size of output 35 [2018-02-04 12:04:40,685 WARN L146 SmtUtils]: Spent 301ms on a formula simplification. DAG size of input: 48 DAG size of output 43 [2018-02-04 12:04:41,944 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 50 DAG size of output 43 [2018-02-04 12:04:46,426 WARN L146 SmtUtils]: Spent 4144ms on a formula simplification. DAG size of input: 63 DAG size of output 56 [2018-02-04 12:04:46,606 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 63 DAG size of output 53 [2018-02-04 12:04:47,964 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 58 DAG size of output 50 [2018-02-04 12:04:52,118 WARN L146 SmtUtils]: Spent 4090ms on a formula simplification. DAG size of input: 65 DAG size of output 57 [2018-02-04 12:04:52,272 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 65 DAG size of output 54 [2018-02-04 12:04:52,609 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 60 DAG size of output 52 [2018-02-04 12:04:53,103 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 65 DAG size of output 53 [2018-02-04 12:04:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:53,148 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-02-04 12:04:53,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 12:04:53,148 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-02-04 12:04:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:53,148 INFO L225 Difference]: With dead ends: 98 [2018-02-04 12:04:53,148 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:04:53,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=892, Invalid=3398, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 12:04:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:04:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:04:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:04:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:04:53,150 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-02-04 12:04:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:53,150 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:04:53,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 12:04:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:04:53,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:04:53,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:04:53 BoogieIcfgContainer [2018-02-04 12:04:53,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:04:53,156 INFO L168 Benchmark]: Toolchain (without parser) took 34100.59 ms. Allocated memory was 396.4 MB in the beginning and 777.5 MB in the end (delta: 381.2 MB). Free memory was 353.1 MB in the beginning and 579.1 MB in the end (delta: -226.0 MB). Peak memory consumption was 155.1 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:53,157 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 396.4 MB. Free memory is still 358.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:04:53,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.13 ms. Allocated memory is still 396.4 MB. Free memory was 353.1 MB in the beginning and 342.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:53,157 INFO L168 Benchmark]: Boogie Preprocessor took 27.38 ms. Allocated memory is still 396.4 MB. Free memory was 342.5 MB in the beginning and 339.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:53,158 INFO L168 Benchmark]: RCFGBuilder took 224.12 ms. Allocated memory is still 396.4 MB. Free memory was 339.8 MB in the beginning and 320.0 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:53,158 INFO L168 Benchmark]: TraceAbstraction took 33692.38 ms. Allocated memory was 396.4 MB in the beginning and 777.5 MB in the end (delta: 381.2 MB). Free memory was 317.4 MB in the beginning and 579.1 MB in the end (delta: -261.7 MB). Peak memory consumption was 119.4 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:53,161 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 396.4 MB. Free memory is still 358.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.13 ms. Allocated memory is still 396.4 MB. Free memory was 353.1 MB in the beginning and 342.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.38 ms. Allocated memory is still 396.4 MB. Free memory was 342.5 MB in the beginning and 339.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 224.12 ms. Allocated memory is still 396.4 MB. Free memory was 339.8 MB in the beginning and 320.0 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 33692.38 ms. Allocated memory was 396.4 MB in the beginning and 777.5 MB in the end (delta: 381.2 MB). Free memory was 317.4 MB in the beginning and 579.1 MB in the end (delta: -261.7 MB). Peak memory consumption was 119.4 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: 555]: 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 - 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: 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 - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. SAFE Result, 33.6s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 24.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 621 SDtfs, 1801 SDslu, 2821 SDs, 0 SdLazy, 3913 SolverSat, 375 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 158 SyntacticMatches, 8 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 27.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred 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, 16 MinimizatonAttempts, 198 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 659 NumberOfCodeBlocks, 659 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 638 ConstructedInterpolants, 106 QuantifiedInterpolants, 465412 SizeOfPredicates, 76 NumberOfNonLiveVariables, 885 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 95/216 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/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-04-53-167.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-04-53-167.csv Received shutdown request...