java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:54:48,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:54:48,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:54:48,962 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:54:48,963 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:54:48,963 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:54:48,964 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:54:48,966 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:54:48,967 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:54:48,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:54:48,968 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:54:48,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:54:48,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:54:48,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:54:48,970 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:54:48,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:54:48,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:54:48,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:54:48,975 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:54:48,976 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:54:48,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:54:48,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:54:48,978 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:54:48,979 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:54:48,979 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:54:48,980 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:54:48,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:54:48,981 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:54:48,981 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:54:48,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:54:48,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:54:48,982 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:54:48,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:54:48,991 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:54:48,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:54:48,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:54:48,992 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:54:48,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:54:48,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:54:48,992 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:54:48,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:54:48,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:54:48,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:54:48,993 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:54:48,993 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:54:48,993 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:54:48,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:54:48,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:54:48,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:54:48,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:54:48,993 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:54:48,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:54:48,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:54:48,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:54:48,994 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:54:48,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:54:48,994 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:54:49,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:54:49,030 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:54:49,032 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:54:49,033 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:54:49,034 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:54:49,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-02-02 18:54:49,164 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:54:49,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:54:49,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:54:49,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:54:49,169 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:54:49,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:54:49" (1/1) ... [2018-02-02 18:54:49,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679e69c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:54:49, skipping insertion in model container [2018-02-02 18:54:49,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:54:49" (1/1) ... [2018-02-02 18:54:49,182 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:54:49,209 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:54:49,300 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:54:49,317 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:54:49,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:54:49 WrapperNode [2018-02-02 18:54:49,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:54:49,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:54:49,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:54:49,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:54:49,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:54:49" (1/1) ... [2018-02-02 18:54:49,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:54:49" (1/1) ... [2018-02-02 18:54:49,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:54:49" (1/1) ... [2018-02-02 18:54:49,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:54:49" (1/1) ... [2018-02-02 18:54:49,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:54:49" (1/1) ... [2018-02-02 18:54:49,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:54:49" (1/1) ... [2018-02-02 18:54:49,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:54:49" (1/1) ... [2018-02-02 18:54:49,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:54:49,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:54:49,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:54:49,353 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:54:49,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:54: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-02 18:54:49,388 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:54:49,388 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:54:49,388 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:54:49,388 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:54:49,388 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:54:49,388 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:54:49,389 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:54:49,389 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:54:49,389 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:54:49,389 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:54:49,389 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:54:49,389 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:54:49,389 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:54:49,389 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:54:49,765 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:54:49,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:54:49 BoogieIcfgContainer [2018-02-02 18:54:49,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:54:49,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:54:49,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:54:49,769 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:54:49,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:54:49" (1/3) ... [2018-02-02 18:54:49,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9de78c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:54:49, skipping insertion in model container [2018-02-02 18:54:49,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:54:49" (2/3) ... [2018-02-02 18:54:49,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9de78c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:54:49, skipping insertion in model container [2018-02-02 18:54:49,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:54:49" (3/3) ... [2018-02-02 18:54:49,771 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2018-02-02 18:54:49,776 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:54:49,781 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-02-02 18:54:49,803 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:54:49,803 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:54:49,803 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:54:49,803 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:54:49,803 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:54:49,803 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:54:49,803 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:54:49,804 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:54:49,804 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:54:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-02-02 18:54:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 18:54:49,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:49,824 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:49,824 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:49,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1338247859, now seen corresponding path program 1 times [2018-02-02 18:54:49,828 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:49,828 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:49,857 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:49,857 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:49,858 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:49,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:49,934 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-02 18:54:49,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:49,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:49,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:49,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:49,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:49,946 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 4 states. [2018-02-02 18:54:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:50,161 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2018-02-02 18:54:50,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:54:50,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 18:54:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:50,169 INFO L225 Difference]: With dead ends: 162 [2018-02-02 18:54:50,169 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 18:54:50,171 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-02 18:54:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 18:54:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 142. [2018-02-02 18:54:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 18:54:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-02-02 18:54:50,198 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 8 [2018-02-02 18:54:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:50,198 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-02-02 18:54:50,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-02-02 18:54:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 18:54:50,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:50,198 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:50,199 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:50,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1338247858, now seen corresponding path program 1 times [2018-02-02 18:54:50,199 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:50,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:50,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:50,200 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:50,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:50,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:50,251 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-02 18:54:50,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:50,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:50,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:50,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:50,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:50,253 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 4 states. [2018-02-02 18:54:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:50,363 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-02-02 18:54:50,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:54:50,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 18:54:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:50,364 INFO L225 Difference]: With dead ends: 140 [2018-02-02 18:54:50,364 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 18:54:50,365 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-02 18:54:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 18:54:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-02-02 18:54:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 18:54:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-02-02 18:54:50,373 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 8 [2018-02-02 18:54:50,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:50,374 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-02-02 18:54:50,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-02-02 18:54:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 18:54:50,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:50,375 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:50,375 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:50,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1963213562, now seen corresponding path program 1 times [2018-02-02 18:54:50,375 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:50,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:50,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:50,376 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:50,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:50,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:50,411 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-02 18:54:50,411 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:50,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:50,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:50,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:50,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:50,412 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 4 states. [2018-02-02 18:54:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:50,518 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-02-02 18:54:50,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:54:50,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 18:54:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:50,519 INFO L225 Difference]: With dead ends: 148 [2018-02-02 18:54:50,519 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 18:54:50,520 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-02 18:54:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 18:54:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2018-02-02 18:54:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 18:54:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2018-02-02 18:54:50,523 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 14 [2018-02-02 18:54:50,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:50,523 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2018-02-02 18:54:50,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:50,523 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2018-02-02 18:54:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 18:54:50,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:50,524 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:50,524 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:50,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1963213563, now seen corresponding path program 1 times [2018-02-02 18:54:50,524 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:50,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:50,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:50,525 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:50,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:50,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:50,575 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-02 18:54:50,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:50,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:54:50,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:54:50,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:54:50,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:50,576 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand 5 states. [2018-02-02 18:54:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:50,706 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2018-02-02 18:54:50,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:54:50,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 18:54:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:50,708 INFO L225 Difference]: With dead ends: 173 [2018-02-02 18:54:50,708 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 18:54:50,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:54:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 18:54:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2018-02-02 18:54:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 18:54:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-02-02 18:54:50,715 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 14 [2018-02-02 18:54:50,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:50,715 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-02-02 18:54:50,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:54:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-02-02 18:54:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:54:50,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:50,715 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:50,715 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:50,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1159097560, now seen corresponding path program 1 times [2018-02-02 18:54:50,716 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:50,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:50,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:50,716 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:50,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:50,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:50,740 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-02 18:54:50,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:50,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:50,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:50,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:50,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:50,740 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 4 states. [2018-02-02 18:54:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:50,822 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2018-02-02 18:54:50,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:54:50,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 18:54:50,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:50,824 INFO L225 Difference]: With dead ends: 170 [2018-02-02 18:54:50,824 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 18:54:50,824 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-02 18:54:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 18:54:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2018-02-02 18:54:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 18:54:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2018-02-02 18:54:50,830 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 16 [2018-02-02 18:54:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:50,831 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2018-02-02 18:54:50,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2018-02-02 18:54:50,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:54:50,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:50,831 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:50,832 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:50,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1159097561, now seen corresponding path program 1 times [2018-02-02 18:54:50,832 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:50,832 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:50,833 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:50,833 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:50,833 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:50,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:50,886 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-02 18:54:50,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:50,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:50,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:50,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:50,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:50,887 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand 4 states. [2018-02-02 18:54:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:50,964 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2018-02-02 18:54:50,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:54:50,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 18:54:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:50,965 INFO L225 Difference]: With dead ends: 160 [2018-02-02 18:54:50,965 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 18:54:50,965 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-02 18:54:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 18:54:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-02-02 18:54:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 18:54:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2018-02-02 18:54:50,970 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 16 [2018-02-02 18:54:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:50,971 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2018-02-02 18:54:50,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2018-02-02 18:54:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 18:54:50,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:50,971 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] [2018-02-02 18:54:50,971 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:50,971 INFO L82 PathProgramCache]: Analyzing trace with hash 990226269, now seen corresponding path program 1 times [2018-02-02 18:54:50,972 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:50,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:50,972 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:50,972 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:50,972 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:50,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:51,003 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-02 18:54:51,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:51,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:54:51,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:51,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:51,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:51,004 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 4 states. [2018-02-02 18:54:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:51,032 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2018-02-02 18:54:51,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:54:51,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-02 18:54:51,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:51,033 INFO L225 Difference]: With dead ends: 157 [2018-02-02 18:54:51,033 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 18:54:51,033 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-02 18:54:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 18:54:51,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-02-02 18:54:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 18:54:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2018-02-02 18:54:51,038 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 21 [2018-02-02 18:54:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:51,038 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2018-02-02 18:54:51,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2018-02-02 18:54:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 18:54:51,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:51,039 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:51,039 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash 632244512, now seen corresponding path program 1 times [2018-02-02 18:54:51,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:51,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:51,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:51,040 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:51,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:51,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:51,081 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-02 18:54:51,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:51,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:54:51,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:54:51,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:54:51,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:51,082 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand 5 states. [2018-02-02 18:54:51,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:51,182 INFO L93 Difference]: Finished difference Result 171 states and 195 transitions. [2018-02-02 18:54:51,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:54:51,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 18:54:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:51,182 INFO L225 Difference]: With dead ends: 171 [2018-02-02 18:54:51,182 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 18:54:51,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:54:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 18:54:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2018-02-02 18:54:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 18:54:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 179 transitions. [2018-02-02 18:54:51,189 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 179 transitions. Word has length 22 [2018-02-02 18:54:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:51,190 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 179 transitions. [2018-02-02 18:54:51,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:54:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 179 transitions. [2018-02-02 18:54:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 18:54:51,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:51,191 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:51,191 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:51,191 INFO L82 PathProgramCache]: Analyzing trace with hash 632244513, now seen corresponding path program 1 times [2018-02-02 18:54:51,191 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:51,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:51,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:51,192 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:51,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:51,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:54:51,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:51,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:54:51,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:54:51,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:54:51,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:51,296 INFO L87 Difference]: Start difference. First operand 155 states and 179 transitions. Second operand 5 states. [2018-02-02 18:54:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:51,438 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2018-02-02 18:54:51,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:54:51,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 18:54:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:51,440 INFO L225 Difference]: With dead ends: 175 [2018-02-02 18:54:51,440 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 18:54:51,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:54:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 18:54:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 157. [2018-02-02 18:54:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 18:54:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-02-02 18:54:51,443 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 22 [2018-02-02 18:54:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:51,443 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-02-02 18:54:51,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:54:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-02-02 18:54:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 18:54:51,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:51,444 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:51,444 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:51,444 INFO L82 PathProgramCache]: Analyzing trace with hash -733762389, now seen corresponding path program 1 times [2018-02-02 18:54:51,444 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:51,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:51,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:51,445 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:51,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:51,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:54:51,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:51,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:51,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:54:51,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:54:51,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:54:51,467 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 3 states. [2018-02-02 18:54:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:51,474 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2018-02-02 18:54:51,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:54:51,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-02 18:54:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:51,476 INFO L225 Difference]: With dead ends: 159 [2018-02-02 18:54:51,476 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 18:54:51,476 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-02 18:54:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 18:54:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-02-02 18:54:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 18:54:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 182 transitions. [2018-02-02 18:54:51,479 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 182 transitions. Word has length 22 [2018-02-02 18:54:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:51,480 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 182 transitions. [2018-02-02 18:54:51,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:54:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2018-02-02 18:54:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 18:54:51,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:51,480 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:51,481 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:51,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1797349272, now seen corresponding path program 1 times [2018-02-02 18:54:51,481 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:51,481 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:51,482 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:51,482 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:51,482 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:51,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:54:51,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:51,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:54:51,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:54:51,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:54:51,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:54:51,571 INFO L87 Difference]: Start difference. First operand 159 states and 182 transitions. Second operand 6 states. [2018-02-02 18:54:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:51,740 INFO L93 Difference]: Finished difference Result 202 states and 232 transitions. [2018-02-02 18:54:51,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:54:51,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 18:54:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:51,742 INFO L225 Difference]: With dead ends: 202 [2018-02-02 18:54:51,742 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 18:54:51,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:54:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 18:54:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 175. [2018-02-02 18:54:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 18:54:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2018-02-02 18:54:51,746 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 24 [2018-02-02 18:54:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:51,746 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2018-02-02 18:54:51,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:54:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2018-02-02 18:54:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 18:54:51,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:51,747 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] [2018-02-02 18:54:51,747 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:51,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1764795143, now seen corresponding path program 1 times [2018-02-02 18:54:51,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:51,748 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:51,748 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:51,748 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:51,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:51,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:51,967 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-02 18:54:51,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:51,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 18:54:51,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:54:51,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:54:51,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:54:51,968 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand 12 states. [2018-02-02 18:54:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:52,540 INFO L93 Difference]: Finished difference Result 191 states and 222 transitions. [2018-02-02 18:54:52,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:54:52,540 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-02-02 18:54:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:52,541 INFO L225 Difference]: With dead ends: 191 [2018-02-02 18:54:52,541 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 18:54:52,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-02-02 18:54:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 18:54:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2018-02-02 18:54:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 18:54:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 205 transitions. [2018-02-02 18:54:52,544 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 205 transitions. Word has length 25 [2018-02-02 18:54:52,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:52,547 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 205 transitions. [2018-02-02 18:54:52,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:54:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 205 transitions. [2018-02-02 18:54:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 18:54:52,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:52,547 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] [2018-02-02 18:54:52,547 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:52,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1764795144, now seen corresponding path program 1 times [2018-02-02 18:54:52,548 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:52,548 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:52,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:52,548 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:52,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:52,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:52,805 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-02 18:54:52,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:52,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 18:54:52,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:54:52,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:54:52,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:54:52,807 INFO L87 Difference]: Start difference. First operand 176 states and 205 transitions. Second operand 11 states. [2018-02-02 18:54:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:53,375 INFO L93 Difference]: Finished difference Result 240 states and 267 transitions. [2018-02-02 18:54:53,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:54:53,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-02 18:54:53,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:53,377 INFO L225 Difference]: With dead ends: 240 [2018-02-02 18:54:53,377 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 18:54:53,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2018-02-02 18:54:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 18:54:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 192. [2018-02-02 18:54:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 18:54:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 228 transitions. [2018-02-02 18:54:53,382 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 228 transitions. Word has length 25 [2018-02-02 18:54:53,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:53,382 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 228 transitions. [2018-02-02 18:54:53,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:54:53,382 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 228 transitions. [2018-02-02 18:54:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 18:54:53,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:53,383 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] [2018-02-02 18:54:53,383 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:53,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2572345, now seen corresponding path program 1 times [2018-02-02 18:54:53,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:53,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:53,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:53,384 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:53,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:53,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:53,417 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-02 18:54:53,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:53,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:54:53,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:54:53,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:54:53,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:53,418 INFO L87 Difference]: Start difference. First operand 192 states and 228 transitions. Second operand 5 states. [2018-02-02 18:54:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:53,560 INFO L93 Difference]: Finished difference Result 276 states and 328 transitions. [2018-02-02 18:54:53,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:54:53,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 18:54:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:53,561 INFO L225 Difference]: With dead ends: 276 [2018-02-02 18:54:53,561 INFO L226 Difference]: Without dead ends: 276 [2018-02-02 18:54:53,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:54:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-02 18:54:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 191. [2018-02-02 18:54:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 18:54:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 226 transitions. [2018-02-02 18:54:53,564 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 226 transitions. Word has length 25 [2018-02-02 18:54:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:53,564 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 226 transitions. [2018-02-02 18:54:53,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:54:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 226 transitions. [2018-02-02 18:54:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 18:54:53,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:53,565 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] [2018-02-02 18:54:53,565 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2572346, now seen corresponding path program 1 times [2018-02-02 18:54:53,565 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:53,565 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:53,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:53,566 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:53,566 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:53,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:53,628 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-02 18:54:53,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:53,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:54:53,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:54:53,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:54:53,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:53,629 INFO L87 Difference]: Start difference. First operand 191 states and 226 transitions. Second operand 5 states. [2018-02-02 18:54:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:53,922 INFO L93 Difference]: Finished difference Result 336 states and 397 transitions. [2018-02-02 18:54:53,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:54:53,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 18:54:53,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:53,923 INFO L225 Difference]: With dead ends: 336 [2018-02-02 18:54:53,923 INFO L226 Difference]: Without dead ends: 336 [2018-02-02 18:54:53,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:54:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-02 18:54:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 190. [2018-02-02 18:54:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 18:54:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 224 transitions. [2018-02-02 18:54:53,928 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 224 transitions. Word has length 25 [2018-02-02 18:54:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:53,928 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 224 transitions. [2018-02-02 18:54:53,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:54:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 224 transitions. [2018-02-02 18:54:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 18:54:53,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:53,929 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-02 18:54:53,929 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:53,929 INFO L82 PathProgramCache]: Analyzing trace with hash -676623804, now seen corresponding path program 1 times [2018-02-02 18:54:53,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:53,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:53,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:53,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:53,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:53,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:54,003 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-02 18:54:54,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:54,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:54:54,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:54:54,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:54:54,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:54:54,004 INFO L87 Difference]: Start difference. First operand 190 states and 224 transitions. Second operand 9 states. [2018-02-02 18:54:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:54,277 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2018-02-02 18:54:54,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:54:54,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 18:54:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:54,278 INFO L225 Difference]: With dead ends: 227 [2018-02-02 18:54:54,278 INFO L226 Difference]: Without dead ends: 227 [2018-02-02 18:54:54,279 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:54:54,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-02 18:54:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 189. [2018-02-02 18:54:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 18:54:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 222 transitions. [2018-02-02 18:54:54,283 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 222 transitions. Word has length 28 [2018-02-02 18:54:54,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:54,284 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 222 transitions. [2018-02-02 18:54:54,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:54:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 222 transitions. [2018-02-02 18:54:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 18:54:54,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:54,285 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-02 18:54:54,285 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:54,285 INFO L82 PathProgramCache]: Analyzing trace with hash -676623803, now seen corresponding path program 1 times [2018-02-02 18:54:54,285 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:54,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:54,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:54,286 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:54,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:54,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:54,394 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-02 18:54:54,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:54,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:54:54,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:54:54,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:54:54,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:54:54,395 INFO L87 Difference]: Start difference. First operand 189 states and 222 transitions. Second operand 9 states. [2018-02-02 18:54:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:54,694 INFO L93 Difference]: Finished difference Result 226 states and 266 transitions. [2018-02-02 18:54:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:54:54,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 18:54:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:54,695 INFO L225 Difference]: With dead ends: 226 [2018-02-02 18:54:54,695 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 18:54:54,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:54:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 18:54:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 188. [2018-02-02 18:54:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 18:54:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2018-02-02 18:54:54,699 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 28 [2018-02-02 18:54:54,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:54,699 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2018-02-02 18:54:54,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:54:54,699 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2018-02-02 18:54:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 18:54:54,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:54,700 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] [2018-02-02 18:54:54,700 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:54,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1254885066, now seen corresponding path program 1 times [2018-02-02 18:54:54,700 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:54,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:54,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:54,701 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:54,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:54,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:54,746 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-02 18:54:54,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:54,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:54,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:54,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:54,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:54,747 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand 4 states. [2018-02-02 18:54:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:54,895 INFO L93 Difference]: Finished difference Result 243 states and 280 transitions. [2018-02-02 18:54:54,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:54:54,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 18:54:54,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:54,897 INFO L225 Difference]: With dead ends: 243 [2018-02-02 18:54:54,897 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 18:54:54,897 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-02 18:54:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 18:54:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 186. [2018-02-02 18:54:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 18:54:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 216 transitions. [2018-02-02 18:54:54,901 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 216 transitions. Word has length 29 [2018-02-02 18:54:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:54,901 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 216 transitions. [2018-02-02 18:54:54,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 216 transitions. [2018-02-02 18:54:54,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 18:54:54,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:54,902 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] [2018-02-02 18:54:54,902 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1254885065, now seen corresponding path program 1 times [2018-02-02 18:54:54,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:54,903 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:54,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:54,903 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:54,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:54,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:54,928 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-02 18:54:54,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:54,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:54,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:54,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:54,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:54,930 INFO L87 Difference]: Start difference. First operand 186 states and 216 transitions. Second operand 4 states. [2018-02-02 18:54:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:55,052 INFO L93 Difference]: Finished difference Result 212 states and 246 transitions. [2018-02-02 18:54:55,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:54:55,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 18:54:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:55,054 INFO L225 Difference]: With dead ends: 212 [2018-02-02 18:54:55,054 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 18:54:55,054 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-02 18:54:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 18:54:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2018-02-02 18:54:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 18:54:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 214 transitions. [2018-02-02 18:54:55,057 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 214 transitions. Word has length 29 [2018-02-02 18:54:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:55,058 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 214 transitions. [2018-02-02 18:54:55,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2018-02-02 18:54:55,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 18:54:55,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:55,058 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] [2018-02-02 18:54:55,058 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:55,059 INFO L82 PathProgramCache]: Analyzing trace with hash 570395414, now seen corresponding path program 1 times [2018-02-02 18:54:55,059 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:55,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:55,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:55,060 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:55,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:55,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:55,088 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-02 18:54:55,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:55,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:54:55,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:54:55,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:54:55,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:55,089 INFO L87 Difference]: Start difference. First operand 185 states and 214 transitions. Second operand 5 states. [2018-02-02 18:54:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:55,274 INFO L93 Difference]: Finished difference Result 267 states and 310 transitions. [2018-02-02 18:54:55,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:54:55,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 18:54:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:55,276 INFO L225 Difference]: With dead ends: 267 [2018-02-02 18:54:55,276 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 18:54:55,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:54:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 18:54:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 184. [2018-02-02 18:54:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 18:54:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2018-02-02 18:54:55,280 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 29 [2018-02-02 18:54:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:55,280 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2018-02-02 18:54:55,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:54:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2018-02-02 18:54:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 18:54:55,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:55,281 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] [2018-02-02 18:54:55,281 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:55,281 INFO L82 PathProgramCache]: Analyzing trace with hash 570395415, now seen corresponding path program 1 times [2018-02-02 18:54:55,281 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:55,281 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:55,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:55,282 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:55,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:55,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:55,326 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-02 18:54:55,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:55,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:54:55,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:54:55,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:54:55,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:55,327 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand 5 states. [2018-02-02 18:54:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:55,729 INFO L93 Difference]: Finished difference Result 324 states and 373 transitions. [2018-02-02 18:54:55,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:54:55,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 18:54:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:55,730 INFO L225 Difference]: With dead ends: 324 [2018-02-02 18:54:55,730 INFO L226 Difference]: Without dead ends: 324 [2018-02-02 18:54:55,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:54:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-02-02 18:54:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 183. [2018-02-02 18:54:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 18:54:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2018-02-02 18:54:55,734 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 29 [2018-02-02 18:54:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:55,734 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2018-02-02 18:54:55,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:54:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2018-02-02 18:54:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 18:54:55,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:55,734 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-02 18:54:55,735 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:55,735 INFO L82 PathProgramCache]: Analyzing trace with hash -526012245, now seen corresponding path program 1 times [2018-02-02 18:54:55,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:55,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:55,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:55,736 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:55,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:55,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:55,758 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-02 18:54:55,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:55,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:55,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:55,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:55,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:55,759 INFO L87 Difference]: Start difference. First operand 183 states and 210 transitions. Second operand 4 states. [2018-02-02 18:54:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:55,877 INFO L93 Difference]: Finished difference Result 197 states and 225 transitions. [2018-02-02 18:54:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:54:55,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-02 18:54:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:55,880 INFO L225 Difference]: With dead ends: 197 [2018-02-02 18:54:55,880 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 18:54:55,880 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-02 18:54:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 18:54:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2018-02-02 18:54:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 18:54:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2018-02-02 18:54:55,884 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 31 [2018-02-02 18:54:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:55,884 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2018-02-02 18:54:55,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2018-02-02 18:54:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 18:54:55,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:55,885 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-02 18:54:55,885 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:55,885 INFO L82 PathProgramCache]: Analyzing trace with hash -526012244, now seen corresponding path program 1 times [2018-02-02 18:54:55,885 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:55,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:55,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:55,886 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:55,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:55,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:55,920 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-02 18:54:55,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:55,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:55,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:55,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:55,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:55,921 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand 4 states. [2018-02-02 18:54:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:56,128 INFO L93 Difference]: Finished difference Result 220 states and 246 transitions. [2018-02-02 18:54:56,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:54:56,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-02 18:54:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:56,129 INFO L225 Difference]: With dead ends: 220 [2018-02-02 18:54:56,129 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 18:54:56,129 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-02 18:54:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 18:54:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 180. [2018-02-02 18:54:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 18:54:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 204 transitions. [2018-02-02 18:54:56,131 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 204 transitions. Word has length 31 [2018-02-02 18:54:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:56,132 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 204 transitions. [2018-02-02 18:54:56,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 204 transitions. [2018-02-02 18:54:56,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:54:56,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:56,132 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:56,132 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:56,132 INFO L82 PathProgramCache]: Analyzing trace with hash 886820396, now seen corresponding path program 1 times [2018-02-02 18:54:56,132 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:56,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:56,133 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:56,133 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:56,133 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:56,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:54:56,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:54:56,189 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:54:56,201 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:56,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:54:56,281 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-02 18:54:56,285 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-02 18:54:56,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,294 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-02 18:54:56,300 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-02 18:54:56,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,306 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-02-02 18:54:56,316 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 26 treesize of output 21 [2018-02-02 18:54:56,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:54:56,328 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-02 18:54:56,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,354 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 26 treesize of output 21 [2018-02-02 18:54:56,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:54:56,362 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-02 18:54:56,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,376 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-02-02 18:54:56,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-02 18:54:56,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-02 18:54:56,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-02 18:54:56,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-02 18:54:56,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:54:56,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-02-02 18:54:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:54:56,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:54:56,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-02 18:54:56,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:54:56,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:54:56,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:56,465 INFO L87 Difference]: Start difference. First operand 180 states and 204 transitions. Second operand 5 states. [2018-02-02 18:54:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:56,551 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2018-02-02 18:54:56,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:54:56,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-02 18:54:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:56,553 INFO L225 Difference]: With dead ends: 191 [2018-02-02 18:54:56,553 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 18:54:56,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:54:56,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 18:54:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2018-02-02 18:54:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 18:54:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 210 transitions. [2018-02-02 18:54:56,557 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 210 transitions. Word has length 32 [2018-02-02 18:54:56,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:56,557 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 210 transitions. [2018-02-02 18:54:56,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:54:56,557 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-02-02 18:54:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:54:56,558 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:56,558 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:56,558 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:56,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1759246890, now seen corresponding path program 1 times [2018-02-02 18:54:56,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:56,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:56,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:56,559 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:56,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:56,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:56,668 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-02 18:54:56,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:56,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:54:56,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:54:56,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:54:56,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:54:56,669 INFO L87 Difference]: Start difference. First operand 185 states and 210 transitions. Second operand 9 states. [2018-02-02 18:54:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:57,024 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2018-02-02 18:54:57,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:54:57,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 18:54:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:57,026 INFO L225 Difference]: With dead ends: 192 [2018-02-02 18:54:57,026 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 18:54:57,026 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:54:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 18:54:57,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2018-02-02 18:54:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 18:54:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 209 transitions. [2018-02-02 18:54:57,029 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 209 transitions. Word has length 32 [2018-02-02 18:54:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:57,029 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 209 transitions. [2018-02-02 18:54:57,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:54:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 209 transitions. [2018-02-02 18:54:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:54:57,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:57,030 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:57,030 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1759246889, now seen corresponding path program 1 times [2018-02-02 18:54:57,030 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:57,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:57,031 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:57,031 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:57,031 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:57,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:57,104 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-02 18:54:57,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:57,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:54:57,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:54:57,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:54:57,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:54:57,105 INFO L87 Difference]: Start difference. First operand 184 states and 209 transitions. Second operand 9 states. [2018-02-02 18:54:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:57,413 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2018-02-02 18:54:57,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:54:57,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 18:54:57,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:57,414 INFO L225 Difference]: With dead ends: 191 [2018-02-02 18:54:57,414 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 18:54:57,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:54:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 18:54:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2018-02-02 18:54:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 18:54:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2018-02-02 18:54:57,418 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 32 [2018-02-02 18:54:57,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:57,418 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2018-02-02 18:54:57,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:54:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-02-02 18:54:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 18:54:57,419 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:57,419 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:54:57,419 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:57,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1721628592, now seen corresponding path program 1 times [2018-02-02 18:54:57,419 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:57,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:57,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:57,420 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:57,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:57,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:54:57,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:54:57,894 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:54:57,902 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:57,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:54:58,054 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 13 treesize of output 10 [2018-02-02 18:54:58,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 18:54:58,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:54:58,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:54:58,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:54:58,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:57 [2018-02-02 18:54:58,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-02-02 18:54:58,185 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2018-02-02 18:54:58,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:54:58,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:54:58,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:54:58,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:72 [2018-02-02 18:54:58,417 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (main_~n~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~0.base 1))) (and (not (= 0 main_~n~0.base)) (= 0 (select .cse0 v_prenex_2)) (not (= v_prenex_2 0)) (= (select |c_old(#valid)| main_~n~0.base) 0) (= |c_#valid| (store (store .cse0 v_prenex_2 0) main_~n~0.base 0))))) is different from true [2018-02-02 18:54:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-02 18:54:58,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:54:58,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-02-02 18:54:58,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 18:54:58,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 18:54:58,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=4, NotChecked=48, Total=702 [2018-02-02 18:54:58,464 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 27 states. [2018-02-02 18:54:59,672 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 56 DAG size of output 51 [2018-02-02 18:55:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:55:00,155 INFO L93 Difference]: Finished difference Result 212 states and 239 transitions. [2018-02-02 18:55:00,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 18:55:00,155 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2018-02-02 18:55:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:55:00,156 INFO L225 Difference]: With dead ends: 212 [2018-02-02 18:55:00,156 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 18:55:00,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=217, Invalid=1417, Unknown=10, NotChecked=78, Total=1722 [2018-02-02 18:55:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 18:55:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2018-02-02 18:55:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 18:55:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 225 transitions. [2018-02-02 18:55:00,160 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 225 transitions. Word has length 33 [2018-02-02 18:55:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:55:00,160 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 225 transitions. [2018-02-02 18:55:00,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 18:55:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2018-02-02 18:55:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:55:00,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:55:00,161 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:55:00,161 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:55:00,161 INFO L82 PathProgramCache]: Analyzing trace with hash 583502853, now seen corresponding path program 1 times [2018-02-02 18:55:00,162 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:55:00,162 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:55:00,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:00,162 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:55:00,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:55:00,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:55:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:55:00,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:55:00,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:55:00,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:55:00,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:55:00,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:55:00,226 INFO L87 Difference]: Start difference. First operand 199 states and 225 transitions. Second operand 7 states. [2018-02-02 18:55:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:55:00,482 INFO L93 Difference]: Finished difference Result 217 states and 244 transitions. [2018-02-02 18:55:00,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:55:00,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-02 18:55:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:55:00,483 INFO L225 Difference]: With dead ends: 217 [2018-02-02 18:55:00,483 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 18:55:00,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:55:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 18:55:00,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 206. [2018-02-02 18:55:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 18:55:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2018-02-02 18:55:00,487 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 38 [2018-02-02 18:55:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:55:00,487 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2018-02-02 18:55:00,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:55:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2018-02-02 18:55:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:55:00,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:55:00,488 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:55:00,488 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:55:00,488 INFO L82 PathProgramCache]: Analyzing trace with hash 583502854, now seen corresponding path program 1 times [2018-02-02 18:55:00,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:55:00,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:55:00,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:00,489 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:55:00,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:55:00,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:55:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:55:00,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:55:00,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:55:00,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:55:00,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:55:00,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:55:00,552 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand 5 states. [2018-02-02 18:55:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:55:00,731 INFO L93 Difference]: Finished difference Result 262 states and 292 transitions. [2018-02-02 18:55:00,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:55:00,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 18:55:00,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:55:00,732 INFO L225 Difference]: With dead ends: 262 [2018-02-02 18:55:00,732 INFO L226 Difference]: Without dead ends: 262 [2018-02-02 18:55:00,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-02 18:55:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-02 18:55:00,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2018-02-02 18:55:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 18:55:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 236 transitions. [2018-02-02 18:55:00,736 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 236 transitions. Word has length 38 [2018-02-02 18:55:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:55:00,736 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 236 transitions. [2018-02-02 18:55:00,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:55:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 236 transitions. [2018-02-02 18:55:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:55:00,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:55:00,737 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:55:00,737 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:55:00,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1439020069, now seen corresponding path program 1 times [2018-02-02 18:55:00,737 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:55:00,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:55:00,738 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:00,738 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:55:00,738 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:55:00,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:55:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:55:00,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:55:00,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:55:00,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:55:00,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:55:00,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:55:00,793 INFO L87 Difference]: Start difference. First operand 208 states and 236 transitions. Second operand 7 states. [2018-02-02 18:55:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:55:01,043 INFO L93 Difference]: Finished difference Result 253 states and 283 transitions. [2018-02-02 18:55:01,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:55:01,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-02 18:55:01,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:55:01,044 INFO L225 Difference]: With dead ends: 253 [2018-02-02 18:55:01,044 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 18:55:01,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-02 18:55:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 18:55:01,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 216. [2018-02-02 18:55:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 18:55:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 250 transitions. [2018-02-02 18:55:01,047 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 250 transitions. Word has length 38 [2018-02-02 18:55:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:55:01,047 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 250 transitions. [2018-02-02 18:55:01,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:55:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 250 transitions. [2018-02-02 18:55:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:55:01,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:55:01,048 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:55:01,048 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:55:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1439020070, now seen corresponding path program 1 times [2018-02-02 18:55:01,048 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:55:01,048 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:55:01,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:01,049 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:55:01,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:55:01,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:55:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:55:01,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:55:01,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:55:01,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:55:01,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:55:01,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:55:01,103 INFO L87 Difference]: Start difference. First operand 216 states and 250 transitions. Second operand 5 states. [2018-02-02 18:55:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:55:01,284 INFO L93 Difference]: Finished difference Result 295 states and 330 transitions. [2018-02-02 18:55:01,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:55:01,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 18:55:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:55:01,285 INFO L225 Difference]: With dead ends: 295 [2018-02-02 18:55:01,285 INFO L226 Difference]: Without dead ends: 295 [2018-02-02 18:55:01,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:55:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-02 18:55:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 209. [2018-02-02 18:55:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 18:55:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2018-02-02 18:55:01,289 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 38 [2018-02-02 18:55:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:55:01,289 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2018-02-02 18:55:01,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:55:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2018-02-02 18:55:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 18:55:01,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:55:01,290 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:55:01,290 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:55:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash 908719351, now seen corresponding path program 1 times [2018-02-02 18:55:01,290 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:55:01,291 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:55:01,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:01,291 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:55:01,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:55:01,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:55:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:55:01,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:55:01,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:55:01,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:55:01,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:55:01,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:55:01,324 INFO L87 Difference]: Start difference. First operand 209 states and 239 transitions. Second operand 5 states. [2018-02-02 18:55:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:55:01,375 INFO L93 Difference]: Finished difference Result 279 states and 317 transitions. [2018-02-02 18:55:01,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:55:01,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-02 18:55:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:55:01,377 INFO L225 Difference]: With dead ends: 279 [2018-02-02 18:55:01,377 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 18:55:01,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-02 18:55:01,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 18:55:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 213. [2018-02-02 18:55:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 18:55:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 244 transitions. [2018-02-02 18:55:01,380 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 244 transitions. Word has length 39 [2018-02-02 18:55:01,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:55:01,381 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 244 transitions. [2018-02-02 18:55:01,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:55:01,381 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 244 transitions. [2018-02-02 18:55:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 18:55:01,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:55:01,381 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:55:01,381 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:55:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1659949271, now seen corresponding path program 1 times [2018-02-02 18:55:01,382 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:55:01,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:55:01,382 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:01,383 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:55:01,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:55:01,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:55:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:55:01,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:55:01,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:55:01,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:55:01,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:55:01,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:55:01,407 INFO L87 Difference]: Start difference. First operand 213 states and 244 transitions. Second operand 5 states. [2018-02-02 18:55:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:55:01,464 INFO L93 Difference]: Finished difference Result 292 states and 325 transitions. [2018-02-02 18:55:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:55:01,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-02 18:55:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:55:01,466 INFO L225 Difference]: With dead ends: 292 [2018-02-02 18:55:01,466 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 18:55:01,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:55:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 18:55:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 209. [2018-02-02 18:55:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 18:55:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 238 transitions. [2018-02-02 18:55:01,469 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 238 transitions. Word has length 39 [2018-02-02 18:55:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:55:01,470 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 238 transitions. [2018-02-02 18:55:01,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:55:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 238 transitions. [2018-02-02 18:55:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 18:55:01,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:55:01,471 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-02-02 18:55:01,471 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:55:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2011206561, now seen corresponding path program 1 times [2018-02-02 18:55:01,471 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:55:01,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:55:01,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:01,472 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:55:01,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:55:01,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:55:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:55:02,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:55:02,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-02 18:55:02,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 18:55:02,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 18:55:02,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 18:55:02,048 INFO L87 Difference]: Start difference. First operand 209 states and 238 transitions. Second operand 19 states. [2018-02-02 18:55:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:55:03,167 INFO L93 Difference]: Finished difference Result 243 states and 275 transitions. [2018-02-02 18:55:03,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 18:55:03,167 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-02-02 18:55:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:55:03,168 INFO L225 Difference]: With dead ends: 243 [2018-02-02 18:55:03,168 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 18:55:03,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=349, Invalid=1543, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 18:55:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 18:55:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 207. [2018-02-02 18:55:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 18:55:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 235 transitions. [2018-02-02 18:55:03,170 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 235 transitions. Word has length 43 [2018-02-02 18:55:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:55:03,170 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 235 transitions. [2018-02-02 18:55:03,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 18:55:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 235 transitions. [2018-02-02 18:55:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 18:55:03,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:55:03,171 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-02-02 18:55:03,171 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:55:03,171 INFO L82 PathProgramCache]: Analyzing trace with hash -334069887, now seen corresponding path program 1 times [2018-02-02 18:55:03,171 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:55:03,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:55:03,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:03,171 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:55:03,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:55:03,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:55:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:55:03,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:55:03,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 18:55:03,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 18:55:03,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 18:55:03,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-02-02 18:55:03,449 INFO L87 Difference]: Start difference. First operand 207 states and 235 transitions. Second operand 14 states. [2018-02-02 18:55:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:55:04,100 INFO L93 Difference]: Finished difference Result 215 states and 243 transitions. [2018-02-02 18:55:04,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:55:04,100 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-02-02 18:55:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:55:04,101 INFO L225 Difference]: With dead ends: 215 [2018-02-02 18:55:04,101 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 18:55:04,101 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2018-02-02 18:55:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 18:55:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193. [2018-02-02 18:55:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 18:55:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 220 transitions. [2018-02-02 18:55:04,103 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 220 transitions. Word has length 43 [2018-02-02 18:55:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:55:04,103 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 220 transitions. [2018-02-02 18:55:04,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 18:55:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 220 transitions. [2018-02-02 18:55:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:55:04,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:55:04,103 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2018-02-02 18:55:04,103 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:55:04,104 INFO L82 PathProgramCache]: Analyzing trace with hash -507539475, now seen corresponding path program 1 times [2018-02-02 18:55:04,104 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:55:04,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:55:04,104 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:04,104 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:55:04,104 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:55:04,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:55:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:55:04,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:55:04,422 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:55:04,427 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:55:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:55:04,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:55:04,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:55:04,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:55:04,541 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 18:55:04,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-02-02 18:55:04,584 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-02 18:55:04,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:55:04,588 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-02 18:55:04,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,608 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-02 18:55:04,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:55:04,611 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 16 treesize of output 23 [2018-02-02 18:55:04,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,634 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:56 [2018-02-02 18:55:04,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:55:04,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 72 [2018-02-02 18:55:04,709 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 14 treesize of output 13 [2018-02-02 18:55:04,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-02-02 18:55:04,733 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 14 treesize of output 13 [2018-02-02 18:55:04,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:55:04,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-02-02 18:55:04,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-02-02 18:55:04,823 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 22 treesize of output 29 [2018-02-02 18:55:04,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 81 [2018-02-02 18:55:04,847 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 22 treesize of output 29 [2018-02-02 18:55:04,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:04,864 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-02 18:55:04,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:106 [2018-02-02 18:55:10,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-02-02 18:55:10,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:55:10,114 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 18 treesize of output 10 [2018-02-02 18:55:10,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:10,119 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 7 treesize of output 1 [2018-02-02 18:55:10,119 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:10,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:10,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:55:10,132 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:94, output treesize:59 [2018-02-02 18:55:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:55:10,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:55:10,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2018-02-02 18:55:10,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 18:55:10,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 18:55:10,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=890, Unknown=3, NotChecked=0, Total=1056 [2018-02-02 18:55:10,217 INFO L87 Difference]: Start difference. First operand 193 states and 220 transitions. Second operand 33 states. [2018-02-02 18:55:34,601 WARN L146 SmtUtils]: Spent 2044ms on a formula simplification. DAG size of input: 96 DAG size of output 54 [2018-02-02 18:55:42,665 WARN L146 SmtUtils]: Spent 2038ms on a formula simplification. DAG size of input: 88 DAG size of output 51 [2018-02-02 18:55:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:55:49,297 INFO L93 Difference]: Finished difference Result 258 states and 296 transitions. [2018-02-02 18:55:49,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 18:55:49,297 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-02-02 18:55:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:55:49,298 INFO L225 Difference]: With dead ends: 258 [2018-02-02 18:55:49,298 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 18:55:49,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=566, Invalid=2070, Unknown=16, NotChecked=0, Total=2652 [2018-02-02 18:55:49,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 18:55:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 216. [2018-02-02 18:55:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 18:55:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 248 transitions. [2018-02-02 18:55:49,302 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 248 transitions. Word has length 48 [2018-02-02 18:55:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:55:49,302 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 248 transitions. [2018-02-02 18:55:49,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 18:55:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 248 transitions. [2018-02-02 18:55:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:55:49,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:55:49,302 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2018-02-02 18:55:49,302 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:55:49,302 INFO L82 PathProgramCache]: Analyzing trace with hash -822481427, now seen corresponding path program 1 times [2018-02-02 18:55:49,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:55:49,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:55:49,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:49,303 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:55:49,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:55:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:55:49,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:55:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:55:49,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:55:49,427 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:55:49,432 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:55:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:55:49,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:55:49,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:55:49,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:55:49,485 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 18:55:49,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:49,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:49,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-02 18:55:49,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:55:49,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:55:49,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:49,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:49,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:49,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-02 18:55:49,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:55:49,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-02-02 18:55:49,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 18:55:49,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:49,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:49,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:55:49,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-02-02 18:55:49,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-02-02 18:55:49,618 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 20 treesize of output 25 [2018-02-02 18:55:49,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:49,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:49,626 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-02 18:55:49,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:47 [2018-02-02 18:55:55,651 WARN L146 SmtUtils]: Spent 2010ms on a formula simplification. DAG size of input: 26 DAG size of output 22 [2018-02-02 18:55:57,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-02-02 18:55:57,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-02 18:55:57,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:57,699 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 7 treesize of output 1 [2018-02-02 18:55:57,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:55:57,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:55:57,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:55:57,705 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-02-02 18:55:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:55:57,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:55:57,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-02 18:55:57,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 18:55:57,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 18:55:57,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=367, Unknown=3, NotChecked=0, Total=462 [2018-02-02 18:55:57,754 INFO L87 Difference]: Start difference. First operand 216 states and 248 transitions. Second operand 22 states. [2018-02-02 18:56:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:56:00,758 INFO L93 Difference]: Finished difference Result 484 states and 578 transitions. [2018-02-02 18:56:00,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 18:56:00,758 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-02-02 18:56:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:56:00,759 INFO L225 Difference]: With dead ends: 484 [2018-02-02 18:56:00,760 INFO L226 Difference]: Without dead ends: 484 [2018-02-02 18:56:00,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=305, Invalid=814, Unknown=3, NotChecked=0, Total=1122 [2018-02-02 18:56:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-02-02 18:56:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 261. [2018-02-02 18:56:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-02 18:56:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 316 transitions. [2018-02-02 18:56:00,764 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 316 transitions. Word has length 48 [2018-02-02 18:56:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:56:00,764 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 316 transitions. [2018-02-02 18:56:00,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 18:56:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 316 transitions. [2018-02-02 18:56:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:56:00,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:56:00,765 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2018-02-02 18:56:00,765 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:56:00,765 INFO L82 PathProgramCache]: Analyzing trace with hash -822481426, now seen corresponding path program 1 times [2018-02-02 18:56:00,766 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:56:00,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:56:00,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:56:00,766 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:56:00,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:56:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:56:00,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:56:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:56:00,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:56:00,952 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:56:00,957 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:56:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:56:00,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:56:00,980 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-02 18:56:00,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:00,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:56:00,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:56:00,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:56:00,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:00,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:00,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-02 18:56:00,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:56:01,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:56:01,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:56:01,011 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-02 18:56:01,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-02-02 18:56:01,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:56:01,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-02-02 18:56:01,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 18:56:01,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:56:01,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-02 18:56:01,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 18:56:01,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,076 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:56:01,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-02-02 18:56:01,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-02-02 18:56:01,129 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 20 treesize of output 25 [2018-02-02 18:56:01,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-02-02 18:56:01,153 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 20 treesize of output 25 [2018-02-02 18:56:01,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:01,165 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-02 18:56:01,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:73 [2018-02-02 18:56:07,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-02-02 18:56:07,238 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 7 treesize of output 1 [2018-02-02 18:56:07,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:07,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-02-02 18:56:07,245 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:07,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:07,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-02-02 18:56:07,255 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 7 treesize of output 1 [2018-02-02 18:56:07,255 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:07,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-02 18:56:07,260 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:07,261 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:07,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:07,264 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-02-02 18:56:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:56:07,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:56:07,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-02-02 18:56:07,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 18:56:07,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 18:56:07,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=277, Unknown=3, NotChecked=0, Total=342 [2018-02-02 18:56:07,329 INFO L87 Difference]: Start difference. First operand 261 states and 316 transitions. Second operand 19 states. [2018-02-02 18:56:09,589 WARN L146 SmtUtils]: Spent 2034ms on a formula simplification. DAG size of input: 91 DAG size of output 47 [2018-02-02 18:56:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:56:10,404 INFO L93 Difference]: Finished difference Result 475 states and 566 transitions. [2018-02-02 18:56:10,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:56:10,405 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-02 18:56:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:56:10,406 INFO L225 Difference]: With dead ends: 475 [2018-02-02 18:56:10,406 INFO L226 Difference]: Without dead ends: 475 [2018-02-02 18:56:10,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=215, Invalid=712, Unknown=3, NotChecked=0, Total=930 [2018-02-02 18:56:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-02 18:56:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 281. [2018-02-02 18:56:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-02 18:56:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 340 transitions. [2018-02-02 18:56:10,409 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 340 transitions. Word has length 48 [2018-02-02 18:56:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:56:10,409 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 340 transitions. [2018-02-02 18:56:10,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 18:56:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 340 transitions. [2018-02-02 18:56:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:56:10,410 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:56:10,410 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2018-02-02 18:56:10,410 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:56:10,410 INFO L82 PathProgramCache]: Analyzing trace with hash -816755789, now seen corresponding path program 1 times [2018-02-02 18:56:10,410 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:56:10,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:56:10,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:56:10,411 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:56:10,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:56:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:56:10,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:56:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:56:10,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:56:10,599 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:56:10,606 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:56:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:56:10,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:56:10,648 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 13 treesize of output 10 [2018-02-02 18:56:10,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 18:56:10,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,661 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 13 treesize of output 10 [2018-02-02 18:56:10,662 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 10 treesize of output 9 [2018-02-02 18:56:10,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,669 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-02 18:56:10,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:56:10,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:56:10,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:56:10,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-02-02 18:56:10,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-02-02 18:56:10,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:56:10,741 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 16 treesize of output 23 [2018-02-02 18:56:10,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-02-02 18:56:10,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:56:10,769 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-02 18:56:10,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:36 [2018-02-02 18:56:10,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:56:10,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-02 18:56:10,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 18:56:10,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:56:10,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-02-02 18:56:10,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 18:56:10,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:56:10,893 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:58 [2018-02-02 18:56:10,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-02-02 18:56:10,983 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 20 treesize of output 25 [2018-02-02 18:56:10,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:10,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:11,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-02-02 18:56:11,005 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 20 treesize of output 25 [2018-02-02 18:56:11,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:11,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:11,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 18:56:11,024 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:81 [2018-02-02 18:56:15,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 58 [2018-02-02 18:56:15,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-02-02 18:56:15,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:15,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:56:15,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2018-02-02 18:56:15,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:56:15,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:56:15,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-02-02 18:56:15,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-02-02 18:56:15,185 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:15,190 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 15 treesize of output 3 [2018-02-02 18:56:15,190 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:56:15,192 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:15,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:56:15,198 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:102, output treesize:7 [2018-02-02 18:56:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:56:15,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:56:15,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2018-02-02 18:56:15,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 18:56:15,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 18:56:15,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=572, Unknown=2, NotChecked=0, Total=650 [2018-02-02 18:56:15,248 INFO L87 Difference]: Start difference. First operand 281 states and 340 transitions. Second operand 26 states. Received shutdown request... [2018-02-02 18:56:21,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:56:21,756 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:56:21,760 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:56:21,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:56:21 BoogieIcfgContainer [2018-02-02 18:56:21,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:56:21,761 INFO L168 Benchmark]: Toolchain (without parser) took 92596.45 ms. Allocated memory was 404.8 MB in the beginning and 843.1 MB in the end (delta: 438.3 MB). Free memory was 361.4 MB in the beginning and 581.0 MB in the end (delta: -219.6 MB). Peak memory consumption was 218.7 MB. Max. memory is 5.3 GB. [2018-02-02 18:56:21,762 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 404.8 MB. Free memory is still 368.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:56:21,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.75 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 350.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:56:21,763 INFO L168 Benchmark]: Boogie Preprocessor took 28.08 ms. Allocated memory is still 404.8 MB. Free memory was 350.9 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-02 18:56:21,763 INFO L168 Benchmark]: RCFGBuilder took 412.64 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 308.5 MB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 5.3 GB. [2018-02-02 18:56:21,763 INFO L168 Benchmark]: TraceAbstraction took 91994.22 ms. Allocated memory was 404.8 MB in the beginning and 843.1 MB in the end (delta: 438.3 MB). Free memory was 308.5 MB in the beginning and 581.0 MB in the end (delta: -272.5 MB). Peak memory consumption was 165.8 MB. Max. memory is 5.3 GB. [2018-02-02 18:56:21,764 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.09 ms. Allocated memory is still 404.8 MB. Free memory is still 368.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.75 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 350.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.08 ms. Allocated memory is still 404.8 MB. Free memory was 350.9 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 412.64 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 308.5 MB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 91994.22 ms. Allocated memory was 404.8 MB in the beginning and 843.1 MB in the end (delta: 438.3 MB). Free memory was 308.5 MB in the beginning and 581.0 MB in the end (delta: -272.5 MB). Peak memory consumption was 165.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (281states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 147 locations, 65 error locations. TIMEOUT Result, 91.9s OverallTime, 39 OverallIterations, 3 TraceHistogramMax, 61.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4045 SDtfs, 7808 SDslu, 12952 SDs, 0 SdLazy, 13662 SolverSat, 879 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 24.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 261 SyntacticMatches, 26 SemanticMatches, 471 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2167 ImplicationChecksByTransitivity, 62.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=38, 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, 38 MinimizatonAttempts, 1724 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 29.4s InterpolantComputationTime, 1415 NumberOfCodeBlocks, 1415 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1370 ConstructedInterpolants, 84 QuantifiedInterpolants, 576767 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1068 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 45 InterpolantComputations, 33 PerfectInterpolantSequences, 60/142 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-56-21-771.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-56-21-771.csv Completed graceful shutdown