./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2cbbf56a13532141372a32a461d64a9d1351c0e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:25:16,919 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:25:16,921 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:25:16,932 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:25:16,933 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:25:16,934 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:25:16,935 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:25:16,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:25:16,940 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:25:16,942 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:25:16,943 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:25:16,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:25:16,948 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:25:16,952 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:25:16,953 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:25:16,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:25:16,958 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:25:16,962 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:25:16,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:25:16,969 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:25:16,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:25:16,975 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:25:16,980 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:25:16,980 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:25:16,981 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:25:16,981 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:25:16,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:25:16,985 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:25:16,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:25:16,989 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:25:16,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:25:16,990 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:25:16,990 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:25:16,990 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:25:16,991 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:25:16,993 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:25:16,993 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:25:17,021 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:25:17,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:25:17,023 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:25:17,023 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:25:17,023 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:25:17,023 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:25:17,024 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:25:17,024 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:25:17,024 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:25:17,024 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:25:17,024 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:25:17,024 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:25:17,025 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:25:17,026 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:25:17,026 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:25:17,026 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:25:17,026 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:25:17,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:25:17,027 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:25:17,027 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:25:17,027 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:25:17,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:25:17,027 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:25:17,027 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:25:17,028 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:25:17,029 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:25:17,029 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:25:17,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:25:17,029 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2019-01-11 21:25:17,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:25:17,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:25:17,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:25:17,095 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:25:17,095 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:25:17,096 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:25:17,153 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0f3702b/bb4ada18c8884f80bd666e845032f263/FLAG422d78e37 [2019-01-11 21:25:17,607 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:25:17,608 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:25:17,620 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0f3702b/bb4ada18c8884f80bd666e845032f263/FLAG422d78e37 [2019-01-11 21:25:17,944 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0f3702b/bb4ada18c8884f80bd666e845032f263 [2019-01-11 21:25:17,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:25:17,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:25:17,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:25:17,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:25:17,953 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:25:17,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:25:17" (1/1) ... [2019-01-11 21:25:17,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8b7262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:17, skipping insertion in model container [2019-01-11 21:25:17,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:25:17" (1/1) ... [2019-01-11 21:25:17,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:25:17,988 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:25:18,238 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:25:18,243 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:25:18,288 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:25:18,305 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:25:18,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:18 WrapperNode [2019-01-11 21:25:18,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:25:18,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:25:18,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:25:18,307 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:25:18,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:18" (1/1) ... [2019-01-11 21:25:18,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:18" (1/1) ... [2019-01-11 21:25:18,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:25:18,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:25:18,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:25:18,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:25:18,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:18" (1/1) ... [2019-01-11 21:25:18,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:18" (1/1) ... [2019-01-11 21:25:18,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:18" (1/1) ... [2019-01-11 21:25:18,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:18" (1/1) ... [2019-01-11 21:25:18,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:18" (1/1) ... [2019-01-11 21:25:18,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:18" (1/1) ... [2019-01-11 21:25:18,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:18" (1/1) ... [2019-01-11 21:25:18,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:25:18,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:25:18,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:25:18,380 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:25:18,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:18" (1/1) ... No working directory specified, using /storage/repos/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 [2019-01-11 21:25:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:25:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:25:18,995 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:25:18,996 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-11 21:25:18,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:25:18 BoogieIcfgContainer [2019-01-11 21:25:18,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:25:18,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:25:18,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:25:19,002 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:25:19,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:25:17" (1/3) ... [2019-01-11 21:25:19,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e542d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:25:19, skipping insertion in model container [2019-01-11 21:25:19,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:18" (2/3) ... [2019-01-11 21:25:19,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e542d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:25:19, skipping insertion in model container [2019-01-11 21:25:19,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:25:18" (3/3) ... [2019-01-11 21:25:19,005 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:25:19,016 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:25:19,025 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:25:19,038 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:25:19,070 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:25:19,071 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:25:19,071 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:25:19,071 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:25:19,071 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:25:19,071 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:25:19,071 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:25:19,071 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:25:19,072 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:25:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-01-11 21:25:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 21:25:19,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:19,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:19,102 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2043472865, now seen corresponding path program 1 times [2019-01-11 21:25:19,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:19,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:19,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:19,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:19,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:19,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:19,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:19,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:19,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:19,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:19,304 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-01-11 21:25:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:19,354 INFO L93 Difference]: Finished difference Result 70 states and 120 transitions. [2019-01-11 21:25:19,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:19,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-11 21:25:19,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:19,367 INFO L225 Difference]: With dead ends: 70 [2019-01-11 21:25:19,368 INFO L226 Difference]: Without dead ends: 56 [2019-01-11 21:25:19,371 INFO L631 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 [2019-01-11 21:25:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-11 21:25:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-01-11 21:25:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 21:25:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2019-01-11 21:25:19,413 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 69 transitions. Word has length 14 [2019-01-11 21:25:19,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:19,413 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 69 transitions. [2019-01-11 21:25:19,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 69 transitions. [2019-01-11 21:25:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 21:25:19,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:19,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:19,415 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:19,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:19,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1342408287, now seen corresponding path program 1 times [2019-01-11 21:25:19,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:19,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:19,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:19,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:19,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:19,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:19,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:19,495 INFO L87 Difference]: Start difference. First operand 38 states and 69 transitions. Second operand 3 states. [2019-01-11 21:25:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:19,550 INFO L93 Difference]: Finished difference Result 93 states and 168 transitions. [2019-01-11 21:25:19,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:19,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-11 21:25:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:19,552 INFO L225 Difference]: With dead ends: 93 [2019-01-11 21:25:19,552 INFO L226 Difference]: Without dead ends: 56 [2019-01-11 21:25:19,554 INFO L631 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 [2019-01-11 21:25:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-11 21:25:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-01-11 21:25:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-11 21:25:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-01-11 21:25:19,567 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 14 [2019-01-11 21:25:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:19,567 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-01-11 21:25:19,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-01-11 21:25:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 21:25:19,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:19,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:19,569 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:19,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:19,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1077064620, now seen corresponding path program 1 times [2019-01-11 21:25:19,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:19,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:19,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:19,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:19,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:19,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:19,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:19,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:19,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:19,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:19,673 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-01-11 21:25:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:19,715 INFO L93 Difference]: Finished difference Result 86 states and 149 transitions. [2019-01-11 21:25:19,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:19,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-11 21:25:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:19,717 INFO L225 Difference]: With dead ends: 86 [2019-01-11 21:25:19,717 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 21:25:19,718 INFO L631 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 [2019-01-11 21:25:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 21:25:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-01-11 21:25:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-11 21:25:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2019-01-11 21:25:19,727 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 15 [2019-01-11 21:25:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:19,728 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2019-01-11 21:25:19,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2019-01-11 21:25:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 21:25:19,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:19,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:19,729 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:19,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1335230058, now seen corresponding path program 1 times [2019-01-11 21:25:19,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:19,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:19,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:19,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:19,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:19,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:19,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:19,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:19,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:19,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:19,789 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand 3 states. [2019-01-11 21:25:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:19,854 INFO L93 Difference]: Finished difference Result 108 states and 188 transitions. [2019-01-11 21:25:19,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:19,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-11 21:25:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:19,857 INFO L225 Difference]: With dead ends: 108 [2019-01-11 21:25:19,857 INFO L226 Difference]: Without dead ends: 106 [2019-01-11 21:25:19,858 INFO L631 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 [2019-01-11 21:25:19,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-11 21:25:19,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2019-01-11 21:25:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 21:25:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 132 transitions. [2019-01-11 21:25:19,869 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 132 transitions. Word has length 15 [2019-01-11 21:25:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:19,869 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 132 transitions. [2019-01-11 21:25:19,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2019-01-11 21:25:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 21:25:19,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:19,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:19,872 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:19,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:19,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2036294636, now seen corresponding path program 1 times [2019-01-11 21:25:19,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:19,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:19,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:19,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:19,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:19,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:19,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:19,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:19,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:19,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:19,924 INFO L87 Difference]: Start difference. First operand 76 states and 132 transitions. Second operand 3 states. [2019-01-11 21:25:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:19,993 INFO L93 Difference]: Finished difference Result 180 states and 314 transitions. [2019-01-11 21:25:19,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:19,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-11 21:25:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:19,996 INFO L225 Difference]: With dead ends: 180 [2019-01-11 21:25:19,996 INFO L226 Difference]: Without dead ends: 108 [2019-01-11 21:25:19,997 INFO L631 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 [2019-01-11 21:25:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-11 21:25:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-01-11 21:25:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-11 21:25:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 182 transitions. [2019-01-11 21:25:20,006 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 182 transitions. Word has length 15 [2019-01-11 21:25:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:20,007 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 182 transitions. [2019-01-11 21:25:20,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 182 transitions. [2019-01-11 21:25:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 21:25:20,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:20,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:20,008 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:20,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1557326826, now seen corresponding path program 1 times [2019-01-11 21:25:20,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:20,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:20,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:20,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:20,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:20,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:20,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:20,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:20,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:20,059 INFO L87 Difference]: Start difference. First operand 106 states and 182 transitions. Second operand 3 states. [2019-01-11 21:25:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:20,126 INFO L93 Difference]: Finished difference Result 161 states and 273 transitions. [2019-01-11 21:25:20,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:20,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-11 21:25:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:20,129 INFO L225 Difference]: With dead ends: 161 [2019-01-11 21:25:20,129 INFO L226 Difference]: Without dead ends: 110 [2019-01-11 21:25:20,131 INFO L631 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 [2019-01-11 21:25:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-11 21:25:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-11 21:25:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-11 21:25:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 182 transitions. [2019-01-11 21:25:20,147 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 182 transitions. Word has length 16 [2019-01-11 21:25:20,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:20,147 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 182 transitions. [2019-01-11 21:25:20,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 182 transitions. [2019-01-11 21:25:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 21:25:20,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:20,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:20,150 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:20,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:20,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1299161388, now seen corresponding path program 1 times [2019-01-11 21:25:20,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:20,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:20,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:20,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:20,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:20,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:20,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:20,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:20,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:20,231 INFO L87 Difference]: Start difference. First operand 108 states and 182 transitions. Second operand 3 states. [2019-01-11 21:25:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:20,276 INFO L93 Difference]: Finished difference Result 308 states and 520 transitions. [2019-01-11 21:25:20,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:20,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-11 21:25:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:20,279 INFO L225 Difference]: With dead ends: 308 [2019-01-11 21:25:20,279 INFO L226 Difference]: Without dead ends: 206 [2019-01-11 21:25:20,280 INFO L631 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 [2019-01-11 21:25:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-01-11 21:25:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2019-01-11 21:25:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-11 21:25:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 338 transitions. [2019-01-11 21:25:20,313 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 338 transitions. Word has length 16 [2019-01-11 21:25:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:20,314 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 338 transitions. [2019-01-11 21:25:20,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 338 transitions. [2019-01-11 21:25:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 21:25:20,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:20,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:20,317 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:20,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:20,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2000225966, now seen corresponding path program 1 times [2019-01-11 21:25:20,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:20,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:20,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:20,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:20,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:20,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:20,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:20,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:20,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:20,400 INFO L87 Difference]: Start difference. First operand 204 states and 338 transitions. Second operand 3 states. [2019-01-11 21:25:20,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:20,474 INFO L93 Difference]: Finished difference Result 256 states and 428 transitions. [2019-01-11 21:25:20,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:20,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-11 21:25:20,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:20,477 INFO L225 Difference]: With dead ends: 256 [2019-01-11 21:25:20,478 INFO L226 Difference]: Without dead ends: 254 [2019-01-11 21:25:20,478 INFO L631 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 [2019-01-11 21:25:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-11 21:25:20,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2019-01-11 21:25:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-11 21:25:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 334 transitions. [2019-01-11 21:25:20,492 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 334 transitions. Word has length 16 [2019-01-11 21:25:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:20,492 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 334 transitions. [2019-01-11 21:25:20,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 334 transitions. [2019-01-11 21:25:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 21:25:20,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:20,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:20,496 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:20,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:20,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1619082687, now seen corresponding path program 1 times [2019-01-11 21:25:20,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:20,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:20,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:20,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:20,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:20,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:20,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:20,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:20,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:20,596 INFO L87 Difference]: Start difference. First operand 204 states and 334 transitions. Second operand 3 states. [2019-01-11 21:25:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:20,639 INFO L93 Difference]: Finished difference Result 372 states and 616 transitions. [2019-01-11 21:25:20,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:20,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-11 21:25:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:20,643 INFO L225 Difference]: With dead ends: 372 [2019-01-11 21:25:20,643 INFO L226 Difference]: Without dead ends: 370 [2019-01-11 21:25:20,643 INFO L631 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 [2019-01-11 21:25:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-01-11 21:25:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 288. [2019-01-11 21:25:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-11 21:25:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 462 transitions. [2019-01-11 21:25:20,658 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 462 transitions. Word has length 17 [2019-01-11 21:25:20,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:20,658 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 462 transitions. [2019-01-11 21:25:20,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 462 transitions. [2019-01-11 21:25:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 21:25:20,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:20,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:20,662 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:20,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:20,662 INFO L82 PathProgramCache]: Analyzing trace with hash -918018109, now seen corresponding path program 1 times [2019-01-11 21:25:20,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:20,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:20,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:20,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:20,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:20,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:20,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:20,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:20,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:20,719 INFO L87 Difference]: Start difference. First operand 288 states and 462 transitions. Second operand 3 states. [2019-01-11 21:25:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:20,771 INFO L93 Difference]: Finished difference Result 676 states and 1088 transitions. [2019-01-11 21:25:20,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:20,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-11 21:25:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:20,775 INFO L225 Difference]: With dead ends: 676 [2019-01-11 21:25:20,776 INFO L226 Difference]: Without dead ends: 394 [2019-01-11 21:25:20,777 INFO L631 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 [2019-01-11 21:25:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-01-11 21:25:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2019-01-11 21:25:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-01-11 21:25:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 618 transitions. [2019-01-11 21:25:20,797 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 618 transitions. Word has length 17 [2019-01-11 21:25:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:20,797 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 618 transitions. [2019-01-11 21:25:20,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 618 transitions. [2019-01-11 21:25:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 21:25:20,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:20,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:20,801 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:20,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1348259273, now seen corresponding path program 1 times [2019-01-11 21:25:20,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:20,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:20,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:20,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:20,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:20,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:20,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:20,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:20,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:20,850 INFO L87 Difference]: Start difference. First operand 392 states and 618 transitions. Second operand 3 states. [2019-01-11 21:25:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:20,906 INFO L93 Difference]: Finished difference Result 596 states and 936 transitions. [2019-01-11 21:25:20,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:20,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-11 21:25:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:20,910 INFO L225 Difference]: With dead ends: 596 [2019-01-11 21:25:20,910 INFO L226 Difference]: Without dead ends: 406 [2019-01-11 21:25:20,911 INFO L631 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 [2019-01-11 21:25:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-01-11 21:25:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2019-01-11 21:25:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-01-11 21:25:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 626 transitions. [2019-01-11 21:25:20,928 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 626 transitions. Word has length 18 [2019-01-11 21:25:20,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:20,928 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 626 transitions. [2019-01-11 21:25:20,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 626 transitions. [2019-01-11 21:25:20,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 21:25:20,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:20,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:20,932 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:20,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:20,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1606424711, now seen corresponding path program 1 times [2019-01-11 21:25:20,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:20,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:20,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:20,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:20,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:20,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:20,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:20,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:20,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:20,982 INFO L87 Difference]: Start difference. First operand 404 states and 626 transitions. Second operand 3 states. [2019-01-11 21:25:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:21,047 INFO L93 Difference]: Finished difference Result 712 states and 1116 transitions. [2019-01-11 21:25:21,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:21,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-11 21:25:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:21,053 INFO L225 Difference]: With dead ends: 712 [2019-01-11 21:25:21,053 INFO L226 Difference]: Without dead ends: 710 [2019-01-11 21:25:21,054 INFO L631 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 [2019-01-11 21:25:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-01-11 21:25:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 580. [2019-01-11 21:25:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-01-11 21:25:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 874 transitions. [2019-01-11 21:25:21,077 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 874 transitions. Word has length 18 [2019-01-11 21:25:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:21,077 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 874 transitions. [2019-01-11 21:25:21,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 874 transitions. [2019-01-11 21:25:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 21:25:21,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:21,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:21,079 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:21,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1987478007, now seen corresponding path program 1 times [2019-01-11 21:25:21,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:21,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:21,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:21,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:21,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:21,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:21,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:21,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:21,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:21,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:21,156 INFO L87 Difference]: Start difference. First operand 580 states and 874 transitions. Second operand 3 states. [2019-01-11 21:25:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:21,222 INFO L93 Difference]: Finished difference Result 1336 states and 2012 transitions. [2019-01-11 21:25:21,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:21,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-11 21:25:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:21,228 INFO L225 Difference]: With dead ends: 1336 [2019-01-11 21:25:21,228 INFO L226 Difference]: Without dead ends: 774 [2019-01-11 21:25:21,230 INFO L631 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 [2019-01-11 21:25:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-01-11 21:25:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 772. [2019-01-11 21:25:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-01-11 21:25:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1138 transitions. [2019-01-11 21:25:21,261 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1138 transitions. Word has length 18 [2019-01-11 21:25:21,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:21,261 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 1138 transitions. [2019-01-11 21:25:21,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1138 transitions. [2019-01-11 21:25:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 21:25:21,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:21,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:21,264 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:21,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:21,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1740226152, now seen corresponding path program 1 times [2019-01-11 21:25:21,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:21,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:21,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:21,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:21,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:21,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:21,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:21,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:21,336 INFO L87 Difference]: Start difference. First operand 772 states and 1138 transitions. Second operand 3 states. [2019-01-11 21:25:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:21,433 INFO L93 Difference]: Finished difference Result 1160 states and 1700 transitions. [2019-01-11 21:25:21,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:21,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-11 21:25:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:21,439 INFO L225 Difference]: With dead ends: 1160 [2019-01-11 21:25:21,440 INFO L226 Difference]: Without dead ends: 790 [2019-01-11 21:25:21,441 INFO L631 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 [2019-01-11 21:25:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-11 21:25:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2019-01-11 21:25:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-01-11 21:25:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1138 transitions. [2019-01-11 21:25:21,472 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1138 transitions. Word has length 19 [2019-01-11 21:25:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:21,472 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1138 transitions. [2019-01-11 21:25:21,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1138 transitions. [2019-01-11 21:25:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 21:25:21,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:21,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:21,476 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:21,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:21,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1482060714, now seen corresponding path program 1 times [2019-01-11 21:25:21,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:21,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:21,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:21,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:21,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:21,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:21,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:21,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:21,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:21,545 INFO L87 Difference]: Start difference. First operand 788 states and 1138 transitions. Second operand 3 states. [2019-01-11 21:25:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:21,630 INFO L93 Difference]: Finished difference Result 1352 states and 1972 transitions. [2019-01-11 21:25:21,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:21,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-11 21:25:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:21,637 INFO L225 Difference]: With dead ends: 1352 [2019-01-11 21:25:21,637 INFO L226 Difference]: Without dead ends: 1350 [2019-01-11 21:25:21,638 INFO L631 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 [2019-01-11 21:25:21,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-01-11 21:25:21,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1156. [2019-01-11 21:25:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-01-11 21:25:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1618 transitions. [2019-01-11 21:25:21,679 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1618 transitions. Word has length 19 [2019-01-11 21:25:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:21,679 INFO L480 AbstractCegarLoop]: Abstraction has 1156 states and 1618 transitions. [2019-01-11 21:25:21,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1618 transitions. [2019-01-11 21:25:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 21:25:21,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:21,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:21,683 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:21,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash -780996136, now seen corresponding path program 1 times [2019-01-11 21:25:21,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:21,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:21,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:21,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:21,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:21,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:21,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:21,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:21,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:21,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:21,738 INFO L87 Difference]: Start difference. First operand 1156 states and 1618 transitions. Second operand 3 states. [2019-01-11 21:25:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:21,826 INFO L93 Difference]: Finished difference Result 2632 states and 3668 transitions. [2019-01-11 21:25:21,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:21,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-11 21:25:21,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:21,834 INFO L225 Difference]: With dead ends: 2632 [2019-01-11 21:25:21,835 INFO L226 Difference]: Without dead ends: 1510 [2019-01-11 21:25:21,837 INFO L631 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 [2019-01-11 21:25:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-01-11 21:25:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1508. [2019-01-11 21:25:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2019-01-11 21:25:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2050 transitions. [2019-01-11 21:25:21,896 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2050 transitions. Word has length 19 [2019-01-11 21:25:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:21,896 INFO L480 AbstractCegarLoop]: Abstraction has 1508 states and 2050 transitions. [2019-01-11 21:25:21,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2050 transitions. [2019-01-11 21:25:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 21:25:21,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:21,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:21,901 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:21,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:21,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1300973822, now seen corresponding path program 1 times [2019-01-11 21:25:21,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:21,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:21,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:21,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:21,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:21,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:21,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:21,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:21,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:21,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:21,961 INFO L87 Difference]: Start difference. First operand 1508 states and 2050 transitions. Second operand 3 states. [2019-01-11 21:25:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:22,067 INFO L93 Difference]: Finished difference Result 2264 states and 3060 transitions. [2019-01-11 21:25:22,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:22,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-11 21:25:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:22,075 INFO L225 Difference]: With dead ends: 2264 [2019-01-11 21:25:22,076 INFO L226 Difference]: Without dead ends: 1542 [2019-01-11 21:25:22,077 INFO L631 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 [2019-01-11 21:25:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-01-11 21:25:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1540. [2019-01-11 21:25:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-01-11 21:25:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2050 transitions. [2019-01-11 21:25:22,131 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2050 transitions. Word has length 20 [2019-01-11 21:25:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:22,131 INFO L480 AbstractCegarLoop]: Abstraction has 1540 states and 2050 transitions. [2019-01-11 21:25:22,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2050 transitions. [2019-01-11 21:25:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 21:25:22,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:22,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:22,136 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:22,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1559139260, now seen corresponding path program 1 times [2019-01-11 21:25:22,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:22,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:22,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:22,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:22,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:22,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:22,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:22,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:22,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:22,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:22,203 INFO L87 Difference]: Start difference. First operand 1540 states and 2050 transitions. Second operand 3 states. [2019-01-11 21:25:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:22,348 INFO L93 Difference]: Finished difference Result 2568 states and 3428 transitions. [2019-01-11 21:25:22,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:22,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-11 21:25:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:22,364 INFO L225 Difference]: With dead ends: 2568 [2019-01-11 21:25:22,364 INFO L226 Difference]: Without dead ends: 2566 [2019-01-11 21:25:22,366 INFO L631 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 [2019-01-11 21:25:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-01-11 21:25:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2308. [2019-01-11 21:25:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-01-11 21:25:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 2978 transitions. [2019-01-11 21:25:22,457 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 2978 transitions. Word has length 20 [2019-01-11 21:25:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:22,457 INFO L480 AbstractCegarLoop]: Abstraction has 2308 states and 2978 transitions. [2019-01-11 21:25:22,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2978 transitions. [2019-01-11 21:25:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 21:25:22,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:22,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:22,463 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:22,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2034763458, now seen corresponding path program 1 times [2019-01-11 21:25:22,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:22,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:22,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:22,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:22,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:22,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:22,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:22,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:22,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:22,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:22,538 INFO L87 Difference]: Start difference. First operand 2308 states and 2978 transitions. Second operand 3 states. [2019-01-11 21:25:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:22,739 INFO L93 Difference]: Finished difference Result 5192 states and 6628 transitions. [2019-01-11 21:25:22,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:22,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-11 21:25:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:22,756 INFO L225 Difference]: With dead ends: 5192 [2019-01-11 21:25:22,756 INFO L226 Difference]: Without dead ends: 2950 [2019-01-11 21:25:22,760 INFO L631 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 [2019-01-11 21:25:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-01-11 21:25:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2948. [2019-01-11 21:25:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2019-01-11 21:25:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3650 transitions. [2019-01-11 21:25:22,882 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3650 transitions. Word has length 20 [2019-01-11 21:25:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:22,883 INFO L480 AbstractCegarLoop]: Abstraction has 2948 states and 3650 transitions. [2019-01-11 21:25:22,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3650 transitions. [2019-01-11 21:25:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 21:25:22,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:22,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:22,890 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:22,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1088892845, now seen corresponding path program 1 times [2019-01-11 21:25:22,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:22,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:22,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:22,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:22,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:22,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:22,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:22,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:22,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:22,963 INFO L87 Difference]: Start difference. First operand 2948 states and 3650 transitions. Second operand 3 states. [2019-01-11 21:25:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:23,102 INFO L93 Difference]: Finished difference Result 4424 states and 5444 transitions. [2019-01-11 21:25:23,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:23,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-11 21:25:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:23,116 INFO L225 Difference]: With dead ends: 4424 [2019-01-11 21:25:23,116 INFO L226 Difference]: Without dead ends: 3014 [2019-01-11 21:25:23,119 INFO L631 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 [2019-01-11 21:25:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-01-11 21:25:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3012. [2019-01-11 21:25:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3012 states. [2019-01-11 21:25:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3650 transitions. [2019-01-11 21:25:23,212 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3650 transitions. Word has length 21 [2019-01-11 21:25:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:23,212 INFO L480 AbstractCegarLoop]: Abstraction has 3012 states and 3650 transitions. [2019-01-11 21:25:23,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3650 transitions. [2019-01-11 21:25:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 21:25:23,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:23,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:23,219 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:23,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:23,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1347058283, now seen corresponding path program 1 times [2019-01-11 21:25:23,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:23,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:23,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:23,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:23,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:23,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:23,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:23,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:23,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:23,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:23,286 INFO L87 Difference]: Start difference. First operand 3012 states and 3650 transitions. Second operand 3 states. [2019-01-11 21:25:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:23,463 INFO L93 Difference]: Finished difference Result 4870 states and 5827 transitions. [2019-01-11 21:25:23,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:23,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-11 21:25:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:23,482 INFO L225 Difference]: With dead ends: 4870 [2019-01-11 21:25:23,483 INFO L226 Difference]: Without dead ends: 4868 [2019-01-11 21:25:23,485 INFO L631 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 [2019-01-11 21:25:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2019-01-11 21:25:23,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4612. [2019-01-11 21:25:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4612 states. [2019-01-11 21:25:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 5442 transitions. [2019-01-11 21:25:23,608 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 5442 transitions. Word has length 21 [2019-01-11 21:25:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:23,608 INFO L480 AbstractCegarLoop]: Abstraction has 4612 states and 5442 transitions. [2019-01-11 21:25:23,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 5442 transitions. [2019-01-11 21:25:23,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 21:25:23,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:23,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:23,616 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:23,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:23,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2048122861, now seen corresponding path program 1 times [2019-01-11 21:25:23,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:23,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:23,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:23,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:23,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:23,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:23,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:23,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:23,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:23,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:23,678 INFO L87 Difference]: Start difference. First operand 4612 states and 5442 transitions. Second operand 3 states. [2019-01-11 21:25:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:23,883 INFO L93 Difference]: Finished difference Result 10244 states and 11842 transitions. [2019-01-11 21:25:23,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:23,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-11 21:25:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:23,885 INFO L225 Difference]: With dead ends: 10244 [2019-01-11 21:25:23,885 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:25:23,896 INFO L631 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 [2019-01-11 21:25:23,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:25:23,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:25:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:25:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:25:23,897 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-01-11 21:25:23,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:23,897 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:25:23,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:25:23,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:25:23,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:25:23,981 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-01-11 21:25:23,981 INFO L444 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-01-11 21:25:23,981 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,983 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,983 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:25:23,983 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:25:23,983 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-01-11 21:25:23,983 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,984 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,985 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-01-11 21:25:23,985 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-11 21:25:23,985 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,985 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,985 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,987 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,987 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-01-11 21:25:23,987 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,987 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-11 21:25:23,987 INFO L451 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-01-11 21:25:23,987 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-01-11 21:25:23,988 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,988 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,988 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:25:23,988 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-11 21:25:23,988 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-01-11 21:25:23,988 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,988 INFO L451 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-01-11 21:25:23,988 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,988 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:23,988 INFO L451 ceAbstractionStarter]: At program point L134(lines 4 135) the Hoare annotation is: true [2019-01-11 21:25:23,989 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-01-11 21:25:23,989 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-01-11 21:25:23,989 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-01-11 21:25:24,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:25:24 BoogieIcfgContainer [2019-01-11 21:25:24,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:25:24,007 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:25:24,007 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:25:24,008 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:25:24,008 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:25:18" (3/4) ... [2019-01-11 21:25:24,015 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:25:24,040 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-11 21:25:24,041 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:25:24,151 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:25:24,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:25:24,152 INFO L168 Benchmark]: Toolchain (without parser) took 6203.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 951.3 MB in the beginning and 944.0 MB in the end (delta: 7.4 MB). Peak memory consumption was 222.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:24,154 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:25:24,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:24,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.80 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:25:24,157 INFO L168 Benchmark]: Boogie Preprocessor took 28.97 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:24,157 INFO L168 Benchmark]: RCFGBuilder took 617.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:24,158 INFO L168 Benchmark]: TraceAbstraction took 5008.51 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 944.0 MB in the end (delta: 160.0 MB). Peak memory consumption was 239.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:24,158 INFO L168 Benchmark]: Witness Printer took 144.00 ms. Allocated memory is still 1.2 GB. Free memory is still 944.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:25:24,162 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.80 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.97 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 617.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5008.51 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 944.0 MB in the end (delta: 160.0 MB). Peak memory consumption was 239.2 MB. Max. memory is 11.5 GB. * Witness Printer took 144.00 ms. Allocated memory is still 1.2 GB. Free memory is still 944.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1452 SDtfs, 720 SDslu, 942 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4612occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 13195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...