./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label33_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_label33_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 ccce88d3eff0bd7768fa846786a2b108ea71b0c0 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:56:02,928 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:56:02,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:56:02,942 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:56:02,942 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:56:02,943 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:56:02,945 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:56:02,947 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:56:02,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:56:02,950 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:56:02,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:56:02,951 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:56:02,952 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:56:02,953 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:56:02,955 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:56:02,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:56:02,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:56:02,958 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:56:02,961 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:56:02,963 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:56:02,964 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:56:02,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:56:02,969 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:56:02,969 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:56:02,969 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:56:02,970 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:56:02,972 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:56:02,973 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:56:02,974 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:56:02,975 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:56:02,975 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:56:02,976 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:56:02,977 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:56:02,977 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:56:02,978 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:56:02,978 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:56:02,979 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:56:02,997 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:56:02,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:56:02,998 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:56:02,998 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:56:02,999 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:56:02,999 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:56:02,999 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:56:02,999 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:56:02,999 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:56:03,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:56:03,000 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:56:03,000 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:56:03,000 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:56:03,000 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:56:03,001 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:56:03,001 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:56:03,001 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:56:03,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:56:03,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:56:03,002 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:56:03,002 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:56:03,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:56:03,002 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:56:03,002 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:56:03,003 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:56:03,003 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:56:03,003 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:56:03,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:56:03,003 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 -> ccce88d3eff0bd7768fa846786a2b108ea71b0c0 [2019-01-12 00:56:03,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:56:03,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:56:03,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:56:03,060 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:56:03,060 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:56:03,062 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label33_true-unreach-call_false-termination.c [2019-01-12 00:56:03,137 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b259053/812be244bf4b41edb938d137d9259615/FLAGc4a9fe18e [2019-01-12 00:56:03,711 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:56:03,712 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label33_true-unreach-call_false-termination.c [2019-01-12 00:56:03,727 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b259053/812be244bf4b41edb938d137d9259615/FLAGc4a9fe18e [2019-01-12 00:56:03,949 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b259053/812be244bf4b41edb938d137d9259615 [2019-01-12 00:56:03,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:56:03,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:56:03,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:56:03,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:56:03,959 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:56:03,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:56:03" (1/1) ... [2019-01-12 00:56:03,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f785cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:03, skipping insertion in model container [2019-01-12 00:56:03,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:56:03" (1/1) ... [2019-01-12 00:56:03,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:56:04,045 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:56:04,530 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:56:04,536 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:56:04,668 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:56:04,687 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:56:04,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:04 WrapperNode [2019-01-12 00:56:04,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:56:04,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:56:04,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:56:04,690 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:56:04,700 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:56:04" (1/1) ... [2019-01-12 00:56:04,800 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:56:04" (1/1) ... [2019-01-12 00:56:04,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:56:04,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:56:04,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:56:04,857 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:56:04,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:04" (1/1) ... [2019-01-12 00:56:04,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:04" (1/1) ... [2019-01-12 00:56:04,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:04" (1/1) ... [2019-01-12 00:56:04,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:04" (1/1) ... [2019-01-12 00:56:04,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:04" (1/1) ... [2019-01-12 00:56:04,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:04" (1/1) ... [2019-01-12 00:56:04,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:04" (1/1) ... [2019-01-12 00:56:04,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:56:04,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:56:04,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:56:04,940 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:56:04,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:04" (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:56:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:56:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:56:08,096 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:56:08,096 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:56:08,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:56:08 BoogieIcfgContainer [2019-01-12 00:56:08,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:56:08,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:56:08,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:56:08,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:56:08,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:56:03" (1/3) ... [2019-01-12 00:56:08,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aec4e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:56:08, skipping insertion in model container [2019-01-12 00:56:08,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:04" (2/3) ... [2019-01-12 00:56:08,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aec4e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:56:08, skipping insertion in model container [2019-01-12 00:56:08,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:56:08" (3/3) ... [2019-01-12 00:56:08,108 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label33_true-unreach-call_false-termination.c [2019-01-12 00:56:08,122 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:56:08,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:56:08,156 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:56:08,208 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:56:08,208 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:56:08,209 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:56:08,209 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:56:08,209 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:56:08,209 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:56:08,210 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:56:08,210 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:56:08,210 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:56:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-01-12 00:56:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-12 00:56:08,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:08,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:08,258 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1661240933, now seen corresponding path program 1 times [2019-01-12 00:56:08,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:08,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:08,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:08,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:08,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:08,966 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:56:08,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:08,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:08,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:08,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:08,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:08,992 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-01-12 00:56:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:11,953 INFO L93 Difference]: Finished difference Result 789 states and 1377 transitions. [2019-01-12 00:56:11,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:11,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-01-12 00:56:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:11,977 INFO L225 Difference]: With dead ends: 789 [2019-01-12 00:56:11,977 INFO L226 Difference]: Without dead ends: 465 [2019-01-12 00:56:11,982 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:56:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-01-12 00:56:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 309. [2019-01-12 00:56:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-01-12 00:56:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 453 transitions. [2019-01-12 00:56:12,045 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 453 transitions. Word has length 141 [2019-01-12 00:56:12,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:12,046 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 453 transitions. [2019-01-12 00:56:12,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2019-01-12 00:56:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-12 00:56:12,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:12,051 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:12,051 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:12,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1054345200, now seen corresponding path program 1 times [2019-01-12 00:56:12,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:12,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:12,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:56:12,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:12,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:12,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:12,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:12,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:12,380 INFO L87 Difference]: Start difference. First operand 309 states and 453 transitions. Second operand 4 states. [2019-01-12 00:56:13,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:13,590 INFO L93 Difference]: Finished difference Result 980 states and 1479 transitions. [2019-01-12 00:56:13,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:13,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-01-12 00:56:13,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:13,596 INFO L225 Difference]: With dead ends: 980 [2019-01-12 00:56:13,597 INFO L226 Difference]: Without dead ends: 590 [2019-01-12 00:56:13,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 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:56:13,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-01-12 00:56:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-01-12 00:56:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-01-12 00:56:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 788 transitions. [2019-01-12 00:56:13,651 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 788 transitions. Word has length 145 [2019-01-12 00:56:13,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:13,651 INFO L480 AbstractCegarLoop]: Abstraction has 590 states and 788 transitions. [2019-01-12 00:56:13,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 788 transitions. [2019-01-12 00:56:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-12 00:56:13,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:13,663 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:13,663 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:13,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1415455555, now seen corresponding path program 1 times [2019-01-12 00:56:13,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:13,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:13,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:13,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:13,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:13,914 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:56:13,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:13,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:13,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:13,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:13,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:13,917 INFO L87 Difference]: Start difference. First operand 590 states and 788 transitions. Second operand 4 states. [2019-01-12 00:56:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:16,446 INFO L93 Difference]: Finished difference Result 2306 states and 3087 transitions. [2019-01-12 00:56:16,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:16,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-01-12 00:56:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:16,460 INFO L225 Difference]: With dead ends: 2306 [2019-01-12 00:56:16,460 INFO L226 Difference]: Without dead ends: 1718 [2019-01-12 00:56:16,462 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:56:16,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2019-01-12 00:56:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1572. [2019-01-12 00:56:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-01-12 00:56:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 1965 transitions. [2019-01-12 00:56:16,549 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 1965 transitions. Word has length 171 [2019-01-12 00:56:16,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:16,550 INFO L480 AbstractCegarLoop]: Abstraction has 1572 states and 1965 transitions. [2019-01-12 00:56:16,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 1965 transitions. [2019-01-12 00:56:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-01-12 00:56:16,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:16,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:16,563 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:16,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:16,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1450133025, now seen corresponding path program 1 times [2019-01-12 00:56:16,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:16,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:16,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:16,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:16,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:16,887 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:56:16,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:16,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:56:16,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:16,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:16,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:16,889 INFO L87 Difference]: Start difference. First operand 1572 states and 1965 transitions. Second operand 4 states. [2019-01-12 00:56:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:18,484 INFO L93 Difference]: Finished difference Result 4277 states and 5403 transitions. [2019-01-12 00:56:18,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:18,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-01-12 00:56:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:18,498 INFO L225 Difference]: With dead ends: 4277 [2019-01-12 00:56:18,498 INFO L226 Difference]: Without dead ends: 2707 [2019-01-12 00:56:18,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:56:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2019-01-12 00:56:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 1855. [2019-01-12 00:56:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1855 states. [2019-01-12 00:56:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 2281 transitions. [2019-01-12 00:56:18,546 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 2281 transitions. Word has length 179 [2019-01-12 00:56:18,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:18,546 INFO L480 AbstractCegarLoop]: Abstraction has 1855 states and 2281 transitions. [2019-01-12 00:56:18,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2281 transitions. [2019-01-12 00:56:18,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-12 00:56:18,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:18,551 INFO L402 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:18,552 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:18,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:18,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1779473924, now seen corresponding path program 1 times [2019-01-12 00:56:18,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:18,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:18,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:56:18,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:56:18,765 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:56:18,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:18,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:56:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-01-12 00:56:19,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:56:19,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-01-12 00:56:19,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:56:19,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:56:19,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:56:19,147 INFO L87 Difference]: Start difference. First operand 1855 states and 2281 transitions. Second operand 8 states. [2019-01-12 00:56:20,327 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:56:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:22,860 INFO L93 Difference]: Finished difference Result 5304 states and 6429 transitions. [2019-01-12 00:56:22,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 00:56:22,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-01-12 00:56:22,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:22,877 INFO L225 Difference]: With dead ends: 5304 [2019-01-12 00:56:22,877 INFO L226 Difference]: Without dead ends: 2734 [2019-01-12 00:56:22,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-12 00:56:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2019-01-12 00:56:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2272. [2019-01-12 00:56:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2019-01-12 00:56:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2692 transitions. [2019-01-12 00:56:22,938 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2692 transitions. Word has length 182 [2019-01-12 00:56:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:22,939 INFO L480 AbstractCegarLoop]: Abstraction has 2272 states and 2692 transitions. [2019-01-12 00:56:22,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:56:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2692 transitions. [2019-01-12 00:56:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-12 00:56:22,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:22,946 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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:56:22,946 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:22,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:22,946 INFO L82 PathProgramCache]: Analyzing trace with hash -145232336, now seen corresponding path program 1 times [2019-01-12 00:56:22,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:22,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:22,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-12 00:56:23,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:23,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:56:23,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:23,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:23,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:23,346 INFO L87 Difference]: Start difference. First operand 2272 states and 2692 transitions. Second operand 4 states. [2019-01-12 00:56:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:27,866 INFO L93 Difference]: Finished difference Result 5527 states and 6546 transitions. [2019-01-12 00:56:27,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:27,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-01-12 00:56:27,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:27,908 INFO L225 Difference]: With dead ends: 5527 [2019-01-12 00:56:27,908 INFO L226 Difference]: Without dead ends: 3257 [2019-01-12 00:56:27,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2019-01-12 00:56:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 2832. [2019-01-12 00:56:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2832 states. [2019-01-12 00:56:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 3311 transitions. [2019-01-12 00:56:27,969 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 3311 transitions. Word has length 230 [2019-01-12 00:56:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:27,969 INFO L480 AbstractCegarLoop]: Abstraction has 2832 states and 3311 transitions. [2019-01-12 00:56:27,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 3311 transitions. [2019-01-12 00:56:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-12 00:56:27,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:27,980 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 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:56:27,980 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:27,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1466457463, now seen corresponding path program 1 times [2019-01-12 00:56:27,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:27,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:27,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:27,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:27,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:28,302 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 00:56:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-12 00:56:28,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:28,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:56:28,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:28,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:28,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:28,411 INFO L87 Difference]: Start difference. First operand 2832 states and 3311 transitions. Second operand 4 states. [2019-01-12 00:56:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:29,277 INFO L93 Difference]: Finished difference Result 5521 states and 6467 transitions. [2019-01-12 00:56:29,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:29,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-01-12 00:56:29,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:29,278 INFO L225 Difference]: With dead ends: 5521 [2019-01-12 00:56:29,278 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:56:29,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:56:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:56:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:56:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:56:29,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2019-01-12 00:56:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:29,286 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:56:29,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:56:29,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:56:29,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:56:29,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:56:29,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:56:30,478 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 80 DAG size of output: 28 [2019-01-12 00:56:30,705 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 28 [2019-01-12 00:56:30,708 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,709 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,709 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,709 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-01-12 00:56:30,709 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-01-12 00:56:30,709 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-01-12 00:56:30,709 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-01-12 00:56:30,709 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-01-12 00:56:30,709 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-01-12 00:56:30,709 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-01-12 00:56:30,709 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,710 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,710 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,710 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-01-12 00:56:30,710 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 00:56:30,710 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-01-12 00:56:30,710 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-01-12 00:56:30,710 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:56:30,710 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:56:30,710 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-01-12 00:56:30,710 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,711 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,711 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,711 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-01-12 00:56:30,711 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-01-12 00:56:30,711 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-01-12 00:56:30,711 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 00:56:30,711 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-01-12 00:56:30,711 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,711 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,711 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,712 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-01-12 00:56:30,712 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-01-12 00:56:30,712 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-01-12 00:56:30,712 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-01-12 00:56:30,712 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-01-12 00:56:30,712 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-01-12 00:56:30,712 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-01-12 00:56:30,712 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-01-12 00:56:30,712 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,713 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,713 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,713 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-01-12 00:56:30,713 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-01-12 00:56:30,713 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-01-12 00:56:30,713 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-01-12 00:56:30,713 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-01-12 00:56:30,713 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-01-12 00:56:30,713 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-01-12 00:56:30,713 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-01-12 00:56:30,714 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,714 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,714 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,714 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:56:30,714 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:56:30,714 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:56:30,714 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:56:30,714 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-12 00:56:30,714 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-01-12 00:56:30,714 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-01-12 00:56:30,714 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-01-12 00:56:30,715 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-01-12 00:56:30,715 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,715 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,715 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,715 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-01-12 00:56:30,715 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-01-12 00:56:30,715 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-01-12 00:56:30,715 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-01-12 00:56:30,715 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-01-12 00:56:30,716 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-01-12 00:56:30,716 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,716 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,716 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,716 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-01-12 00:56:30,716 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-01-12 00:56:30,716 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-01-12 00:56:30,716 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-01-12 00:56:30,716 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-01-12 00:56:30,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:56:30,717 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-01-12 00:56:30,717 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-01-12 00:56:30,717 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-01-12 00:56:30,717 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,717 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,717 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,717 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 00:56:30,717 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-01-12 00:56:30,717 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 00:56:30,717 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-01-12 00:56:30,718 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-01-12 00:56:30,718 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,718 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,718 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,718 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-01-12 00:56:30,718 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-01-12 00:56:30,718 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-01-12 00:56:30,718 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-01-12 00:56:30,718 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-01-12 00:56:30,718 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-01-12 00:56:30,719 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:56:30,719 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:56:30,719 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-01-12 00:56:30,719 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-01-12 00:56:30,719 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:56:30,719 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-01-12 00:56:30,719 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,719 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,719 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-01-12 00:56:30,719 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 00:56:30,720 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-01-12 00:56:30,720 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-01-12 00:56:30,720 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-01-12 00:56:30,720 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-01-12 00:56:30,720 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:56:30,720 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:56:30,720 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-01-12 00:56:30,721 INFO L444 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse3 (not .cse0)) (.cse1 (= ~a21~0 1)) (.cse4 (not (= ~a25~0 1))) (.cse2 (not (= ~a28~0 9)))) (or (and (= ~a17~0 8) .cse0 .cse1) (and (<= 8 ~a17~0) .cse2) (and .cse3 .cse4) (and .cse3 (= ~a11~0 1) .cse1) (and .cse4 .cse2) (and (not (= ~a28~0 8)) .cse2)))) [2019-01-12 00:56:30,721 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,721 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,721 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-01-12 00:56:30,721 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-01-12 00:56:30,721 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-01-12 00:56:30,721 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-01-12 00:56:30,721 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:56:30,721 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:56:30,722 INFO L451 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-01-12 00:56:30,722 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,722 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,722 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-01-12 00:56:30,722 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-01-12 00:56:30,722 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-01-12 00:56:30,722 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-01-12 00:56:30,722 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-01-12 00:56:30,722 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-01-12 00:56:30,722 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:56:30,722 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:56:30,723 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-01-12 00:56:30,723 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,723 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,723 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:56:30,723 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:56:30,723 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-01-12 00:56:30,723 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-01-12 00:56:30,723 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-01-12 00:56:30,723 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-01-12 00:56:30,723 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse3 (not .cse0)) (.cse1 (= ~a21~0 1)) (.cse4 (not (= ~a25~0 1))) (.cse2 (not (= ~a28~0 9)))) (or (and (= ~a17~0 8) .cse0 .cse1) (and (<= 8 ~a17~0) .cse2) (and .cse3 .cse4) (and .cse3 (= ~a11~0 1) .cse1) (and .cse4 .cse2) (and (not (= ~a28~0 8)) .cse2)))) [2019-01-12 00:56:30,724 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,724 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,724 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-01-12 00:56:30,724 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-01-12 00:56:30,724 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-01-12 00:56:30,724 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-12 00:56:30,724 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-01-12 00:56:30,724 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,724 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,724 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-01-12 00:56:30,725 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-01-12 00:56:30,725 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-01-12 00:56:30,725 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-01-12 00:56:30,725 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-01-12 00:56:30,725 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-01-12 00:56:30,725 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-01-12 00:56:30,725 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:56:30,725 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:56:30,725 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,725 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,726 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 00:56:30,726 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,726 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-01-12 00:56:30,726 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-01-12 00:56:30,726 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-01-12 00:56:30,726 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-01-12 00:56:30,726 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-01-12 00:56:30,726 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:56:30,726 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-01-12 00:56:30,726 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 595) no Hoare annotation was computed. [2019-01-12 00:56:30,727 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,727 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,727 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-01-12 00:56:30,727 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-01-12 00:56:30,727 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-01-12 00:56:30,727 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-01-12 00:56:30,727 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-01-12 00:56:30,727 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,727 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,727 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,727 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-01-12 00:56:30,728 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-01-12 00:56:30,728 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-01-12 00:56:30,728 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-01-12 00:56:30,728 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-01-12 00:56:30,728 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-01-12 00:56:30,728 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,728 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,728 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,728 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-01-12 00:56:30,728 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-01-12 00:56:30,728 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-01-12 00:56:30,729 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-01-12 00:56:30,729 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-01-12 00:56:30,729 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-01-12 00:56:30,729 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:56:30,729 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-01-12 00:56:30,729 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-01-12 00:56:30,729 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,729 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,729 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,729 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-01-12 00:56:30,729 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-01-12 00:56:30,730 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-01-12 00:56:30,730 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-01-12 00:56:30,730 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-01-12 00:56:30,730 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,730 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,730 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:30,730 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-01-12 00:56:30,730 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-01-12 00:56:30,730 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-01-12 00:56:30,730 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 00:56:30,730 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-01-12 00:56:30,730 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 00:56:30,731 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:56:30,731 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-01-12 00:56:30,731 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:56:30,731 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-01-12 00:56:30,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:56:30 BoogieIcfgContainer [2019-01-12 00:56:30,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:56:30,755 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:56:30,755 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:56:30,755 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:56:30,756 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:56:08" (3/4) ... [2019-01-12 00:56:30,764 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:56:30,802 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:56:30,804 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:56:30,970 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:56:30,971 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:56:30,972 INFO L168 Benchmark]: Toolchain (without parser) took 27017.99 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 361.2 MB). Free memory was 948.7 MB in the beginning and 961.2 MB in the end (delta: -12.5 MB). Peak memory consumption was 348.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:30,972 INFO L168 Benchmark]: CDTParser took 0.19 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:56:30,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.31 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 916.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:30,973 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -209.7 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:30,973 INFO L168 Benchmark]: Boogie Preprocessor took 82.25 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:30,974 INFO L168 Benchmark]: RCFGBuilder took 3159.11 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: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:30,974 INFO L168 Benchmark]: TraceAbstraction took 22655.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.3 MB). Free memory was 1.0 GB in the beginning and 982.8 MB in the end (delta: 32.5 MB). Peak memory consumption was 254.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:30,974 INFO L168 Benchmark]: Witness Printer took 215.92 ms. Allocated memory is still 1.4 GB. Free memory was 982.8 MB in the beginning and 961.2 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:30,977 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.19 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 733.31 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 916.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 166.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -209.7 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.25 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3159.11 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: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22655.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.3 MB). Free memory was 1.0 GB in the beginning and 982.8 MB in the end (delta: 32.5 MB). Peak memory consumption was 254.8 MB. Max. memory is 11.5 GB. * Witness Printer took 215.92 ms. Allocated memory is still 1.4 GB. Free memory was 982.8 MB in the beginning and 961.2 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 595]: 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: ((((((a17 == 8 && a19 == 1) && a21 == 1) || (8 <= a17 && !(a28 == 9))) || (!(a19 == 1) && !(a25 == 1))) || ((!(a19 == 1) && a11 == 1) && a21 == 1)) || (!(a25 == 1) && !(a28 == 9))) || (!(a28 == 8) && !(a28 == 9)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((a17 == 8 && a19 == 1) && a21 == 1) || (8 <= a17 && !(a28 == 9))) || (!(a19 == 1) && !(a25 == 1))) || ((!(a19 == 1) && a11 == 1) && a21 == 1)) || (!(a25 == 1) && !(a28 == 9))) || (!(a28 == 8) && !(a28 == 9)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. SAFE Result, 22.5s OverallTime, 7 OverallIterations, 5 TraceHistogramMax, 17.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 604 SDtfs, 2196 SDslu, 283 SDs, 0 SdLazy, 5522 SolverSat, 1327 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 190 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2832occurred in iteration=6, 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, 7 MinimizatonAttempts, 2041 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 66 NumberOfFragments, 115 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2346 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1494 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1482 NumberOfCodeBlocks, 1482 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1474 ConstructedInterpolants, 0 QuantifiedInterpolants, 805827 SizeOfPredicates, 1 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 534/537 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...