java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:45:48,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:45:48,913 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:45:48,922 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:45:48,922 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:45:48,923 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:45:48,924 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:45:48,925 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:45:48,927 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:45:48,927 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:45:48,928 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:45:48,928 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:45:48,929 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:45:48,930 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:45:48,930 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:45:48,932 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:45:48,934 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:45:48,935 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:45:48,936 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:45:48,937 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:45:48,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:45:48,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:45:48,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:45:48,939 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:45:48,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:45:48,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:45:48,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:45:48,941 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:45:48,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:45:48,942 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:45:48,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:45:48,943 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 18:45:48,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:45:48,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:45:48,953 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:45:48,953 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:45:48,953 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:45:48,953 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:45:48,954 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:45:48,954 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:45:48,954 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:45:48,954 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:45:48,954 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:45:48,954 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:45:48,954 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:45:48,955 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:45:48,955 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:45:48,955 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:45:48,955 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:45:48,955 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:45:48,955 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:45:48,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:45:48,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:45:48,956 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:45:48,956 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:45:48,956 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:45:48,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:45:48,997 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:45:49,002 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:45:49,004 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:45:49,004 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:45:49,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-02-04 18:45:49,165 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:45:49,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:45:49,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:45:49,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:45:49,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:45:49,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:45:49" (1/1) ... [2018-02-04 18:45:49,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac502e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:49, skipping insertion in model container [2018-02-04 18:45:49,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:45:49" (1/1) ... [2018-02-04 18:45:49,188 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:45:49,218 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:45:49,306 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:45:49,321 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:45:49,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:49 WrapperNode [2018-02-04 18:45:49,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:45:49,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:45:49,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:45:49,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:45:49,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:49" (1/1) ... [2018-02-04 18:45:49,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:49" (1/1) ... [2018-02-04 18:45:49,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:49" (1/1) ... [2018-02-04 18:45:49,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:49" (1/1) ... [2018-02-04 18:45:49,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:49" (1/1) ... [2018-02-04 18:45:49,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:49" (1/1) ... [2018-02-04 18:45:49,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:49" (1/1) ... [2018-02-04 18:45:49,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:45:49,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:45:49,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:45:49,361 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:45:49,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:49" (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 18:45:49,394 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:45:49,394 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:45:49,394 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:45:49,395 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 18:45:49,395 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 18:45:49,395 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:45:49,395 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:45:49,395 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:45:49,395 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:45:49,395 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:45:49,396 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 18:45:49,396 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:45:49,396 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 18:45:49,396 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 18:45:49,396 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:45:49,396 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:45:49,396 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:45:49,710 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:45:49,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:45:49 BoogieIcfgContainer [2018-02-04 18:45:49,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:45:49,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:45:49,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:45:49,714 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:45:49,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:45:49" (1/3) ... [2018-02-04 18:45:49,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18630a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:45:49, skipping insertion in model container [2018-02-04 18:45:49,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:45:49" (2/3) ... [2018-02-04 18:45:49,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18630a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:45:49, skipping insertion in model container [2018-02-04 18:45:49,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:45:49" (3/3) ... [2018-02-04 18:45:49,717 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-02-04 18:45:49,723 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:45:49,730 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-02-04 18:45:49,762 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:45:49,762 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:45:49,762 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:45:49,762 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:45:49,762 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:45:49,762 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:45:49,763 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:45:49,763 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:45:49,763 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:45:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-02-04 18:45:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 18:45:49,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:49,786 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:49,786 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:49,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1548810554, now seen corresponding path program 1 times [2018-02-04 18:45:49,792 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:49,792 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:49,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:49,836 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:49,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:49,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:49,897 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 18:45:49,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:49,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:45:49,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 18:45:49,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 18:45:49,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 18:45:49,916 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-02-04 18:45:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:49,993 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-02-04 18:45:49,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 18:45:49,994 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-02-04 18:45:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:50,001 INFO L225 Difference]: With dead ends: 101 [2018-02-04 18:45:50,001 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 18:45:50,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 18:45:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 18:45:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-02-04 18:45:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 18:45:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-02-04 18:45:50,029 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 10 [2018-02-04 18:45:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:50,029 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-02-04 18:45:50,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 18:45:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-02-04 18:45:50,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 18:45:50,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:50,030 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:50,030 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:50,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2085004617, now seen corresponding path program 1 times [2018-02-04 18:45:50,031 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:50,031 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:50,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:50,032 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:50,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:50,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:50,087 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 18:45:50,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:50,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:45:50,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:45:50,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:45:50,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:45:50,089 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 3 states. [2018-02-04 18:45:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:50,113 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-02-04 18:45:50,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:45:50,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 18:45:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:50,114 INFO L225 Difference]: With dead ends: 107 [2018-02-04 18:45:50,115 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 18:45:50,115 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 18:45:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 18:45:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-02-04 18:45:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 18:45:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-02-04 18:45:50,122 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 13 [2018-02-04 18:45:50,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:50,122 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-02-04 18:45:50,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:45:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-02-04 18:45:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 18:45:50,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:50,123 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:50,123 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:50,124 INFO L82 PathProgramCache]: Analyzing trace with hash -211715870, now seen corresponding path program 1 times [2018-02-04 18:45:50,124 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:50,124 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:50,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:50,125 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:50,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:50,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:50,171 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 18:45:50,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:50,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:45:50,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:45:50,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:45:50,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:45:50,172 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 4 states. [2018-02-04 18:45:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:50,271 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-02-04 18:45:50,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:45:50,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 18:45:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:50,274 INFO L225 Difference]: With dead ends: 127 [2018-02-04 18:45:50,274 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 18:45:50,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:45:50,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 18:45:50,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-02-04 18:45:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 18:45:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-02-04 18:45:50,281 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 14 [2018-02-04 18:45:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:50,281 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-02-04 18:45:50,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:45:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-02-04 18:45:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 18:45:50,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:50,282 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:50,282 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:50,282 INFO L82 PathProgramCache]: Analyzing trace with hash -211715869, now seen corresponding path program 1 times [2018-02-04 18:45:50,283 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:50,283 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:50,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:50,284 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:50,284 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:50,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:50,345 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 18:45:50,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:50,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:45:50,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:45:50,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:45:50,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:45:50,346 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 4 states. [2018-02-04 18:45:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:50,435 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2018-02-04 18:45:50,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:45:50,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 18:45:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:50,437 INFO L225 Difference]: With dead ends: 138 [2018-02-04 18:45:50,437 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 18:45:50,437 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 18:45:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 18:45:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2018-02-04 18:45:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 18:45:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-02-04 18:45:50,442 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 14 [2018-02-04 18:45:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:50,443 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-02-04 18:45:50,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:45:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-02-04 18:45:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 18:45:50,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:50,443 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:50,443 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:50,447 INFO L82 PathProgramCache]: Analyzing trace with hash -210634142, now seen corresponding path program 1 times [2018-02-04 18:45:50,447 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:50,447 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:50,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:50,448 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:50,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:50,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:50,474 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 18:45:50,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:50,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:45:50,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:45:50,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:45:50,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:45:50,475 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 3 states. [2018-02-04 18:45:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:50,524 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2018-02-04 18:45:50,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:45:50,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 18:45:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:50,525 INFO L225 Difference]: With dead ends: 102 [2018-02-04 18:45:50,525 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 18:45:50,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:45:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 18:45:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-02-04 18:45:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 18:45:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-02-04 18:45:50,530 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 14 [2018-02-04 18:45:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:50,530 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-02-04 18:45:50,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:45:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-02-04 18:45:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 18:45:50,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:50,531 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:50,531 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash 479661366, now seen corresponding path program 1 times [2018-02-04 18:45:50,531 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:50,532 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:50,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:50,532 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:50,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:50,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:50,582 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 18:45:50,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:50,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:45:50,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:45:50,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:45:50,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:45:50,583 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 3 states. [2018-02-04 18:45:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:50,605 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2018-02-04 18:45:50,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:45:50,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-02-04 18:45:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:50,606 INFO L225 Difference]: With dead ends: 143 [2018-02-04 18:45:50,607 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 18:45:50,607 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 18:45:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 18:45:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2018-02-04 18:45:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 18:45:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2018-02-04 18:45:50,612 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 26 [2018-02-04 18:45:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:50,612 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2018-02-04 18:45:50,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:45:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2018-02-04 18:45:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 18:45:50,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:50,613 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:50,613 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1985366289, now seen corresponding path program 1 times [2018-02-04 18:45:50,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:50,614 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:50,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:50,615 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:50,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:50,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:50,657 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:45:50,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:50,657 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:50,658 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:50,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:50,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:50,813 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 24 [2018-02-04 18:45:50,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:45:50,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:45:50,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:32 [2018-02-04 18:45:50,908 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 18:45:50,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:50,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:45:50,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:45:50,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:45:50,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:45:50,909 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand 7 states. [2018-02-04 18:45:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:51,286 INFO L93 Difference]: Finished difference Result 203 states and 236 transitions. [2018-02-04 18:45:51,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:45:51,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 18:45:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:51,288 INFO L225 Difference]: With dead ends: 203 [2018-02-04 18:45:51,288 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 18:45:51,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:45:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 18:45:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 123. [2018-02-04 18:45:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 18:45:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2018-02-04 18:45:51,303 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 27 [2018-02-04 18:45:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:51,303 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2018-02-04 18:45:51,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:45:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2018-02-04 18:45:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 18:45:51,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:51,304 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 18:45:51,304 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812824, now seen corresponding path program 1 times [2018-02-04 18:45:51,304 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:51,305 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:51,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:51,306 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:51,306 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:51,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:51,349 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 18:45:51,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:51,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:45:51,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:45:51,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:45:51,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:45:51,350 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand 4 states. [2018-02-04 18:45:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:51,450 INFO L93 Difference]: Finished difference Result 180 states and 210 transitions. [2018-02-04 18:45:51,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:45:51,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 18:45:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:51,451 INFO L225 Difference]: With dead ends: 180 [2018-02-04 18:45:51,451 INFO L226 Difference]: Without dead ends: 180 [2018-02-04 18:45:51,452 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 18:45:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-04 18:45:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 119. [2018-02-04 18:45:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 18:45:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2018-02-04 18:45:51,457 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 28 [2018-02-04 18:45:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:51,458 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2018-02-04 18:45:51,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:45:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2018-02-04 18:45:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 18:45:51,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:51,459 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 18:45:51,459 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:51,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812825, now seen corresponding path program 1 times [2018-02-04 18:45:51,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:51,459 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:51,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:51,460 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:51,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:51,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:51,547 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 18:45:51,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:51,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:45:51,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:45:51,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:45:51,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:45:51,548 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand 4 states. [2018-02-04 18:45:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:51,644 INFO L93 Difference]: Finished difference Result 160 states and 181 transitions. [2018-02-04 18:45:51,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:45:51,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 18:45:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:51,646 INFO L225 Difference]: With dead ends: 160 [2018-02-04 18:45:51,646 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 18:45:51,646 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 18:45:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 18:45:51,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 115. [2018-02-04 18:45:51,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 18:45:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2018-02-04 18:45:51,649 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 28 [2018-02-04 18:45:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:51,649 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2018-02-04 18:45:51,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:45:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2018-02-04 18:45:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 18:45:51,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:51,650 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:51,650 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:51,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264726, now seen corresponding path program 1 times [2018-02-04 18:45:51,650 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:51,650 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:51,652 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:51,652 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:51,652 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:51,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:51,668 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:45:51,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:51,669 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:51,669 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:51,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:51,703 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 5 treesize of output 1 [2018-02-04 18:45:51,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-02-04 18:45:51,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:45:51,707 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 18:45:51,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 18:45:51,712 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 21 treesize of output 16 [2018-02-04 18:45:51,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:51,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 18:45:51,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-02-04 18:45:51,726 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 36 treesize of output 29 [2018-02-04 18:45:51,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:51,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:51,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:51,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 18:45:51,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2018-02-04 18:45:51,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-02-04 18:45:51,762 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 33 treesize of output 32 [2018-02-04 18:45:51,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,784 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 1 xjuncts. [2018-02-04 18:45:51,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-02-04 18:45:51,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-02-04 18:45:51,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:51,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-02-04 18:45:51,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:51,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:5 [2018-02-04 18:45:51,816 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 18:45:51,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:51,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:45:51,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:45:51,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:45:51,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:45:51,817 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand 7 states. [2018-02-04 18:45:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:52,099 INFO L93 Difference]: Finished difference Result 176 states and 198 transitions. [2018-02-04 18:45:52,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:45:52,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 18:45:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:52,100 INFO L225 Difference]: With dead ends: 176 [2018-02-04 18:45:52,100 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 18:45:52,101 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:45:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 18:45:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 135. [2018-02-04 18:45:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 18:45:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2018-02-04 18:45:52,103 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 31 [2018-02-04 18:45:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:52,103 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2018-02-04 18:45:52,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:45:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2018-02-04 18:45:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 18:45:52,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:52,104 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:52,104 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:52,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264727, now seen corresponding path program 1 times [2018-02-04 18:45:52,104 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:52,104 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:52,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:52,105 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:52,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:52,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:52,115 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:45:52,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:52,115 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:52,116 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:52,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:52,136 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 18:45:52,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:45:52,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:45:52,163 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 18:45:52,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:45:52,174 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 18:45:52,175 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,194 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-02-04 18:45:52,218 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 21 treesize of output 16 [2018-02-04 18:45:52,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:52,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 18:45:52,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,245 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 21 treesize of output 16 [2018-02-04 18:45:52,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:52,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 18:45:52,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-02-04 18:45:52,279 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 36 treesize of output 29 [2018-02-04 18:45:52,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:52,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:52,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:52,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 18:45:52,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,307 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 36 treesize of output 29 [2018-02-04 18:45:52,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:52,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:52,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:52,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 18:45:52,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,324 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2018-02-04 18:45:52,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:52,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:52,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 18:45:52,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:52,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 18:45:52,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:45:52,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:56 [2018-02-04 18:45:52,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:52,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 18:45:52,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:45:52,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:53 [2018-02-04 18:45:52,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2018-02-04 18:45:52,436 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 31 treesize of output 30 [2018-02-04 18:45:52,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2018-02-04 18:45:52,470 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 31 treesize of output 30 [2018-02-04 18:45:52,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:45:52,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:61 [2018-02-04 18:45:52,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2018-02-04 18:45:52,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2018-02-04 18:45:52,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2018-02-04 18:45:52,553 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 27 treesize of output 20 [2018-02-04 18:45:52,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2018-02-04 18:45:52,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2018-02-04 18:45:52,581 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:52,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:45:52,589 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:75, output treesize:14 [2018-02-04 18:45:52,604 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 18:45:52,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:52,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 18:45:52,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 18:45:52,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 18:45:52,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=80, Unknown=1, NotChecked=0, Total=110 [2018-02-04 18:45:52,605 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand 11 states. [2018-02-04 18:45:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:53,049 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2018-02-04 18:45:53,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 18:45:53,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-02-04 18:45:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:53,051 INFO L225 Difference]: With dead ends: 234 [2018-02-04 18:45:53,051 INFO L226 Difference]: Without dead ends: 234 [2018-02-04 18:45:53,052 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=288, Unknown=2, NotChecked=0, Total=380 [2018-02-04 18:45:53,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-04 18:45:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 130. [2018-02-04 18:45:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 18:45:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2018-02-04 18:45:53,056 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 31 [2018-02-04 18:45:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:53,056 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2018-02-04 18:45:53,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 18:45:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2018-02-04 18:45:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 18:45:53,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:53,057 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:53,057 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash 414150462, now seen corresponding path program 1 times [2018-02-04 18:45:53,057 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:53,057 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:53,058 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:53,058 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:53,058 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:53,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:45:53,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:53,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:45:53,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:45:53,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:45:53,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:45:53,088 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand 4 states. [2018-02-04 18:45:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:53,186 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2018-02-04 18:45:53,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:45:53,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-02-04 18:45:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:53,187 INFO L225 Difference]: With dead ends: 160 [2018-02-04 18:45:53,187 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 18:45:53,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:45:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 18:45:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2018-02-04 18:45:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 18:45:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2018-02-04 18:45:53,190 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 32 [2018-02-04 18:45:53,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:53,191 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2018-02-04 18:45:53,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:45:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2018-02-04 18:45:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 18:45:53,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:53,192 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:53,192 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:53,192 INFO L82 PathProgramCache]: Analyzing trace with hash 414150463, now seen corresponding path program 1 times [2018-02-04 18:45:53,192 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:53,192 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:53,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:53,193 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:53,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:53,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:45:53,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:53,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:45:53,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:45:53,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:45:53,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:45:53,257 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand 5 states. [2018-02-04 18:45:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:53,384 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2018-02-04 18:45:53,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:45:53,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-04 18:45:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:53,385 INFO L225 Difference]: With dead ends: 212 [2018-02-04 18:45:53,385 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 18:45:53,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:45:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 18:45:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 162. [2018-02-04 18:45:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 18:45:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2018-02-04 18:45:53,390 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 32 [2018-02-04 18:45:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:53,390 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2018-02-04 18:45:53,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:45:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2018-02-04 18:45:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 18:45:53,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:53,391 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:53,391 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:53,391 INFO L82 PathProgramCache]: Analyzing trace with hash -46238021, now seen corresponding path program 1 times [2018-02-04 18:45:53,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:53,392 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:53,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:53,392 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:53,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:53,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:45:53,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:53,425 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:53,425 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:53,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:45:53,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:45:53,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-02-04 18:45:53,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:45:53,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:45:53,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:45:53,461 INFO L87 Difference]: Start difference. First operand 162 states and 189 transitions. Second operand 5 states. [2018-02-04 18:45:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:53,479 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-04 18:45:53,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:45:53,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-04 18:45:53,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:53,481 INFO L225 Difference]: With dead ends: 162 [2018-02-04 18:45:53,481 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 18:45:53,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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 18:45:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 18:45:53,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-04 18:45:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 18:45:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2018-02-04 18:45:53,484 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 33 [2018-02-04 18:45:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:53,485 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2018-02-04 18:45:53,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:45:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2018-02-04 18:45:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 18:45:53,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:53,485 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:53,485 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:53,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361569, now seen corresponding path program 1 times [2018-02-04 18:45:53,486 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:53,486 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:53,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:53,487 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:53,487 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:53,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 18:45:53,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:53,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:45:53,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:45:53,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:45:53,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:45:53,513 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand 4 states. [2018-02-04 18:45:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:53,570 INFO L93 Difference]: Finished difference Result 176 states and 203 transitions. [2018-02-04 18:45:53,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:45:53,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 18:45:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:53,571 INFO L225 Difference]: With dead ends: 176 [2018-02-04 18:45:53,571 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 18:45:53,572 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 18:45:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 18:45:53,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2018-02-04 18:45:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 18:45:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 200 transitions. [2018-02-04 18:45:53,575 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 200 transitions. Word has length 34 [2018-02-04 18:45:53,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:53,575 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 200 transitions. [2018-02-04 18:45:53,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:45:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 200 transitions. [2018-02-04 18:45:53,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 18:45:53,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:53,576 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:53,576 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:53,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361568, now seen corresponding path program 1 times [2018-02-04 18:45:53,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:53,577 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:53,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:53,577 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:53,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:53,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:45:53,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:53,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:45:53,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:45:53,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:45:53,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:45:53,650 INFO L87 Difference]: Start difference. First operand 168 states and 200 transitions. Second operand 6 states. [2018-02-04 18:45:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:53,834 INFO L93 Difference]: Finished difference Result 250 states and 300 transitions. [2018-02-04 18:45:53,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:45:53,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 18:45:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:53,835 INFO L225 Difference]: With dead ends: 250 [2018-02-04 18:45:53,835 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 18:45:53,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:45:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 18:45:53,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 186. [2018-02-04 18:45:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 18:45:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2018-02-04 18:45:53,840 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 34 [2018-02-04 18:45:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:53,840 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2018-02-04 18:45:53,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:45:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2018-02-04 18:45:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 18:45:53,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:53,841 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:53,841 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash -521175964, now seen corresponding path program 1 times [2018-02-04 18:45:53,841 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:53,841 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:53,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:53,842 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:53,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:53,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:53,855 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:45:53,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:53,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:53,856 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:53,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:53,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:45:53,898 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 18:45:53,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:45:53,909 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 18:45:53,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-02-04 18:45:53,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 18:45:53,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:53,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 18:45:53,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,938 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 21 treesize of output 16 [2018-02-04 18:45:53,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:53,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 18:45:53,941 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,943 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,948 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-02-04 18:45:53,958 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 36 treesize of output 29 [2018-02-04 18:45:53,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:53,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:53,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:53,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 18:45:53,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,975 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 36 treesize of output 29 [2018-02-04 18:45:53,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:53,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:53,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:45:53,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 18:45:53,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:53,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2018-02-04 18:45:54,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-02-04 18:45:54,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-02-04 18:45:54,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:54,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:54,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-02-04 18:45:54,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-02-04 18:45:54,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:54,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:54,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:54,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2018-02-04 18:45:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:45:54,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:45:54,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 18:45:54,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:45:54,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:45:54,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:45:54,089 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand 10 states. [2018-02-04 18:45:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:54,452 INFO L93 Difference]: Finished difference Result 276 states and 340 transitions. [2018-02-04 18:45:54,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 18:45:54,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-04 18:45:54,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:54,453 INFO L225 Difference]: With dead ends: 276 [2018-02-04 18:45:54,453 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 18:45:54,453 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:45:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 18:45:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 198. [2018-02-04 18:45:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 18:45:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2018-02-04 18:45:54,456 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 38 [2018-02-04 18:45:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:54,456 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2018-02-04 18:45:54,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:45:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2018-02-04 18:45:54,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 18:45:54,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:54,456 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:54,456 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:54,457 INFO L82 PathProgramCache]: Analyzing trace with hash -47566885, now seen corresponding path program 1 times [2018-02-04 18:45:54,457 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:54,457 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:54,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:54,457 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:54,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:54,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:45:54,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:54,506 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:54,507 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:54,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:45:54,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:45:54,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-02-04 18:45:54,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:45:54,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:45:54,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:45:54,520 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand 5 states. [2018-02-04 18:45:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:54,535 INFO L93 Difference]: Finished difference Result 253 states and 312 transitions. [2018-02-04 18:45:54,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:45:54,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 18:45:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:54,536 INFO L225 Difference]: With dead ends: 253 [2018-02-04 18:45:54,536 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 18:45:54,536 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:45:54,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 18:45:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2018-02-04 18:45:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 18:45:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 310 transitions. [2018-02-04 18:45:54,539 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 310 transitions. Word has length 41 [2018-02-04 18:45:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:54,539 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 310 transitions. [2018-02-04 18:45:54,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:45:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 310 transitions. [2018-02-04 18:45:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 18:45:54,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:54,540 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:54,540 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:54,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1474573890, now seen corresponding path program 1 times [2018-02-04 18:45:54,540 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:54,540 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:54,540 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:54,540 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:54,541 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:54,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:54,550 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:45:54,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:54,550 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:54,551 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:54,570 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:54,659 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~x~1.base 0)) (= 0 (select |c_old(#valid)| main_~x~1.base)) (not (= 0 main_~x~1.base)))) is different from true [2018-02-04 18:45:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 18:45:54,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:45:54,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 18:45:54,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:45:54,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:45:54,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=57, Unknown=1, NotChecked=14, Total=90 [2018-02-04 18:45:54,668 INFO L87 Difference]: Start difference. First operand 238 states and 310 transitions. Second operand 10 states. [2018-02-04 18:45:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:54,973 INFO L93 Difference]: Finished difference Result 243 states and 314 transitions. [2018-02-04 18:45:54,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:45:54,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 18:45:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:54,976 INFO L225 Difference]: With dead ends: 243 [2018-02-04 18:45:54,976 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 18:45:54,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=170, Unknown=2, NotChecked=28, Total=272 [2018-02-04 18:45:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 18:45:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-02-04 18:45:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-04 18:45:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 300 transitions. [2018-02-04 18:45:54,981 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 300 transitions. Word has length 42 [2018-02-04 18:45:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:54,981 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 300 transitions. [2018-02-04 18:45:54,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:45:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2018-02-04 18:45:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 18:45:54,982 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:54,982 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:54,982 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:54,982 INFO L82 PathProgramCache]: Analyzing trace with hash 924240911, now seen corresponding path program 1 times [2018-02-04 18:45:54,982 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:54,982 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:54,984 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:54,984 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:54,984 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:54,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:55,001 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:45:55,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:55,001 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:55,002 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:55,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:55,029 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 18:45:55,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:55,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:55,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:45:55,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:45:55,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:55,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:45:55,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 18:45:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:45:55,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:45:55,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 18:45:55,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:45:55,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:45:55,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:45:55,062 INFO L87 Difference]: Start difference. First operand 229 states and 300 transitions. Second operand 5 states. [2018-02-04 18:45:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:55,177 INFO L93 Difference]: Finished difference Result 252 states and 325 transitions. [2018-02-04 18:45:55,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:45:55,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-04 18:45:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:55,179 INFO L225 Difference]: With dead ends: 252 [2018-02-04 18:45:55,179 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 18:45:55,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:45:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 18:45:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 228. [2018-02-04 18:45:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 18:45:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 298 transitions. [2018-02-04 18:45:55,184 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 298 transitions. Word has length 45 [2018-02-04 18:45:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:55,184 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 298 transitions. [2018-02-04 18:45:55,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:45:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 298 transitions. [2018-02-04 18:45:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 18:45:55,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:55,185 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:55,185 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:55,185 INFO L82 PathProgramCache]: Analyzing trace with hash 924240912, now seen corresponding path program 1 times [2018-02-04 18:45:55,185 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:55,186 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:55,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:55,186 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:55,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:55,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:45:55,201 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:45:55,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:45:55,201 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:55,202 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:45:55,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:45:55,224 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 18:45:55,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:55,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:45:55,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:45:55,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:45:55,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:45:55,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:45:55,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 18:45:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:45:55,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:45:55,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 18:45:55,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:45:55,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:45:55,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:45:55,262 INFO L87 Difference]: Start difference. First operand 228 states and 298 transitions. Second operand 5 states. [2018-02-04 18:45:55,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:45:55,377 INFO L93 Difference]: Finished difference Result 293 states and 377 transitions. [2018-02-04 18:45:55,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:45:55,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-04 18:45:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:45:55,378 INFO L225 Difference]: With dead ends: 293 [2018-02-04 18:45:55,378 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 18:45:55,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:45:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 18:45:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 251. [2018-02-04 18:45:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-04 18:45:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 326 transitions. [2018-02-04 18:45:55,384 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 326 transitions. Word has length 45 [2018-02-04 18:45:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:45:55,384 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 326 transitions. [2018-02-04 18:45:55,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:45:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 326 transitions. [2018-02-04 18:45:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 18:45:55,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:45:55,385 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:45:55,386 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 18:45:55,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2048623147, now seen corresponding path program 1 times [2018-02-04 18:45:55,386 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:45:55,386 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:45:55,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:55,387 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:55,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:45:55,395 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 18:45:55,395 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 18:45:55,395 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:45:55,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:45:55,408 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 18:45:55,409 INFO L293 seRefinementStrategy]: Strategy SmtInterpolRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-02-04 18:45:55,409 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 18:45:55,422 WARN L188 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-02-04 18:45:55,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:45:55 BoogieIcfgContainer [2018-02-04 18:45:55,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:45:55,424 INFO L168 Benchmark]: Toolchain (without parser) took 6257.85 ms. Allocated memory was 407.4 MB in the beginning and 723.0 MB in the end (delta: 315.6 MB). Free memory was 361.4 MB in the beginning and 476.0 MB in the end (delta: -114.6 MB). Peak memory consumption was 201.0 MB. Max. memory is 5.3 GB. [2018-02-04 18:45:55,425 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 407.4 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:45:55,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.05 ms. Allocated memory is still 407.4 MB. Free memory was 361.4 MB in the beginning and 350.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:45:55,425 INFO L168 Benchmark]: Boogie Preprocessor took 30.60 ms. Allocated memory is still 407.4 MB. Free memory was 350.8 MB in the beginning and 348.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:45:55,425 INFO L168 Benchmark]: RCFGBuilder took 350.52 ms. Allocated memory is still 407.4 MB. Free memory was 348.2 MB in the beginning and 316.4 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. [2018-02-04 18:45:55,425 INFO L168 Benchmark]: TraceAbstraction took 5710.61 ms. Allocated memory was 407.4 MB in the beginning and 723.0 MB in the end (delta: 315.6 MB). Free memory was 316.4 MB in the beginning and 476.0 MB in the end (delta: -159.7 MB). Peak memory consumption was 156.0 MB. Max. memory is 5.3 GB. [2018-02-04 18:45:55,427 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.17 ms. Allocated memory is still 407.4 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 162.05 ms. Allocated memory is still 407.4 MB. Free memory was 361.4 MB in the beginning and 350.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.60 ms. Allocated memory is still 407.4 MB. Free memory was 350.8 MB in the beginning and 348.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 350.52 ms. Allocated memory is still 407.4 MB. Free memory was 348.2 MB in the beginning and 316.4 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5710.61 ms. Allocated memory was 407.4 MB in the beginning and 723.0 MB in the end (delta: 315.6 MB). Free memory was 316.4 MB in the beginning and 476.0 MB in the end (delta: -159.7 MB). Peak memory consumption was 156.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y [L653] FCALL y->prev = &x->head [L654] FCALL y->data = c2*c1 [L655] FCALL x->head.next = y [L656] y = ((void *)0) [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 101 locations, 41 error locations. UNKNOWN Result, 5.6s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1746 SDtfs, 2835 SDslu, 3024 SDs, 0 SdLazy, 2197 SolverSat, 140 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 315 SyntacticMatches, 4 SemanticMatches, 119 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=21, 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.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 732 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 945 NumberOfCodeBlocks, 945 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 663 ConstructedInterpolants, 17 QuantifiedInterpolants, 146649 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1479 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 40/86 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-45-55-433.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-45-55-433.csv Received shutdown request...