./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 2e94e6aa 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-2e94e6a [2018-12-30 16:10:46,829 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:10:46,831 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:10:46,848 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:10:46,848 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:10:46,850 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:10:46,851 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:10:46,856 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:10:46,858 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:10:46,859 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:10:46,868 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:10:46,869 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:10:46,870 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:10:46,870 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:10:46,875 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:10:46,875 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:10:46,876 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:10:46,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:10:46,880 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:10:46,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:10:46,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:10:46,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:10:46,886 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:10:46,887 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:10:46,887 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:10:46,888 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:10:46,889 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:10:46,890 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:10:46,891 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:10:46,892 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:10:46,892 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:10:46,892 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:10:46,893 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:10:46,893 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:10:46,894 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:10:46,895 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:10:46,895 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:10:46,916 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:10:46,917 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:10:46,918 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:10:46,919 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:10:46,919 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:10:46,919 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:10:46,919 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:10:46,919 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:10:46,921 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:10:46,921 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:10:46,921 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:10:46,921 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:10:46,921 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:10:46,922 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:10:46,922 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:10:46,923 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:10:46,923 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:10:46,923 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:10:46,923 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:10:46,923 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:10:46,924 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:10:46,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:10:46,924 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:10:46,924 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:10:46,924 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:10:46,925 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:10:46,927 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:10:46,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:10:46,927 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 [2018-12-30 16:10:46,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:10:47,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:10:47,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:10:47,007 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:10:47,007 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:10:47,008 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 [2018-12-30 16:10:47,066 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1afdd4423/c8470a0a1c9b4c139041b0098df2039d/FLAG5ce832d53 [2018-12-30 16:10:47,550 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:10:47,551 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:47,559 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1afdd4423/c8470a0a1c9b4c139041b0098df2039d/FLAG5ce832d53 [2018-12-30 16:10:47,902 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1afdd4423/c8470a0a1c9b4c139041b0098df2039d [2018-12-30 16:10:47,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:10:47,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:10:47,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:47,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:10:47,912 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:10:47,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:47" (1/1) ... [2018-12-30 16:10:47,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ccf8dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:47, skipping insertion in model container [2018-12-30 16:10:47,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:47" (1/1) ... [2018-12-30 16:10:47,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:10:47,950 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:10:48,188 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:48,193 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:10:48,228 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:48,246 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:10:48,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48 WrapperNode [2018-12-30 16:10:48,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:48,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:48,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:10:48,248 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:10:48,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:48,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:10:48,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:10:48,294 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:10:48,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:10:48,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:10:48,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:10:48,329 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:10:48,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (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 [2018-12-30 16:10:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:10:48,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:10:48,980 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:10:48,980 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-30 16:10:48,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:48 BoogieIcfgContainer [2018-12-30 16:10:48,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:10:48,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:10:48,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:10:48,984 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:10:48,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:10:47" (1/3) ... [2018-12-30 16:10:48,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5a81e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:48, skipping insertion in model container [2018-12-30 16:10:48,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (2/3) ... [2018-12-30 16:10:48,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5a81e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:48, skipping insertion in model container [2018-12-30 16:10:48,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:48" (3/3) ... [2018-12-30 16:10:48,988 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:48,996 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:10:49,003 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:10:49,017 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:10:49,049 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:10:49,050 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:10:49,050 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:10:49,050 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:10:49,052 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:10:49,052 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:10:49,052 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:10:49,052 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:10:49,052 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:10:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-30 16:10:49,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-30 16:10:49,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:49,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:49,080 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:49,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2043472865, now seen corresponding path program 1 times [2018-12-30 16:10:49,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:49,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:49,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:49,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:49,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:49,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:49,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:49,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:49,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:49,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:49,301 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2018-12-30 16:10:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:49,353 INFO L93 Difference]: Finished difference Result 70 states and 120 transitions. [2018-12-30 16:10:49,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:49,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-30 16:10:49,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:49,367 INFO L225 Difference]: With dead ends: 70 [2018-12-30 16:10:49,367 INFO L226 Difference]: Without dead ends: 56 [2018-12-30 16:10:49,370 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 [2018-12-30 16:10:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-30 16:10:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2018-12-30 16:10:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-30 16:10:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2018-12-30 16:10:49,412 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 69 transitions. Word has length 14 [2018-12-30 16:10:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:49,412 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 69 transitions. [2018-12-30 16:10:49,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 69 transitions. [2018-12-30 16:10:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-30 16:10:49,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:49,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:49,414 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:49,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1342408287, now seen corresponding path program 1 times [2018-12-30 16:10:49,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:49,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:49,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:49,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:49,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:49,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:49,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:49,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:49,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:49,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:49,496 INFO L87 Difference]: Start difference. First operand 38 states and 69 transitions. Second operand 3 states. [2018-12-30 16:10:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:49,566 INFO L93 Difference]: Finished difference Result 93 states and 168 transitions. [2018-12-30 16:10:49,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:49,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-30 16:10:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:49,568 INFO L225 Difference]: With dead ends: 93 [2018-12-30 16:10:49,569 INFO L226 Difference]: Without dead ends: 56 [2018-12-30 16:10:49,570 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 [2018-12-30 16:10:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-30 16:10:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-12-30 16:10:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-30 16:10:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2018-12-30 16:10:49,580 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 14 [2018-12-30 16:10:49,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:49,580 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2018-12-30 16:10:49,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2018-12-30 16:10:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-30 16:10:49,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:49,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:49,584 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:49,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1077064620, now seen corresponding path program 1 times [2018-12-30 16:10:49,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:49,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:49,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:49,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:49,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:49,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:49,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:49,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:49,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:49,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:49,672 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2018-12-30 16:10:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:49,702 INFO L93 Difference]: Finished difference Result 86 states and 149 transitions. [2018-12-30 16:10:49,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:49,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-30 16:10:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:49,704 INFO L225 Difference]: With dead ends: 86 [2018-12-30 16:10:49,704 INFO L226 Difference]: Without dead ends: 59 [2018-12-30 16:10:49,705 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 [2018-12-30 16:10:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-30 16:10:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-12-30 16:10:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-30 16:10:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2018-12-30 16:10:49,714 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 15 [2018-12-30 16:10:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:49,715 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2018-12-30 16:10:49,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2018-12-30 16:10:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-30 16:10:49,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:49,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:49,717 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:49,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:49,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1335230058, now seen corresponding path program 1 times [2018-12-30 16:10:49,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:49,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:49,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:49,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:49,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:49,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:49,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:49,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:49,771 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand 3 states. [2018-12-30 16:10:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:49,866 INFO L93 Difference]: Finished difference Result 108 states and 188 transitions. [2018-12-30 16:10:49,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:49,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-30 16:10:49,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:49,868 INFO L225 Difference]: With dead ends: 108 [2018-12-30 16:10:49,869 INFO L226 Difference]: Without dead ends: 106 [2018-12-30 16:10:49,869 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 [2018-12-30 16:10:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-30 16:10:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2018-12-30 16:10:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-30 16:10:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 132 transitions. [2018-12-30 16:10:49,886 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 132 transitions. Word has length 15 [2018-12-30 16:10:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:49,886 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 132 transitions. [2018-12-30 16:10:49,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2018-12-30 16:10:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-30 16:10:49,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:49,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:49,888 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:49,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2036294636, now seen corresponding path program 1 times [2018-12-30 16:10:49,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:49,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:49,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:49,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:49,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:49,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:49,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:49,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:49,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:49,965 INFO L87 Difference]: Start difference. First operand 76 states and 132 transitions. Second operand 3 states. [2018-12-30 16:10:50,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,022 INFO L93 Difference]: Finished difference Result 180 states and 314 transitions. [2018-12-30 16:10:50,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-30 16:10:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,025 INFO L225 Difference]: With dead ends: 180 [2018-12-30 16:10:50,025 INFO L226 Difference]: Without dead ends: 108 [2018-12-30 16:10:50,026 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 [2018-12-30 16:10:50,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-30 16:10:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-12-30 16:10:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-30 16:10:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 182 transitions. [2018-12-30 16:10:50,037 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 182 transitions. Word has length 15 [2018-12-30 16:10:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,038 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 182 transitions. [2018-12-30 16:10:50,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 182 transitions. [2018-12-30 16:10:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 16:10:50,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,040 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1557326826, now seen corresponding path program 1 times [2018-12-30 16:10:50,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:50,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:50,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:50,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:50,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:50,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:50,092 INFO L87 Difference]: Start difference. First operand 106 states and 182 transitions. Second operand 3 states. [2018-12-30 16:10:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,174 INFO L93 Difference]: Finished difference Result 161 states and 273 transitions. [2018-12-30 16:10:50,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-30 16:10:50,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,176 INFO L225 Difference]: With dead ends: 161 [2018-12-30 16:10:50,176 INFO L226 Difference]: Without dead ends: 110 [2018-12-30 16:10:50,177 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 [2018-12-30 16:10:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-30 16:10:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-12-30 16:10:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-30 16:10:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 182 transitions. [2018-12-30 16:10:50,200 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 182 transitions. Word has length 16 [2018-12-30 16:10:50,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,200 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 182 transitions. [2018-12-30 16:10:50,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 182 transitions. [2018-12-30 16:10:50,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 16:10:50,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,205 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1299161388, now seen corresponding path program 1 times [2018-12-30 16:10:50,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:50,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:50,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:50,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:50,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:50,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:50,283 INFO L87 Difference]: Start difference. First operand 108 states and 182 transitions. Second operand 3 states. [2018-12-30 16:10:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,320 INFO L93 Difference]: Finished difference Result 308 states and 520 transitions. [2018-12-30 16:10:50,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-30 16:10:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,323 INFO L225 Difference]: With dead ends: 308 [2018-12-30 16:10:50,323 INFO L226 Difference]: Without dead ends: 206 [2018-12-30 16:10:50,324 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 [2018-12-30 16:10:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-30 16:10:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-12-30 16:10:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-30 16:10:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 338 transitions. [2018-12-30 16:10:50,354 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 338 transitions. Word has length 16 [2018-12-30 16:10:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,357 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 338 transitions. [2018-12-30 16:10:50,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 338 transitions. [2018-12-30 16:10:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 16:10:50,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,359 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2000225966, now seen corresponding path program 1 times [2018-12-30 16:10:50,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:50,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:50,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:50,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:50,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:50,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:50,436 INFO L87 Difference]: Start difference. First operand 204 states and 338 transitions. Second operand 3 states. [2018-12-30 16:10:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,471 INFO L93 Difference]: Finished difference Result 256 states and 428 transitions. [2018-12-30 16:10:50,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-30 16:10:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,474 INFO L225 Difference]: With dead ends: 256 [2018-12-30 16:10:50,474 INFO L226 Difference]: Without dead ends: 254 [2018-12-30 16:10:50,475 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 [2018-12-30 16:10:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-30 16:10:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2018-12-30 16:10:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-30 16:10:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 334 transitions. [2018-12-30 16:10:50,486 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 334 transitions. Word has length 16 [2018-12-30 16:10:50,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,486 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 334 transitions. [2018-12-30 16:10:50,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 334 transitions. [2018-12-30 16:10:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:50,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,488 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1619082687, now seen corresponding path program 1 times [2018-12-30 16:10:50,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:50,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:50,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:50,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:50,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:50,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:50,558 INFO L87 Difference]: Start difference. First operand 204 states and 334 transitions. Second operand 3 states. [2018-12-30 16:10:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,649 INFO L93 Difference]: Finished difference Result 372 states and 616 transitions. [2018-12-30 16:10:50,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,652 INFO L225 Difference]: With dead ends: 372 [2018-12-30 16:10:50,652 INFO L226 Difference]: Without dead ends: 370 [2018-12-30 16:10:50,653 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 [2018-12-30 16:10:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-12-30 16:10:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 288. [2018-12-30 16:10:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-12-30 16:10:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 462 transitions. [2018-12-30 16:10:50,666 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 462 transitions. Word has length 17 [2018-12-30 16:10:50,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,666 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 462 transitions. [2018-12-30 16:10:50,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 462 transitions. [2018-12-30 16:10:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:50,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,669 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,670 INFO L82 PathProgramCache]: Analyzing trace with hash -918018109, now seen corresponding path program 1 times [2018-12-30 16:10:50,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:50,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:50,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:50,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:50,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:50,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:50,739 INFO L87 Difference]: Start difference. First operand 288 states and 462 transitions. Second operand 3 states. [2018-12-30 16:10:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,803 INFO L93 Difference]: Finished difference Result 676 states and 1088 transitions. [2018-12-30 16:10:50,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,808 INFO L225 Difference]: With dead ends: 676 [2018-12-30 16:10:50,808 INFO L226 Difference]: Without dead ends: 394 [2018-12-30 16:10:50,810 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 [2018-12-30 16:10:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-12-30 16:10:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2018-12-30 16:10:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-30 16:10:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 618 transitions. [2018-12-30 16:10:50,836 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 618 transitions. Word has length 17 [2018-12-30 16:10:50,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,838 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 618 transitions. [2018-12-30 16:10:50,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 618 transitions. [2018-12-30 16:10:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-30 16:10:50,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,845 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1348259273, now seen corresponding path program 1 times [2018-12-30 16:10:50,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:50,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:50,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:50,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:50,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:50,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:50,929 INFO L87 Difference]: Start difference. First operand 392 states and 618 transitions. Second operand 3 states. [2018-12-30 16:10:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:51,008 INFO L93 Difference]: Finished difference Result 596 states and 936 transitions. [2018-12-30 16:10:51,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:51,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-30 16:10:51,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:51,012 INFO L225 Difference]: With dead ends: 596 [2018-12-30 16:10:51,012 INFO L226 Difference]: Without dead ends: 406 [2018-12-30 16:10:51,013 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 [2018-12-30 16:10:51,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-12-30 16:10:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2018-12-30 16:10:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-12-30 16:10:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 626 transitions. [2018-12-30 16:10:51,028 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 626 transitions. Word has length 18 [2018-12-30 16:10:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:51,029 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 626 transitions. [2018-12-30 16:10:51,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 626 transitions. [2018-12-30 16:10:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-30 16:10:51,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:51,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:51,030 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:51,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:51,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1606424711, now seen corresponding path program 1 times [2018-12-30 16:10:51,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:51,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:51,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:51,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:51,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:51,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:51,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:51,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:51,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:51,068 INFO L87 Difference]: Start difference. First operand 404 states and 626 transitions. Second operand 3 states. [2018-12-30 16:10:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:51,137 INFO L93 Difference]: Finished difference Result 712 states and 1116 transitions. [2018-12-30 16:10:51,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:51,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-30 16:10:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:51,142 INFO L225 Difference]: With dead ends: 712 [2018-12-30 16:10:51,142 INFO L226 Difference]: Without dead ends: 710 [2018-12-30 16:10:51,143 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 [2018-12-30 16:10:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-12-30 16:10:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 580. [2018-12-30 16:10:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-12-30 16:10:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 874 transitions. [2018-12-30 16:10:51,167 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 874 transitions. Word has length 18 [2018-12-30 16:10:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:51,168 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 874 transitions. [2018-12-30 16:10:51,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 874 transitions. [2018-12-30 16:10:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-30 16:10:51,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:51,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:51,171 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:51,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:51,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1987478007, now seen corresponding path program 1 times [2018-12-30 16:10:51,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:51,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:51,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:51,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:51,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:51,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:51,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:51,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:51,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:51,242 INFO L87 Difference]: Start difference. First operand 580 states and 874 transitions. Second operand 3 states. [2018-12-30 16:10:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:51,357 INFO L93 Difference]: Finished difference Result 1336 states and 2012 transitions. [2018-12-30 16:10:51,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:51,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-30 16:10:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:51,363 INFO L225 Difference]: With dead ends: 1336 [2018-12-30 16:10:51,363 INFO L226 Difference]: Without dead ends: 774 [2018-12-30 16:10:51,364 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 [2018-12-30 16:10:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2018-12-30 16:10:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 772. [2018-12-30 16:10:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-12-30 16:10:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1138 transitions. [2018-12-30 16:10:51,396 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1138 transitions. Word has length 18 [2018-12-30 16:10:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:51,397 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 1138 transitions. [2018-12-30 16:10:51,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1138 transitions. [2018-12-30 16:10:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:51,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:51,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:51,400 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1740226152, now seen corresponding path program 1 times [2018-12-30 16:10:51,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:51,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:51,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:51,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:51,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:51,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:51,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:51,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:51,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:51,475 INFO L87 Difference]: Start difference. First operand 772 states and 1138 transitions. Second operand 3 states. [2018-12-30 16:10:51,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:51,564 INFO L93 Difference]: Finished difference Result 1160 states and 1700 transitions. [2018-12-30 16:10:51,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:51,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:51,570 INFO L225 Difference]: With dead ends: 1160 [2018-12-30 16:10:51,570 INFO L226 Difference]: Without dead ends: 790 [2018-12-30 16:10:51,571 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 [2018-12-30 16:10:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-30 16:10:51,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2018-12-30 16:10:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-12-30 16:10:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1138 transitions. [2018-12-30 16:10:51,605 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1138 transitions. Word has length 19 [2018-12-30 16:10:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:51,605 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1138 transitions. [2018-12-30 16:10:51,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1138 transitions. [2018-12-30 16:10:51,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:51,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:51,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:51,608 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:51,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1482060714, now seen corresponding path program 1 times [2018-12-30 16:10:51,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:51,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:51,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:51,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:51,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:51,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:51,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:51,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:51,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:51,670 INFO L87 Difference]: Start difference. First operand 788 states and 1138 transitions. Second operand 3 states. [2018-12-30 16:10:51,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:51,775 INFO L93 Difference]: Finished difference Result 1352 states and 1972 transitions. [2018-12-30 16:10:51,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:51,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:51,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:51,784 INFO L225 Difference]: With dead ends: 1352 [2018-12-30 16:10:51,784 INFO L226 Difference]: Without dead ends: 1350 [2018-12-30 16:10:51,785 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 [2018-12-30 16:10:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2018-12-30 16:10:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1156. [2018-12-30 16:10:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2018-12-30 16:10:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1618 transitions. [2018-12-30 16:10:51,829 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1618 transitions. Word has length 19 [2018-12-30 16:10:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:51,829 INFO L480 AbstractCegarLoop]: Abstraction has 1156 states and 1618 transitions. [2018-12-30 16:10:51,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1618 transitions. [2018-12-30 16:10:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:51,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:51,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:51,833 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash -780996136, now seen corresponding path program 1 times [2018-12-30 16:10:51,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:51,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:51,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:51,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:51,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:51,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:51,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:51,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:51,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:51,903 INFO L87 Difference]: Start difference. First operand 1156 states and 1618 transitions. Second operand 3 states. [2018-12-30 16:10:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:52,017 INFO L93 Difference]: Finished difference Result 2632 states and 3668 transitions. [2018-12-30 16:10:52,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:52,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:52,024 INFO L225 Difference]: With dead ends: 2632 [2018-12-30 16:10:52,024 INFO L226 Difference]: Without dead ends: 1510 [2018-12-30 16:10:52,026 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 [2018-12-30 16:10:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-12-30 16:10:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1508. [2018-12-30 16:10:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-12-30 16:10:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2050 transitions. [2018-12-30 16:10:52,084 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2050 transitions. Word has length 19 [2018-12-30 16:10:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:52,085 INFO L480 AbstractCegarLoop]: Abstraction has 1508 states and 2050 transitions. [2018-12-30 16:10:52,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2050 transitions. [2018-12-30 16:10:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:52,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:52,087 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] [2018-12-30 16:10:52,088 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:52,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1300973822, now seen corresponding path program 1 times [2018-12-30 16:10:52,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:52,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:52,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:52,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:52,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:52,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:52,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:52,143 INFO L87 Difference]: Start difference. First operand 1508 states and 2050 transitions. Second operand 3 states. [2018-12-30 16:10:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:52,248 INFO L93 Difference]: Finished difference Result 2264 states and 3060 transitions. [2018-12-30 16:10:52,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:52,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:52,256 INFO L225 Difference]: With dead ends: 2264 [2018-12-30 16:10:52,256 INFO L226 Difference]: Without dead ends: 1542 [2018-12-30 16:10:52,258 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 [2018-12-30 16:10:52,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-30 16:10:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1540. [2018-12-30 16:10:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2018-12-30 16:10:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2050 transitions. [2018-12-30 16:10:52,311 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2050 transitions. Word has length 20 [2018-12-30 16:10:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:52,311 INFO L480 AbstractCegarLoop]: Abstraction has 1540 states and 2050 transitions. [2018-12-30 16:10:52,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2050 transitions. [2018-12-30 16:10:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:52,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:52,314 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] [2018-12-30 16:10:52,314 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1559139260, now seen corresponding path program 1 times [2018-12-30 16:10:52,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:52,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:52,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:52,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:52,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:52,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:52,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:52,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:52,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:52,379 INFO L87 Difference]: Start difference. First operand 1540 states and 2050 transitions. Second operand 3 states. [2018-12-30 16:10:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:52,498 INFO L93 Difference]: Finished difference Result 2568 states and 3428 transitions. [2018-12-30 16:10:52,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:52,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:52,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:52,509 INFO L225 Difference]: With dead ends: 2568 [2018-12-30 16:10:52,509 INFO L226 Difference]: Without dead ends: 2566 [2018-12-30 16:10:52,510 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 [2018-12-30 16:10:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2018-12-30 16:10:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2308. [2018-12-30 16:10:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2018-12-30 16:10:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 2978 transitions. [2018-12-30 16:10:52,589 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 2978 transitions. Word has length 20 [2018-12-30 16:10:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:52,590 INFO L480 AbstractCegarLoop]: Abstraction has 2308 states and 2978 transitions. [2018-12-30 16:10:52,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2978 transitions. [2018-12-30 16:10:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:52,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:52,594 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] [2018-12-30 16:10:52,594 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2034763458, now seen corresponding path program 1 times [2018-12-30 16:10:52,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:52,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:52,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:52,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:52,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:52,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:52,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:52,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:52,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:52,640 INFO L87 Difference]: Start difference. First operand 2308 states and 2978 transitions. Second operand 3 states. [2018-12-30 16:10:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:52,822 INFO L93 Difference]: Finished difference Result 5192 states and 6628 transitions. [2018-12-30 16:10:52,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:52,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:52,834 INFO L225 Difference]: With dead ends: 5192 [2018-12-30 16:10:52,834 INFO L226 Difference]: Without dead ends: 2950 [2018-12-30 16:10:52,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 [2018-12-30 16:10:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2018-12-30 16:10:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2948. [2018-12-30 16:10:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2018-12-30 16:10:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3650 transitions. [2018-12-30 16:10:52,940 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3650 transitions. Word has length 20 [2018-12-30 16:10:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:52,940 INFO L480 AbstractCegarLoop]: Abstraction has 2948 states and 3650 transitions. [2018-12-30 16:10:52,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:52,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3650 transitions. [2018-12-30 16:10:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:52,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:52,945 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] [2018-12-30 16:10:52,945 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:52,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1088892845, now seen corresponding path program 1 times [2018-12-30 16:10:52,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:52,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:52,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:52,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:53,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:53,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:53,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:53,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:53,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:53,012 INFO L87 Difference]: Start difference. First operand 2948 states and 3650 transitions. Second operand 3 states. [2018-12-30 16:10:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:53,160 INFO L93 Difference]: Finished difference Result 4424 states and 5444 transitions. [2018-12-30 16:10:53,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:53,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:53,173 INFO L225 Difference]: With dead ends: 4424 [2018-12-30 16:10:53,173 INFO L226 Difference]: Without dead ends: 3014 [2018-12-30 16:10:53,176 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 [2018-12-30 16:10:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2018-12-30 16:10:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3012. [2018-12-30 16:10:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3012 states. [2018-12-30 16:10:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3650 transitions. [2018-12-30 16:10:53,289 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3650 transitions. Word has length 21 [2018-12-30 16:10:53,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:53,289 INFO L480 AbstractCegarLoop]: Abstraction has 3012 states and 3650 transitions. [2018-12-30 16:10:53,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3650 transitions. [2018-12-30 16:10:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:53,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:53,294 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] [2018-12-30 16:10:53,294 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:53,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1347058283, now seen corresponding path program 1 times [2018-12-30 16:10:53,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:53,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:53,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:53,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:53,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:53,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:53,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:53,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:53,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:53,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:53,358 INFO L87 Difference]: Start difference. First operand 3012 states and 3650 transitions. Second operand 3 states. [2018-12-30 16:10:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:53,555 INFO L93 Difference]: Finished difference Result 4870 states and 5827 transitions. [2018-12-30 16:10:53,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:53,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:53,575 INFO L225 Difference]: With dead ends: 4870 [2018-12-30 16:10:53,575 INFO L226 Difference]: Without dead ends: 4868 [2018-12-30 16:10:53,577 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 [2018-12-30 16:10:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2018-12-30 16:10:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4612. [2018-12-30 16:10:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4612 states. [2018-12-30 16:10:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 5442 transitions. [2018-12-30 16:10:53,711 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 5442 transitions. Word has length 21 [2018-12-30 16:10:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:53,711 INFO L480 AbstractCegarLoop]: Abstraction has 4612 states and 5442 transitions. [2018-12-30 16:10:53,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 5442 transitions. [2018-12-30 16:10:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:53,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:53,721 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] [2018-12-30 16:10:53,721 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2048122861, now seen corresponding path program 1 times [2018-12-30 16:10:53,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:53,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:53,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:53,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:53,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:53,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:53,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:53,801 INFO L87 Difference]: Start difference. First operand 4612 states and 5442 transitions. Second operand 3 states. [2018-12-30 16:10:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:54,046 INFO L93 Difference]: Finished difference Result 10244 states and 11842 transitions. [2018-12-30 16:10:54,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:54,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:54,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:54,049 INFO L225 Difference]: With dead ends: 10244 [2018-12-30 16:10:54,049 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:10:54,060 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 [2018-12-30 16:10:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:10:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:10:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:10:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:10:54,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-12-30 16:10:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:54,063 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:10:54,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:54,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:10:54,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:10:54,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:10:54,150 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-12-30 16:10:54,150 INFO L444 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-12-30 16:10:54,150 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,150 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,150 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:10:54,150 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:10:54,151 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-12-30 16:10:54,151 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,151 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,151 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-30 16:10:54,151 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-30 16:10:54,151 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,151 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,151 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,155 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,155 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-12-30 16:10:54,155 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,155 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-30 16:10:54,155 INFO L451 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-12-30 16:10:54,156 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,156 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:10:54,156 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-30 16:10:54,156 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-12-30 16:10:54,156 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-12-30 16:10:54,156 INFO L451 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-12-30 16:10:54,156 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,161 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,161 INFO L451 ceAbstractionStarter]: At program point L134(lines 4 135) the Hoare annotation is: true [2018-12-30 16:10:54,161 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-12-30 16:10:54,161 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-12-30 16:10:54,161 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-12-30 16:10:54,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:10:54 BoogieIcfgContainer [2018-12-30 16:10:54,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:10:54,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:10:54,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:10:54,175 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:10:54,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:48" (3/4) ... [2018-12-30 16:10:54,182 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:10:54,201 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-30 16:10:54,204 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:10:54,287 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:10:54,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:10:54,292 INFO L168 Benchmark]: Toolchain (without parser) took 6386.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 952.7 MB in the beginning and 923.9 MB in the end (delta: 28.8 MB). Peak memory consumption was 224.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:54,294 INFO L168 Benchmark]: CDTParser took 0.16 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. [2018-12-30 16:10:54,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.24 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:54,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.71 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:10:54,295 INFO L168 Benchmark]: Boogie Preprocessor took 34.44 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:54,295 INFO L168 Benchmark]: RCFGBuilder took 652.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:54,295 INFO L168 Benchmark]: TraceAbstraction took 5193.15 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 931.8 MB in the end (delta: 148.4 MB). Peak memory consumption was 226.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:54,296 INFO L168 Benchmark]: Witness Printer took 116.32 ms. Allocated memory is still 1.2 GB. Free memory was 931.8 MB in the beginning and 923.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:54,298 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.16 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 339.24 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 44.71 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.44 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 652.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5193.15 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 931.8 MB in the end (delta: 148.4 MB). Peak memory consumption was 226.6 MB. Max. memory is 11.5 GB. * Witness Printer took 116.32 ms. Allocated memory is still 1.2 GB. Free memory was 931.8 MB in the beginning and 923.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. 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, 5.1s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 2.3s 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.3s 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...