./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label46_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/Problem01_label46_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 7a28669cb9b241f33b1fd8e4286127a35464e045 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:53:57,970 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:53:57,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:53:57,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:53:57,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:53:57,985 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:53:57,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:53:57,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:53:57,990 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:53:57,991 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:53:57,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:53:57,992 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:53:57,993 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:53:57,994 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:53:57,995 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:53:57,996 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:53:57,997 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:53:57,999 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:53:58,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:53:58,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:53:58,012 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:53:58,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:53:58,021 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:53:58,022 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:53:58,022 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:53:58,026 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:53:58,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:53:58,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:53:58,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:53:58,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:53:58,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:53:58,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:53:58,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:53:58,037 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:53:58,039 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:53:58,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:53:58,041 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:53:58,067 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:53:58,068 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:53:58,070 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:53:58,070 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:53:58,070 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:53:58,071 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:53:58,071 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:53:58,072 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:53:58,072 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:53:58,072 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:53:58,072 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:53:58,072 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:53:58,072 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:53:58,073 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:53:58,073 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:53:58,073 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:53:58,073 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:53:58,073 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:53:58,073 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:53:58,075 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:53:58,075 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:53:58,075 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:53:58,075 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:53:58,075 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:53:58,076 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:53:58,076 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:53:58,076 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:53:58,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:53:58,076 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 -> 7a28669cb9b241f33b1fd8e4286127a35464e045 [2019-01-12 00:53:58,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:53:58,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:53:58,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:53:58,159 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:53:58,160 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:53:58,161 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label46_true-unreach-call_false-termination.c [2019-01-12 00:53:58,225 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf8abf60/e87e25fae9514820870ef6f87c4ba6ad/FLAG7576e1719 [2019-01-12 00:53:58,862 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:53:58,863 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label46_true-unreach-call_false-termination.c [2019-01-12 00:53:58,879 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf8abf60/e87e25fae9514820870ef6f87c4ba6ad/FLAG7576e1719 [2019-01-12 00:53:59,093 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf8abf60/e87e25fae9514820870ef6f87c4ba6ad [2019-01-12 00:53:59,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:53:59,101 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:53:59,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:53:59,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:53:59,106 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:53:59,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:53:59" (1/1) ... [2019-01-12 00:53:59,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8b7262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:59, skipping insertion in model container [2019-01-12 00:53:59,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:53:59" (1/1) ... [2019-01-12 00:53:59,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:53:59,181 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:53:59,663 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:53:59,673 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:53:59,807 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:53:59,845 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:53:59,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:59 WrapperNode [2019-01-12 00:53:59,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:53:59,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:53:59,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:53:59,850 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:53:59,870 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:53:59" (1/1) ... [2019-01-12 00:53:59,989 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:53:59" (1/1) ... [2019-01-12 00:54:00,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:54:00,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:54:00,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:54:00,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:54:00,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:59" (1/1) ... [2019-01-12 00:54:00,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:59" (1/1) ... [2019-01-12 00:54:00,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:59" (1/1) ... [2019-01-12 00:54:00,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:59" (1/1) ... [2019-01-12 00:54:00,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:59" (1/1) ... [2019-01-12 00:54:00,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:59" (1/1) ... [2019-01-12 00:54:00,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:59" (1/1) ... [2019-01-12 00:54:00,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:54:00,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:54:00,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:54:00,172 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:54:00,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:59" (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:54:00,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:54:00,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:54:03,347 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:54:03,348 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:54:03,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:03 BoogieIcfgContainer [2019-01-12 00:54:03,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:54:03,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:54:03,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:54:03,358 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:54:03,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:53:59" (1/3) ... [2019-01-12 00:54:03,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d361fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:54:03, skipping insertion in model container [2019-01-12 00:54:03,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:59" (2/3) ... [2019-01-12 00:54:03,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d361fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:54:03, skipping insertion in model container [2019-01-12 00:54:03,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:03" (3/3) ... [2019-01-12 00:54:03,366 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label46_true-unreach-call_false-termination.c [2019-01-12 00:54:03,379 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:54:03,392 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:54:03,413 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:54:03,454 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:54:03,456 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:54:03,456 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:54:03,456 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:54:03,457 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:54:03,457 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:54:03,458 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:54:03,458 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:54:03,458 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:54:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:54:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 00:54:03,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:03,511 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] [2019-01-12 00:54:03,516 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:03,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:03,524 INFO L82 PathProgramCache]: Analyzing trace with hash -429824977, now seen corresponding path program 1 times [2019-01-12 00:54:03,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:03,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:03,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:03,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:04,261 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:54:04,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:04,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:04,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:04,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:04,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:04,292 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-01-12 00:54:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:06,825 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-01-12 00:54:06,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:54:06,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-01-12 00:54:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:06,845 INFO L225 Difference]: With dead ends: 662 [2019-01-12 00:54:06,845 INFO L226 Difference]: Without dead ends: 397 [2019-01-12 00:54:06,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 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:54:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-12 00:54:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-01-12 00:54:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-12 00:54:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-01-12 00:54:06,917 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 112 [2019-01-12 00:54:06,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:06,918 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-01-12 00:54:06,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-01-12 00:54:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 00:54:06,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:06,925 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 00:54:06,925 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:06,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:06,926 INFO L82 PathProgramCache]: Analyzing trace with hash -779345401, now seen corresponding path program 1 times [2019-01-12 00:54:06,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:06,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:06,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:06,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:06,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:07,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:07,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:07,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:07,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:07,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:07,033 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-01-12 00:54:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:08,087 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-01-12 00:54:08,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:08,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-01-12 00:54:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:08,095 INFO L225 Difference]: With dead ends: 1185 [2019-01-12 00:54:08,095 INFO L226 Difference]: Without dead ends: 790 [2019-01-12 00:54:08,099 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:54:08,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-12 00:54:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-01-12 00:54:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-01-12 00:54:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-01-12 00:54:08,141 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 117 [2019-01-12 00:54:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:08,142 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-01-12 00:54:08,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-01-12 00:54:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-12 00:54:08,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:08,150 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-01-12 00:54:08,150 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:08,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:08,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1596942927, now seen corresponding path program 1 times [2019-01-12 00:54:08,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:08,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:08,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:08,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:54:08,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:08,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:54:08,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:08,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:08,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:08,256 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-01-12 00:54:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:09,336 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-01-12 00:54:09,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:09,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-01-12 00:54:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:09,345 INFO L225 Difference]: With dead ends: 1971 [2019-01-12 00:54:09,346 INFO L226 Difference]: Without dead ends: 1183 [2019-01-12 00:54:09,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-01-12 00:54:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-01-12 00:54:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-01-12 00:54:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-01-12 00:54:09,397 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 138 [2019-01-12 00:54:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:09,397 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-01-12 00:54:09,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-01-12 00:54:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-12 00:54:09,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:09,405 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:54:09,405 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:09,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:09,407 INFO L82 PathProgramCache]: Analyzing trace with hash -901966124, now seen corresponding path program 1 times [2019-01-12 00:54:09,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:09,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:09,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:09,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:09,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-01-12 00:54:09,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:09,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:54:09,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:09,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:09,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:09,597 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-01-12 00:54:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:11,373 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-01-12 00:54:11,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:11,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-01-12 00:54:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:11,381 INFO L225 Difference]: With dead ends: 2233 [2019-01-12 00:54:11,381 INFO L226 Difference]: Without dead ends: 1314 [2019-01-12 00:54:11,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-01-12 00:54:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1052. [2019-01-12 00:54:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-12 00:54:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1370 transitions. [2019-01-12 00:54:11,414 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1370 transitions. Word has length 174 [2019-01-12 00:54:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:11,414 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1370 transitions. [2019-01-12 00:54:11,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1370 transitions. [2019-01-12 00:54:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-12 00:54:11,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:11,440 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-01-12 00:54:11,441 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1049144728, now seen corresponding path program 1 times [2019-01-12 00:54:11,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:11,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:11,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:11,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:11,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 00:54:11,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:11,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:11,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:11,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:11,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:11,668 INFO L87 Difference]: Start difference. First operand 1052 states and 1370 transitions. Second operand 4 states. [2019-01-12 00:54:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:12,394 INFO L93 Difference]: Finished difference Result 2238 states and 2892 transitions. [2019-01-12 00:54:12,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:54:12,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-01-12 00:54:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:12,400 INFO L225 Difference]: With dead ends: 2238 [2019-01-12 00:54:12,400 INFO L226 Difference]: Without dead ends: 1188 [2019-01-12 00:54:12,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:54:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2019-01-12 00:54:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1183. [2019-01-12 00:54:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-01-12 00:54:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1507 transitions. [2019-01-12 00:54:12,424 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1507 transitions. Word has length 182 [2019-01-12 00:54:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:12,425 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1507 transitions. [2019-01-12 00:54:12,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1507 transitions. [2019-01-12 00:54:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-12 00:54:12,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:12,431 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-01-12 00:54:12,431 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1750486688, now seen corresponding path program 1 times [2019-01-12 00:54:12,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:12,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:12,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:12,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 00:54:12,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:12,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:54:12,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:54:12,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:54:12,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:54:12,592 INFO L87 Difference]: Start difference. First operand 1183 states and 1507 transitions. Second operand 5 states. [2019-01-12 00:54:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:13,953 INFO L93 Difference]: Finished difference Result 2495 states and 3215 transitions. [2019-01-12 00:54:13,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:54:13,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-01-12 00:54:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:13,968 INFO L225 Difference]: With dead ends: 2495 [2019-01-12 00:54:13,968 INFO L226 Difference]: Without dead ends: 1445 [2019-01-12 00:54:13,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:54:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-01-12 00:54:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-01-12 00:54:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:54:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1799 transitions. [2019-01-12 00:54:13,998 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1799 transitions. Word has length 186 [2019-01-12 00:54:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:13,998 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1799 transitions. [2019-01-12 00:54:13,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:54:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1799 transitions. [2019-01-12 00:54:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-01-12 00:54:14,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:14,004 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-01-12 00:54:14,004 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:14,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:14,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1155794619, now seen corresponding path program 1 times [2019-01-12 00:54:14,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:14,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:14,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:14,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:14,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 00:54:14,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:14,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:14,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:14,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:14,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:14,111 INFO L87 Difference]: Start difference. First operand 1445 states and 1799 transitions. Second operand 3 states. [2019-01-12 00:54:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:14,726 INFO L93 Difference]: Finished difference Result 3148 states and 3935 transitions. [2019-01-12 00:54:14,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:14,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-01-12 00:54:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:14,728 INFO L225 Difference]: With dead ends: 3148 [2019-01-12 00:54:14,728 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:54:14,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:54:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:54:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:54:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:54:14,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 189 [2019-01-12 00:54:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:14,733 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:54:14,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:54:14,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:54:14,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:54:15,322 WARN L181 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-01-12 00:54:15,365 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:54:15,365 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:54:15,365 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,365 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,365 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,366 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,366 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,366 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,366 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:54:15,366 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:54:15,366 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:54:15,366 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:54:15,367 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:54:15,367 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:54:15,367 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:54:15,367 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:54:15,367 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:54:15,367 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:54:15,367 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,367 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,367 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,367 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,368 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,368 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,368 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:54:15,368 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:54:15,368 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:54:15,368 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:54:15,368 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:54:15,368 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:54:15,368 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:54:15,368 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:54:15,369 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:54:15,369 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:54:15,369 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:54:15,369 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:54:15,369 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:54:15,369 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:54:15,369 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:54:15,369 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,369 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,369 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,369 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,370 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,370 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:54:15,370 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:54:15,370 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:54:15,370 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:54:15,370 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:54:15,370 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:54:15,370 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:54:15,370 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:54:15,370 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:54:15,371 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (= ~a8~0 15) .cse0) (= ~a7~0 1) (and (not (= ~a16~0 6)) .cse0) (and (= ~a17~0 1) .cse0))) [2019-01-12 00:54:15,371 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,371 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,371 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,371 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,371 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,371 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:54:15,371 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:54:15,372 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:54:15,372 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:54:15,372 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:54:15,372 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:54:15,372 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:54:15,372 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:54:15,372 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:54:15,372 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:54:15,372 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:54:15,372 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:54:15,373 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:54:15,373 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:54:15,373 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,373 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,373 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,373 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,373 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,373 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:54:15,373 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:54:15,373 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:54:15,374 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:54:15,374 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:54:15,374 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:54:15,374 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:54:15,374 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:54:15,374 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:54:15,374 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,374 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,374 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,374 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,374 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:54:15,375 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,375 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:54:15,375 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:54:15,375 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:54:15,375 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:54:15,375 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:54:15,375 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:54:15,375 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:54:15,375 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:54:15,375 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:54:15,375 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:54:15,376 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:54:15,376 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:54:15,376 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:54:15,376 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:54:15,376 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,376 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (= ~a7~0 1) (and (= ~a8~0 15) .cse0) (and (not (= ~a16~0 6)) .cse0) (and (= ~a17~0 1) .cse0))) [2019-01-12 00:54:15,376 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,376 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,376 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,376 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,377 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:54:15,377 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:54:15,377 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:54:15,377 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:54:15,377 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:54:15,377 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:54:15,377 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:54:15,377 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:54:15,377 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,377 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,378 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,378 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,378 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,378 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:54:15,378 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:54:15,378 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:54:15,378 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:54:15,378 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:54:15,379 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 512) no Hoare annotation was computed. [2019-01-12 00:54:15,379 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:54:15,379 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:54:15,379 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:54:15,379 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:54:15,379 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:54:15,379 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:54:15,379 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:54:15,379 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:54:15,379 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,380 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,380 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,380 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,380 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:54:15,380 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,380 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,380 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:54:15,380 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:54:15,380 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:54:15,380 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:54:15,380 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:54:15,381 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:54:15,381 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:54:15,381 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:54:15,381 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:54:15,381 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:54:15,381 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:54:15,381 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:54:15,381 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:54:15,381 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,381 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,381 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,382 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,382 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,382 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:54:15,382 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,382 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:54:15,382 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:54:15,382 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:54:15,382 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:54:15,382 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:54:15,382 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:54:15,382 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:54:15,382 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:54:15,383 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:54:15,383 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:54:15,383 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:54:15,383 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:54:15,383 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:54:15,383 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:54:15,383 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:54:15,383 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,383 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,383 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,383 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,384 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,384 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:54:15,384 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:54:15,384 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:54:15,384 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:54:15,384 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:54:15,384 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:54:15,384 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:54:15,384 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:54:15,384 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:54:15,384 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:54:15,385 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:54:15,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:54:15 BoogieIcfgContainer [2019-01-12 00:54:15,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:54:15,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:54:15,405 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:54:15,405 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:54:15,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:03" (3/4) ... [2019-01-12 00:54:15,415 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:54:15,462 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:54:15,463 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:54:15,645 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:54:15,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:54:15,647 INFO L168 Benchmark]: Toolchain (without parser) took 16546.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.4 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -259.7 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:54:15,648 INFO L168 Benchmark]: CDTParser took 0.18 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:54:15,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.34 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.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:54:15,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 221.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:54:15,650 INFO L168 Benchmark]: Boogie Preprocessor took 95.66 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:54:15,650 INFO L168 Benchmark]: RCFGBuilder took 3181.47 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: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:54:15,651 INFO L168 Benchmark]: TraceAbstraction took 12050.67 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -225.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:54:15,651 INFO L168 Benchmark]: Witness Printer took 240.61 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:54:15,655 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.18 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 747.34 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.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 221.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.66 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3181.47 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: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12050.67 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -225.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 240.61 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 512]: 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: 30]: Loop Invariant Derived loop invariant: (((a8 == 15 && a21 == 1) || a7 == 1) || (!(a16 == 6) && a21 == 1)) || (a17 == 1 && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((a7 == 1 || (a8 == 15 && a21 == 1)) || (!(a16 == 6) && a21 == 1)) || (a17 == 1 && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 11.9s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 9.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 516 SDtfs, 1628 SDslu, 77 SDs, 0 SdLazy, 3552 SolverSat, 614 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1445occurred 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 529 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 53 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1238 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 33 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1098 NumberOfCodeBlocks, 1098 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1091 ConstructedInterpolants, 0 QuantifiedInterpolants, 307109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 652/652 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...