./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem02_label20_true-unreach-call_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 5360c3d4aebe9582cd01259f723ea710f280bf1f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:55:20,777 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:55:20,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:55:20,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:55:20,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:55:20,799 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:55:20,801 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:55:20,804 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:55:20,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:55:20,808 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:55:20,809 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:55:20,810 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:55:20,812 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:55:20,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:55:20,815 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:55:20,823 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:55:20,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:55:20,827 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:55:20,831 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:55:20,834 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:55:20,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:55:20,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:55:20,842 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:55:20,842 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:55:20,842 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:55:20,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:55:20,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:55:20,845 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:55:20,849 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:55:20,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:55:20,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:55:20,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:55:20,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:55:20,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:55:20,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:55:20,860 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:55:20,862 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:55:20,885 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:55:20,886 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:55:20,887 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:55:20,887 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:55:20,887 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:55:20,887 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:55:20,888 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:55:20,888 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:55:20,888 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:55:20,888 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:55:20,888 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:55:20,888 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:55:20,888 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:55:20,889 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:55:20,889 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:55:20,889 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:55:20,889 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:55:20,889 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:55:20,889 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:55:20,890 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:55:20,890 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:55:20,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:55:20,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:55:20,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:55:20,890 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:55:20,891 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:55:20,891 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:55:20,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:55:20,891 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 -> 5360c3d4aebe9582cd01259f723ea710f280bf1f [2019-01-12 00:55:20,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:55:20,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:55:20,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:55:20,966 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:55:20,966 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:55:20,967 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c [2019-01-12 00:55:21,033 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54e5bb282/7b4a720335c843608bb4aa3a703d2882/FLAG41bd8f490 [2019-01-12 00:55:21,601 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:55:21,601 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c [2019-01-12 00:55:21,616 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54e5bb282/7b4a720335c843608bb4aa3a703d2882/FLAG41bd8f490 [2019-01-12 00:55:21,850 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54e5bb282/7b4a720335c843608bb4aa3a703d2882 [2019-01-12 00:55:21,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:55:21,856 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:55:21,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:55:21,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:55:21,864 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:55:21,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:55:21" (1/1) ... [2019-01-12 00:55:21,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fc82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:21, skipping insertion in model container [2019-01-12 00:55:21,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:55:21" (1/1) ... [2019-01-12 00:55:21,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:55:21,925 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:55:22,345 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:55:22,353 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:55:22,465 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:55:22,485 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:55:22,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:22 WrapperNode [2019-01-12 00:55:22,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:55:22,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:55:22,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:55:22,486 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:55:22,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:22" (1/1) ... [2019-01-12 00:55:22,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:22" (1/1) ... [2019-01-12 00:55:22,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:55:22,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:55:22,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:55:22,683 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:55:22,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:22" (1/1) ... [2019-01-12 00:55:22,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:22" (1/1) ... [2019-01-12 00:55:22,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:22" (1/1) ... [2019-01-12 00:55:22,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:22" (1/1) ... [2019-01-12 00:55:22,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:22" (1/1) ... [2019-01-12 00:55:22,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:22" (1/1) ... [2019-01-12 00:55:22,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:22" (1/1) ... [2019-01-12 00:55:22,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:55:22,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:55:22,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:55:22,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:55:22,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:55:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:55:22,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:55:26,220 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:55:26,221 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:55:26,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:55:26 BoogieIcfgContainer [2019-01-12 00:55:26,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:55:26,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:55:26,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:55:26,228 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:55:26,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:55:21" (1/3) ... [2019-01-12 00:55:26,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce80447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:55:26, skipping insertion in model container [2019-01-12 00:55:26,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:22" (2/3) ... [2019-01-12 00:55:26,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce80447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:55:26, skipping insertion in model container [2019-01-12 00:55:26,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:55:26" (3/3) ... [2019-01-12 00:55:26,233 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label20_true-unreach-call_false-termination.c [2019-01-12 00:55:26,246 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:55:26,258 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:55:26,275 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:55:26,317 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:55:26,317 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:55:26,318 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:55:26,318 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:55:26,319 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:55:26,319 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:55:26,319 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:55:26,319 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:55:26,319 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:55:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-01-12 00:55:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 00:55:26,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:26,355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:26,357 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:26,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:26,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1124491187, now seen corresponding path program 1 times [2019-01-12 00:55:26,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:26,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:26,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:26,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:26,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:26,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:26,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:26,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:26,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:26,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:26,980 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-01-12 00:55:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:29,742 INFO L93 Difference]: Finished difference Result 739 states and 1311 transitions. [2019-01-12 00:55:29,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:29,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-01-12 00:55:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:29,767 INFO L225 Difference]: With dead ends: 739 [2019-01-12 00:55:29,767 INFO L226 Difference]: Without dead ends: 445 [2019-01-12 00:55:29,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-01-12 00:55:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2019-01-12 00:55:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-01-12 00:55:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 664 transitions. [2019-01-12 00:55:29,898 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 664 transitions. Word has length 99 [2019-01-12 00:55:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:29,899 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 664 transitions. [2019-01-12 00:55:29,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:29,899 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 664 transitions. [2019-01-12 00:55:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 00:55:29,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:29,906 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:29,906 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:29,907 INFO L82 PathProgramCache]: Analyzing trace with hash -661756398, now seen corresponding path program 1 times [2019-01-12 00:55:29,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:29,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:29,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:29,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:29,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:30,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:30,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:30,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:30,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:30,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:30,101 INFO L87 Difference]: Start difference. First operand 445 states and 664 transitions. Second operand 4 states. [2019-01-12 00:55:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:31,333 INFO L93 Difference]: Finished difference Result 1470 states and 2193 transitions. [2019-01-12 00:55:31,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:31,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-01-12 00:55:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:31,341 INFO L225 Difference]: With dead ends: 1470 [2019-01-12 00:55:31,341 INFO L226 Difference]: Without dead ends: 1027 [2019-01-12 00:55:31,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-01-12 00:55:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 729. [2019-01-12 00:55:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-01-12 00:55:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1053 transitions. [2019-01-12 00:55:31,384 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1053 transitions. Word has length 117 [2019-01-12 00:55:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:31,384 INFO L480 AbstractCegarLoop]: Abstraction has 729 states and 1053 transitions. [2019-01-12 00:55:31,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1053 transitions. [2019-01-12 00:55:31,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-12 00:55:31,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:31,390 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:31,390 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:31,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:31,390 INFO L82 PathProgramCache]: Analyzing trace with hash -612453497, now seen corresponding path program 1 times [2019-01-12 00:55:31,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:31,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:31,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:31,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:31,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:31,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:31,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:55:31,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:31,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:31,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:31,494 INFO L87 Difference]: Start difference. First operand 729 states and 1053 transitions. Second operand 4 states. [2019-01-12 00:55:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:34,533 INFO L93 Difference]: Finished difference Result 2582 states and 3716 transitions. [2019-01-12 00:55:34,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:34,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-01-12 00:55:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:34,543 INFO L225 Difference]: With dead ends: 2582 [2019-01-12 00:55:34,544 INFO L226 Difference]: Without dead ends: 1855 [2019-01-12 00:55:34,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2019-01-12 00:55:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1570. [2019-01-12 00:55:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-01-12 00:55:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2141 transitions. [2019-01-12 00:55:34,596 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2141 transitions. Word has length 121 [2019-01-12 00:55:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:34,597 INFO L480 AbstractCegarLoop]: Abstraction has 1570 states and 2141 transitions. [2019-01-12 00:55:34,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2141 transitions. [2019-01-12 00:55:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-12 00:55:34,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:34,603 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:34,604 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:34,604 INFO L82 PathProgramCache]: Analyzing trace with hash 519114652, now seen corresponding path program 1 times [2019-01-12 00:55:34,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:34,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:34,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:34,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:34,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:34,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:34,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:55:34,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:34,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:34,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:34,718 INFO L87 Difference]: Start difference. First operand 1570 states and 2141 transitions. Second operand 3 states. [2019-01-12 00:55:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:35,340 INFO L93 Difference]: Finished difference Result 3840 states and 5193 transitions. [2019-01-12 00:55:35,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:35,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-12 00:55:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:35,351 INFO L225 Difference]: With dead ends: 3840 [2019-01-12 00:55:35,352 INFO L226 Difference]: Without dead ends: 2272 [2019-01-12 00:55:35,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2019-01-12 00:55:35,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2272. [2019-01-12 00:55:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2019-01-12 00:55:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2838 transitions. [2019-01-12 00:55:35,402 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2838 transitions. Word has length 121 [2019-01-12 00:55:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:35,402 INFO L480 AbstractCegarLoop]: Abstraction has 2272 states and 2838 transitions. [2019-01-12 00:55:35,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2838 transitions. [2019-01-12 00:55:35,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-12 00:55:35,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:35,407 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:35,408 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:35,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:35,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1585632305, now seen corresponding path program 1 times [2019-01-12 00:55:35,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:35,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:35,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:35,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:55:35,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:35,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:35,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:35,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:35,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:35,566 INFO L87 Difference]: Start difference. First operand 2272 states and 2838 transitions. Second operand 3 states. [2019-01-12 00:55:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:36,483 INFO L93 Difference]: Finished difference Result 5381 states and 6669 transitions. [2019-01-12 00:55:36,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:36,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-01-12 00:55:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:36,499 INFO L225 Difference]: With dead ends: 5381 [2019-01-12 00:55:36,499 INFO L226 Difference]: Without dead ends: 2546 [2019-01-12 00:55:36,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-01-12 00:55:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2125. [2019-01-12 00:55:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-01-12 00:55:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2479 transitions. [2019-01-12 00:55:36,546 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2479 transitions. Word has length 126 [2019-01-12 00:55:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:36,547 INFO L480 AbstractCegarLoop]: Abstraction has 2125 states and 2479 transitions. [2019-01-12 00:55:36,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2479 transitions. [2019-01-12 00:55:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-12 00:55:36,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:36,552 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:36,552 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:36,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:36,553 INFO L82 PathProgramCache]: Analyzing trace with hash 426939321, now seen corresponding path program 1 times [2019-01-12 00:55:36,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:36,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:36,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:36,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:36,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:55:36,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:36,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:55:36,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:36,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:36,698 INFO L87 Difference]: Start difference. First operand 2125 states and 2479 transitions. Second operand 4 states. [2019-01-12 00:55:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:37,266 INFO L93 Difference]: Finished difference Result 4388 states and 5107 transitions. [2019-01-12 00:55:37,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:37,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-01-12 00:55:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:37,276 INFO L225 Difference]: With dead ends: 4388 [2019-01-12 00:55:37,276 INFO L226 Difference]: Without dead ends: 1985 [2019-01-12 00:55:37,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-01-12 00:55:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1705. [2019-01-12 00:55:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-01-12 00:55:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 1937 transitions. [2019-01-12 00:55:37,312 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 1937 transitions. Word has length 137 [2019-01-12 00:55:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:37,312 INFO L480 AbstractCegarLoop]: Abstraction has 1705 states and 1937 transitions. [2019-01-12 00:55:37,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 1937 transitions. [2019-01-12 00:55:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-12 00:55:37,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:37,317 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:37,317 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:37,318 INFO L82 PathProgramCache]: Analyzing trace with hash 825573273, now seen corresponding path program 1 times [2019-01-12 00:55:37,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:37,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:37,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:37,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:37,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 00:55:37,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:37,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:37,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:37,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:37,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:37,403 INFO L87 Difference]: Start difference. First operand 1705 states and 1937 transitions. Second operand 3 states. [2019-01-12 00:55:37,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:37,913 INFO L93 Difference]: Finished difference Result 3411 states and 3863 transitions. [2019-01-12 00:55:37,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:37,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-01-12 00:55:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:37,921 INFO L225 Difference]: With dead ends: 3411 [2019-01-12 00:55:37,922 INFO L226 Difference]: Without dead ends: 1707 [2019-01-12 00:55:37,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-01-12 00:55:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1703. [2019-01-12 00:55:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-01-12 00:55:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 1867 transitions. [2019-01-12 00:55:37,989 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 1867 transitions. Word has length 150 [2019-01-12 00:55:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:37,989 INFO L480 AbstractCegarLoop]: Abstraction has 1703 states and 1867 transitions. [2019-01-12 00:55:37,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 1867 transitions. [2019-01-12 00:55:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-12 00:55:37,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:37,997 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:37,997 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:37,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:37,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1830161714, now seen corresponding path program 1 times [2019-01-12 00:55:37,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:37,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:37,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:37,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:37,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:38,401 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 00:55:38,614 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:55:38,910 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-12 00:55:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-01-12 00:55:39,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:55:39,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:55:39,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:39,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:55:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-01-12 00:55:39,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:55:39,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 00:55:39,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:55:39,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:55:39,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:55:39,400 INFO L87 Difference]: Start difference. First operand 1703 states and 1867 transitions. Second operand 8 states. [2019-01-12 00:55:42,856 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:55:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:46,447 INFO L93 Difference]: Finished difference Result 4000 states and 4372 transitions. [2019-01-12 00:55:46,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 00:55:46,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 244 [2019-01-12 00:55:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:46,449 INFO L225 Difference]: With dead ends: 4000 [2019-01-12 00:55:46,449 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:55:46,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-12 00:55:46,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:55:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:55:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:55:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:55:46,454 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2019-01-12 00:55:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:46,454 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:55:46,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:55:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:55:46,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:55:46,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:55:46,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:46,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:47,876 WARN L181 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-01-12 00:55:48,161 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-01-12 00:55:48,164 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,165 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,165 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,165 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-01-12 00:55:48,165 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-01-12 00:55:48,165 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-01-12 00:55:48,165 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-01-12 00:55:48,165 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-01-12 00:55:48,165 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-01-12 00:55:48,166 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-01-12 00:55:48,166 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,166 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,166 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,166 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-01-12 00:55:48,166 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 00:55:48,166 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-01-12 00:55:48,166 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-01-12 00:55:48,166 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:55:48,167 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:55:48,167 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-01-12 00:55:48,170 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,170 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,170 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,170 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-01-12 00:55:48,171 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-01-12 00:55:48,171 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-01-12 00:55:48,171 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 00:55:48,171 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-01-12 00:55:48,171 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,171 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,171 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,171 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-01-12 00:55:48,172 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-01-12 00:55:48,174 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-01-12 00:55:48,174 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-01-12 00:55:48,175 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-01-12 00:55:48,175 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-01-12 00:55:48,175 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-01-12 00:55:48,175 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-01-12 00:55:48,175 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,175 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,176 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,176 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-01-12 00:55:48,176 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-01-12 00:55:48,176 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-01-12 00:55:48,176 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-01-12 00:55:48,176 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-01-12 00:55:48,176 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-01-12 00:55:48,176 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-01-12 00:55:48,176 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-01-12 00:55:48,176 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,177 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,180 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,180 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:55:48,180 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:55:48,180 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:55:48,180 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:55:48,180 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-12 00:55:48,180 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-01-12 00:55:48,180 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-01-12 00:55:48,180 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-01-12 00:55:48,181 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-01-12 00:55:48,181 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 469) no Hoare annotation was computed. [2019-01-12 00:55:48,181 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,183 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,183 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,183 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-01-12 00:55:48,183 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-01-12 00:55:48,183 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-01-12 00:55:48,183 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-01-12 00:55:48,183 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-01-12 00:55:48,184 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-01-12 00:55:48,184 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,184 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,184 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,184 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-01-12 00:55:48,184 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-01-12 00:55:48,184 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-01-12 00:55:48,184 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-01-12 00:55:48,184 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-01-12 00:55:48,184 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:55:48,185 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-01-12 00:55:48,188 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-01-12 00:55:48,188 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-01-12 00:55:48,188 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,188 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,188 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,188 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 00:55:48,188 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-01-12 00:55:48,188 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 00:55:48,189 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-01-12 00:55:48,189 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-01-12 00:55:48,189 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,189 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,189 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,189 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-01-12 00:55:48,189 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-01-12 00:55:48,189 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-01-12 00:55:48,189 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-01-12 00:55:48,189 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-01-12 00:55:48,189 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-01-12 00:55:48,189 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:55:48,190 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:55:48,193 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-01-12 00:55:48,193 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-01-12 00:55:48,193 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:55:48,193 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-01-12 00:55:48,193 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,193 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,193 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-01-12 00:55:48,193 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 00:55:48,193 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-01-12 00:55:48,194 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-01-12 00:55:48,194 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-01-12 00:55:48,194 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-01-12 00:55:48,194 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:55:48,194 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:55:48,194 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-01-12 00:55:48,195 INFO L444 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1))) (let ((.cse2 (= ~a17~0 8)) (.cse5 (not (= ~a28~0 11))) (.cse3 (= ~a19~0 1)) (.cse11 (not .cse7)) (.cse10 (= ~a11~0 1))) (let ((.cse6 (or (and .cse11 .cse10 .cse5) (and .cse3 .cse11 .cse10))) (.cse9 (<= 10 ~a28~0)) (.cse4 (= ~a21~0 1)) (.cse8 (= ~a28~0 9)) (.cse0 (<= ~a19~0 0)) (.cse1 (and .cse11 .cse2))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6) (and .cse2 .cse3 .cse7) (and .cse8 .cse0) (and .cse9 .cse6) (and .cse9 .cse3 .cse7) (and .cse3 .cse10 .cse4 .cse7) (and .cse8 .cse2 .cse10) (and .cse0 .cse2 .cse5) (and .cse1 .cse10 .cse5))))) [2019-01-12 00:55:48,195 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,195 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,195 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-01-12 00:55:48,195 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-01-12 00:55:48,195 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-01-12 00:55:48,195 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-01-12 00:55:48,195 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:55:48,195 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:55:48,195 INFO L451 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-01-12 00:55:48,195 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,196 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,199 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-01-12 00:55:48,199 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-01-12 00:55:48,199 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-01-12 00:55:48,199 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-01-12 00:55:48,199 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-01-12 00:55:48,199 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-01-12 00:55:48,199 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:55:48,199 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:55:48,199 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-01-12 00:55:48,200 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,200 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,200 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:55:48,200 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:55:48,200 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-01-12 00:55:48,200 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-01-12 00:55:48,200 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-01-12 00:55:48,200 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-01-12 00:55:48,201 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1))) (let ((.cse2 (= ~a17~0 8)) (.cse5 (not (= ~a28~0 11))) (.cse3 (= ~a19~0 1)) (.cse11 (not .cse7)) (.cse10 (= ~a11~0 1))) (let ((.cse6 (or (and .cse11 .cse10 .cse5) (and .cse3 .cse11 .cse10))) (.cse9 (<= 10 ~a28~0)) (.cse4 (= ~a21~0 1)) (.cse8 (= ~a28~0 9)) (.cse0 (<= ~a19~0 0)) (.cse1 (and .cse11 .cse2))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6) (and .cse2 .cse3 .cse7) (and .cse8 .cse0) (and .cse9 .cse6) (and .cse9 .cse3 .cse7) (and .cse3 .cse10 .cse4 .cse7) (and .cse8 .cse2 .cse10) (and .cse0 .cse2 .cse5) (and .cse1 .cse10 .cse5))))) [2019-01-12 00:55:48,201 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,201 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,201 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-01-12 00:55:48,201 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-01-12 00:55:48,201 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-01-12 00:55:48,201 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-12 00:55:48,201 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-01-12 00:55:48,201 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,201 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,201 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-01-12 00:55:48,201 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-01-12 00:55:48,202 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-01-12 00:55:48,205 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-01-12 00:55:48,205 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-01-12 00:55:48,205 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-01-12 00:55:48,205 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-01-12 00:55:48,205 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:55:48,205 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:55:48,205 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,205 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,205 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 00:55:48,206 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,206 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-01-12 00:55:48,206 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-01-12 00:55:48,206 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-01-12 00:55:48,206 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-01-12 00:55:48,206 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-01-12 00:55:48,206 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:55:48,206 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-01-12 00:55:48,206 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,206 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,206 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,206 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-01-12 00:55:48,207 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-01-12 00:55:48,207 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-01-12 00:55:48,207 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-01-12 00:55:48,207 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-01-12 00:55:48,207 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,207 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,207 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,207 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-01-12 00:55:48,207 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-01-12 00:55:48,207 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-01-12 00:55:48,207 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-01-12 00:55:48,207 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-01-12 00:55:48,208 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-01-12 00:55:48,208 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,211 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,211 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,211 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-01-12 00:55:48,211 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-01-12 00:55:48,211 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-01-12 00:55:48,211 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-01-12 00:55:48,211 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-01-12 00:55:48,212 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-01-12 00:55:48,212 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:55:48,212 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-01-12 00:55:48,212 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-01-12 00:55:48,212 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,212 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,212 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,212 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-01-12 00:55:48,213 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-01-12 00:55:48,213 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-01-12 00:55:48,213 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-01-12 00:55:48,213 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-01-12 00:55:48,213 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,213 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,213 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:48,213 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-01-12 00:55:48,213 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-01-12 00:55:48,213 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-01-12 00:55:48,213 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 00:55:48,214 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-01-12 00:55:48,214 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 00:55:48,214 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:55:48,214 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-01-12 00:55:48,214 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:55:48,214 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-01-12 00:55:48,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:55:48 BoogieIcfgContainer [2019-01-12 00:55:48,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:55:48,260 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:55:48,260 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:55:48,260 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:55:48,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:55:26" (3/4) ... [2019-01-12 00:55:48,267 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:55:48,292 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:55:48,293 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:55:48,494 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:55:48,494 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:55:48,495 INFO L168 Benchmark]: Toolchain (without parser) took 26639.97 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.2 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -231.4 MB). Peak memory consumption was 139.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:48,496 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:55:48,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.75 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 917.8 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:48,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 196.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 917.8 MB in the beginning and 1.1 GB in the end (delta: -200.3 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:48,497 INFO L168 Benchmark]: Boogie Preprocessor took 70.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:48,497 INFO L168 Benchmark]: RCFGBuilder took 3469.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:48,499 INFO L168 Benchmark]: TraceAbstraction took 22035.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.2 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:48,500 INFO L168 Benchmark]: Witness Printer took 233.72 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:48,503 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.15 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 628.75 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 917.8 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 196.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 917.8 MB in the beginning and 1.1 GB in the end (delta: -200.3 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3469.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22035.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.2 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * Witness Printer took 233.72 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 469]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((a19 <= 0 && !(a25 == 1) && a17 == 8) || (((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11))) || (a19 <= 0 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || ((a19 == 1 && !(a25 == 1)) && a11 == 1)))) || ((a17 == 8 && a19 == 1) && a25 == 1)) || (a28 == 9 && a19 <= 0)) || (10 <= a28 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || ((a19 == 1 && !(a25 == 1)) && a11 == 1)))) || ((10 <= a28 && a19 == 1) && a25 == 1)) || (((a19 == 1 && a11 == 1) && a21 == 1) && a25 == 1)) || ((a28 == 9 && a17 == 8) && a11 == 1)) || ((a19 <= 0 && a17 == 8) && !(a28 == 11))) || (((!(a25 == 1) && a17 == 8) && a11 == 1) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((a19 <= 0 && !(a25 == 1) && a17 == 8) || (((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11))) || (a19 <= 0 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || ((a19 == 1 && !(a25 == 1)) && a11 == 1)))) || ((a17 == 8 && a19 == 1) && a25 == 1)) || (a28 == 9 && a19 <= 0)) || (10 <= a28 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || ((a19 == 1 && !(a25 == 1)) && a11 == 1)))) || ((10 <= a28 && a19 == 1) && a25 == 1)) || (((a19 == 1 && a11 == 1) && a21 == 1) && a25 == 1)) || ((a28 == 9 && a17 == 8) && a11 == 1)) || ((a19 <= 0 && a17 == 8) && !(a28 == 11))) || (((!(a25 == 1) && a17 == 8) && a11 == 1) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. SAFE Result, 21.9s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 16.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 989 SDtfs, 2286 SDslu, 285 SDs, 0 SdLazy, 5725 SolverSat, 946 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 260 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2272occurred in iteration=4, 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 1288 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 78 NumberOfFragments, 321 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1518 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 580 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1359 NumberOfCodeBlocks, 1359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1350 ConstructedInterpolants, 0 QuantifiedInterpolants, 442232 SizeOfPredicates, 1 NumberOfNonLiveVariables, 408 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 770/773 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...