./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stateful01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/pthread/stateful01-2.i -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 a4a47048478df3e0b96f55978373f0c6fcefc18a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 19:06:49,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 19:06:49,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 19:06:49,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 19:06:49,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 19:06:49,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 19:06:49,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 19:06:49,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 19:06:49,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 19:06:49,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 19:06:49,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 19:06:49,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 19:06:49,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 19:06:49,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 19:06:49,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 19:06:49,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 19:06:49,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 19:06:49,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 19:06:49,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 19:06:49,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 19:06:49,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 19:06:49,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 19:06:49,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 19:06:49,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 19:06:49,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 19:06:49,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 19:06:49,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 19:06:49,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 19:06:49,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 19:06:49,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 19:06:49,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 19:06:49,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 19:06:49,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 19:06:49,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 19:06:49,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 19:06:49,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 19:06:49,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 19:06:49,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 19:06:49,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 19:06:49,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 19:06:49,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 19:06:49,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 19:06:49,263 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 19:06:49,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 19:06:49,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 19:06:49,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 19:06:49,266 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 19:06:49,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 19:06:49,267 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 19:06:49,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 19:06:49,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 19:06:49,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 19:06:49,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 19:06:49,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 19:06:49,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 19:06:49,269 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 19:06:49,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 19:06:49,270 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 19:06:49,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 19:06:49,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 19:06:49,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 19:06:49,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 19:06:49,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 19:06:49,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 19:06:49,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 19:06:49,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 19:06:49,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 19:06:49,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 19:06:49,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 19:06:49,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 19:06:49,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> a4a47048478df3e0b96f55978373f0c6fcefc18a [2019-11-19 19:06:49,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 19:06:49,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 19:06:49,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 19:06:49,627 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 19:06:49,628 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 19:06:49,628 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stateful01-2.i [2019-11-19 19:06:49,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616815fa3/4c1b548692ec44f7bb83ee002ca9dfb5/FLAGad174a6bd [2019-11-19 19:06:50,283 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 19:06:50,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stateful01-2.i [2019-11-19 19:06:50,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616815fa3/4c1b548692ec44f7bb83ee002ca9dfb5/FLAGad174a6bd [2019-11-19 19:06:50,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616815fa3/4c1b548692ec44f7bb83ee002ca9dfb5 [2019-11-19 19:06:50,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 19:06:50,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 19:06:50,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 19:06:50,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 19:06:50,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 19:06:50,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:06:50" (1/1) ... [2019-11-19 19:06:50,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfeabe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:50, skipping insertion in model container [2019-11-19 19:06:50,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:06:50" (1/1) ... [2019-11-19 19:06:50,562 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 19:06:50,619 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 19:06:51,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:06:51,117 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 19:06:51,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:06:51,261 INFO L192 MainTranslator]: Completed translation [2019-11-19 19:06:51,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:51 WrapperNode [2019-11-19 19:06:51,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 19:06:51,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 19:06:51,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 19:06:51,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 19:06:51,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:51" (1/1) ... [2019-11-19 19:06:51,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:51" (1/1) ... [2019-11-19 19:06:51,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 19:06:51,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 19:06:51,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 19:06:51,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 19:06:51,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:51" (1/1) ... [2019-11-19 19:06:51,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:51" (1/1) ... [2019-11-19 19:06:51,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:51" (1/1) ... [2019-11-19 19:06:51,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:51" (1/1) ... [2019-11-19 19:06:51,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:51" (1/1) ... [2019-11-19 19:06:51,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:51" (1/1) ... [2019-11-19 19:06:51,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:51" (1/1) ... [2019-11-19 19:06:51,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 19:06:51,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 19:06:51,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 19:06:51,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 19:06:51,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:51" (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-11-19 19:06:51,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 19:06:51,411 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-11-19 19:06:51,411 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-11-19 19:06:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-11-19 19:06:51,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-11-19 19:06:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 19:06:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-11-19 19:06:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 19:06:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 19:06:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 19:06:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 19:06:51,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 19:06:51,416 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-19 19:06:51,953 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 19:06:51,953 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 19:06:51,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:06:51 BoogieIcfgContainer [2019-11-19 19:06:51,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 19:06:51,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 19:06:51,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 19:06:51,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 19:06:51,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:06:50" (1/3) ... [2019-11-19 19:06:51,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebedf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:06:51, skipping insertion in model container [2019-11-19 19:06:51,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:06:51" (2/3) ... [2019-11-19 19:06:51,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebedf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:06:51, skipping insertion in model container [2019-11-19 19:06:51,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:06:51" (3/3) ... [2019-11-19 19:06:51,962 INFO L109 eAbstractionObserver]: Analyzing ICFG stateful01-2.i [2019-11-19 19:06:52,006 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,007 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,007 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,007 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,008 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,008 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,008 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,010 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,011 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,011 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,012 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,012 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,012 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,013 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,013 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,014 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,015 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,015 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,015 WARN L315 ript$VariableManager]: TermVariabe thread1Thread2of3ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,015 WARN L315 ript$VariableManager]: TermVariabe thread1Thread2of3ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,016 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,017 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,017 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,017 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,018 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,018 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,019 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,020 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,020 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,021 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,021 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,022 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread2of3ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,022 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,022 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,023 WARN L315 ript$VariableManager]: TermVariabe thread1Thread3of3ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,023 WARN L315 ript$VariableManager]: TermVariabe thread1Thread3of3ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,023 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,023 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,024 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,024 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,024 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,024 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,025 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,025 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,025 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,025 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,026 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,026 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread3of3ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,027 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread2of3ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,027 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread2of3ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,027 WARN L315 ript$VariableManager]: TermVariabe thread2Thread2of3ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,027 WARN L315 ript$VariableManager]: TermVariabe thread2Thread2of3ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,027 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread2of3ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,028 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread2of3ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,028 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread2of3ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,028 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread2of3ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,029 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread2of3ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,029 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread2of3ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,029 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread3of3ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,029 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread3of3ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,030 WARN L315 ript$VariableManager]: TermVariabe thread2Thread3of3ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,030 WARN L315 ript$VariableManager]: TermVariabe thread2Thread3of3ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,030 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread3of3ForFork5_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,030 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread3of3ForFork5_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,031 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread3of3ForFork5_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,031 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread3of3ForFork5_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,031 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread3of3ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,032 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread3of3ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,032 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,032 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,032 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,033 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,033 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of3ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,033 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of3ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,033 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of3ForFork1_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,034 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of3ForFork1_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,034 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,034 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:06:52,086 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-19 19:06:52,086 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 19:06:52,100 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 19:06:52,114 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 19:06:52,131 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 19:06:52,131 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 19:06:52,131 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 19:06:52,132 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 19:06:52,132 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 19:06:52,132 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 19:06:52,132 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 19:06:52,132 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 19:06:52,145 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143 places, 139 transitions [2019-11-19 19:06:52,575 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5618 states. [2019-11-19 19:06:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 5618 states. [2019-11-19 19:06:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 19:06:52,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:06:52,633 INFO L410 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] [2019-11-19 19:06:52,634 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:06:52,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:06:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1227361952, now seen corresponding path program 1 times [2019-11-19 19:06:52,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:06:52,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384168236] [2019-11-19 19:06:52,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:06:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:06:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:06:52,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384168236] [2019-11-19 19:06:52,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:06:52,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 19:06:52,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99611334] [2019-11-19 19:06:53,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:06:53,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:06:53,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:06:53,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:06:53,019 INFO L87 Difference]: Start difference. First operand 5618 states. Second operand 3 states. [2019-11-19 19:06:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:06:53,346 INFO L93 Difference]: Finished difference Result 3998 states and 8958 transitions. [2019-11-19 19:06:53,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:06:53,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-19 19:06:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:06:53,395 INFO L225 Difference]: With dead ends: 3998 [2019-11-19 19:06:53,395 INFO L226 Difference]: Without dead ends: 3990 [2019-11-19 19:06:53,397 INFO L630 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-11-19 19:06:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2019-11-19 19:06:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3990. [2019-11-19 19:06:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3990 states. [2019-11-19 19:06:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 8950 transitions. [2019-11-19 19:06:53,635 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 8950 transitions. Word has length 64 [2019-11-19 19:06:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:06:53,637 INFO L462 AbstractCegarLoop]: Abstraction has 3990 states and 8950 transitions. [2019-11-19 19:06:53,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:06:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 8950 transitions. [2019-11-19 19:06:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 19:06:53,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:06:53,654 INFO L410 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] [2019-11-19 19:06:53,654 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:06:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:06:53,655 INFO L82 PathProgramCache]: Analyzing trace with hash 439107042, now seen corresponding path program 2 times [2019-11-19 19:06:53,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:06:53,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269512575] [2019-11-19 19:06:53,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:06:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:06:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:06:53,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269512575] [2019-11-19 19:06:53,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:06:53,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 19:06:53,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678862919] [2019-11-19 19:06:53,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 19:06:53,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:06:53,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 19:06:53,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 19:06:53,811 INFO L87 Difference]: Start difference. First operand 3990 states and 8950 transitions. Second operand 5 states. [2019-11-19 19:06:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:06:53,940 INFO L93 Difference]: Finished difference Result 4102 states and 9126 transitions. [2019-11-19 19:06:53,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 19:06:53,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-19 19:06:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:06:53,966 INFO L225 Difference]: With dead ends: 4102 [2019-11-19 19:06:53,966 INFO L226 Difference]: Without dead ends: 4054 [2019-11-19 19:06:53,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:06:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2019-11-19 19:06:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 3942. [2019-11-19 19:06:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3942 states. [2019-11-19 19:06:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 8824 transitions. [2019-11-19 19:06:54,138 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 8824 transitions. Word has length 64 [2019-11-19 19:06:54,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:06:54,139 INFO L462 AbstractCegarLoop]: Abstraction has 3942 states and 8824 transitions. [2019-11-19 19:06:54,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 19:06:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 8824 transitions. [2019-11-19 19:06:54,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 19:06:54,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:06:54,237 INFO L410 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] [2019-11-19 19:06:54,237 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:06:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:06:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2042883388, now seen corresponding path program 1 times [2019-11-19 19:06:54,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:06:54,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641508423] [2019-11-19 19:06:54,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:06:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:06:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:06:54,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641508423] [2019-11-19 19:06:54,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:06:54,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 19:06:54,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564250735] [2019-11-19 19:06:54,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 19:06:54,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:06:54,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 19:06:54,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:06:54,480 INFO L87 Difference]: Start difference. First operand 3942 states and 8824 transitions. Second operand 6 states. [2019-11-19 19:06:54,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:06:54,630 INFO L93 Difference]: Finished difference Result 4484 states and 9956 transitions. [2019-11-19 19:06:54,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 19:06:54,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-19 19:06:54,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:06:54,657 INFO L225 Difference]: With dead ends: 4484 [2019-11-19 19:06:54,657 INFO L226 Difference]: Without dead ends: 3540 [2019-11-19 19:06:54,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:06:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3540 states. [2019-11-19 19:06:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3540 to 3540. [2019-11-19 19:06:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3540 states. [2019-11-19 19:06:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 7881 transitions. [2019-11-19 19:06:54,768 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 7881 transitions. Word has length 64 [2019-11-19 19:06:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:06:54,769 INFO L462 AbstractCegarLoop]: Abstraction has 3540 states and 7881 transitions. [2019-11-19 19:06:54,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 19:06:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 7881 transitions. [2019-11-19 19:06:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 19:06:54,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:06:54,782 INFO L410 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] [2019-11-19 19:06:54,782 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:06:54,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:06:54,783 INFO L82 PathProgramCache]: Analyzing trace with hash 420226108, now seen corresponding path program 2 times [2019-11-19 19:06:54,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:06:54,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976120133] [2019-11-19 19:06:54,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:06:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:06:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:06:54,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976120133] [2019-11-19 19:06:54,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:06:54,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 19:06:54,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874751757] [2019-11-19 19:06:54,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 19:06:54,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:06:54,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 19:06:54,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:06:54,968 INFO L87 Difference]: Start difference. First operand 3540 states and 7881 transitions. Second operand 6 states. [2019-11-19 19:06:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:06:55,089 INFO L93 Difference]: Finished difference Result 3605 states and 7981 transitions. [2019-11-19 19:06:55,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 19:06:55,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-19 19:06:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:06:55,104 INFO L225 Difference]: With dead ends: 3605 [2019-11-19 19:06:55,104 INFO L226 Difference]: Without dead ends: 2706 [2019-11-19 19:06:55,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:06:55,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2019-11-19 19:06:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2706. [2019-11-19 19:06:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2019-11-19 19:06:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 6034 transitions. [2019-11-19 19:06:55,176 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 6034 transitions. Word has length 64 [2019-11-19 19:06:55,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:06:55,176 INFO L462 AbstractCegarLoop]: Abstraction has 2706 states and 6034 transitions. [2019-11-19 19:06:55,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 19:06:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 6034 transitions. [2019-11-19 19:06:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 19:06:55,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:06:55,186 INFO L410 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] [2019-11-19 19:06:55,187 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:06:55,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:06:55,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1189876653, now seen corresponding path program 1 times [2019-11-19 19:06:55,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:06:55,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125805270] [2019-11-19 19:06:55,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:06:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:06:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:06:55,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125805270] [2019-11-19 19:06:55,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:06:55,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 19:06:55,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114068184] [2019-11-19 19:06:55,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 19:06:55,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:06:55,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 19:06:55,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 19:06:55,275 INFO L87 Difference]: Start difference. First operand 2706 states and 6034 transitions. Second operand 5 states. [2019-11-19 19:06:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:06:55,358 INFO L93 Difference]: Finished difference Result 2818 states and 6210 transitions. [2019-11-19 19:06:55,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 19:06:55,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-19 19:06:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:06:55,376 INFO L225 Difference]: With dead ends: 2818 [2019-11-19 19:06:55,376 INFO L226 Difference]: Without dead ends: 2770 [2019-11-19 19:06:55,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:06:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2019-11-19 19:06:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2658. [2019-11-19 19:06:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-11-19 19:06:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 5908 transitions. [2019-11-19 19:06:55,446 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 5908 transitions. Word has length 64 [2019-11-19 19:06:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:06:55,447 INFO L462 AbstractCegarLoop]: Abstraction has 2658 states and 5908 transitions. [2019-11-19 19:06:55,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 19:06:55,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 5908 transitions. [2019-11-19 19:06:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 19:06:55,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:06:55,455 INFO L410 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] [2019-11-19 19:06:55,455 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:06:55,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:06:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash 585071127, now seen corresponding path program 1 times [2019-11-19 19:06:55,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:06:55,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472695135] [2019-11-19 19:06:55,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:06:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:06:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:06:55,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472695135] [2019-11-19 19:06:55,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:06:55,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 19:06:55,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043955423] [2019-11-19 19:06:55,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 19:06:55,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:06:55,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 19:06:55,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:06:55,611 INFO L87 Difference]: Start difference. First operand 2658 states and 5908 transitions. Second operand 6 states. [2019-11-19 19:06:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:06:55,708 INFO L93 Difference]: Finished difference Result 3200 states and 7040 transitions. [2019-11-19 19:06:55,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 19:06:55,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-19 19:06:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:06:55,722 INFO L225 Difference]: With dead ends: 3200 [2019-11-19 19:06:55,722 INFO L226 Difference]: Without dead ends: 2256 [2019-11-19 19:06:55,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:06:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2019-11-19 19:06:55,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2256. [2019-11-19 19:06:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2256 states. [2019-11-19 19:06:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 4965 transitions. [2019-11-19 19:06:55,786 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 4965 transitions. Word has length 64 [2019-11-19 19:06:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:06:55,786 INFO L462 AbstractCegarLoop]: Abstraction has 2256 states and 4965 transitions. [2019-11-19 19:06:55,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 19:06:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 4965 transitions. [2019-11-19 19:06:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 19:06:55,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:06:55,794 INFO L410 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] [2019-11-19 19:06:55,794 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:06:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:06:55,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1131787671, now seen corresponding path program 2 times [2019-11-19 19:06:55,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:06:55,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641088520] [2019-11-19 19:06:55,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:06:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:06:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:06:55,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641088520] [2019-11-19 19:06:55,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:06:55,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 19:06:55,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840017840] [2019-11-19 19:06:55,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 19:06:55,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:06:55,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 19:06:55,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:06:55,896 INFO L87 Difference]: Start difference. First operand 2256 states and 4965 transitions. Second operand 6 states. [2019-11-19 19:06:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:06:55,986 INFO L93 Difference]: Finished difference Result 2321 states and 5065 transitions. [2019-11-19 19:06:55,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 19:06:55,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-19 19:06:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:06:56,001 INFO L225 Difference]: With dead ends: 2321 [2019-11-19 19:06:56,002 INFO L226 Difference]: Without dead ends: 1422 [2019-11-19 19:06:56,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:06:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2019-11-19 19:06:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2019-11-19 19:06:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-11-19 19:06:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 3118 transitions. [2019-11-19 19:06:56,051 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 3118 transitions. Word has length 64 [2019-11-19 19:06:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:06:56,052 INFO L462 AbstractCegarLoop]: Abstraction has 1422 states and 3118 transitions. [2019-11-19 19:06:56,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 19:06:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 3118 transitions. [2019-11-19 19:06:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 19:06:56,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:06:56,062 INFO L410 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] [2019-11-19 19:06:56,062 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:06:56,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:06:56,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1555429360, now seen corresponding path program 1 times [2019-11-19 19:06:56,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:06:56,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090342590] [2019-11-19 19:06:56,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:06:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:06:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:06:56,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090342590] [2019-11-19 19:06:56,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:06:56,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 19:06:56,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765814084] [2019-11-19 19:06:56,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 19:06:56,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:06:56,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 19:06:56,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:06:56,212 INFO L87 Difference]: Start difference. First operand 1422 states and 3118 transitions. Second operand 6 states. [2019-11-19 19:06:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:06:56,312 INFO L93 Difference]: Finished difference Result 1946 states and 4245 transitions. [2019-11-19 19:06:56,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 19:06:56,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-19 19:06:56,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:06:56,317 INFO L225 Difference]: With dead ends: 1946 [2019-11-19 19:06:56,318 INFO L226 Difference]: Without dead ends: 975 [2019-11-19 19:06:56,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:06:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2019-11-19 19:06:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2019-11-19 19:06:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-11-19 19:06:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 2100 transitions. [2019-11-19 19:06:56,353 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 2100 transitions. Word has length 64 [2019-11-19 19:06:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:06:56,354 INFO L462 AbstractCegarLoop]: Abstraction has 975 states and 2100 transitions. [2019-11-19 19:06:56,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 19:06:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 2100 transitions. [2019-11-19 19:06:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 19:06:56,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:06:56,359 INFO L410 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] [2019-11-19 19:06:56,359 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:06:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:06:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2044401336, now seen corresponding path program 2 times [2019-11-19 19:06:56,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:06:56,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394108602] [2019-11-19 19:06:56,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:06:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:06:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:06:56,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394108602] [2019-11-19 19:06:56,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:06:56,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 19:06:56,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310286809] [2019-11-19 19:06:56,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 19:06:56,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:06:56,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 19:06:56,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:06:56,498 INFO L87 Difference]: Start difference. First operand 975 states and 2100 transitions. Second operand 6 states. [2019-11-19 19:06:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:06:56,559 INFO L93 Difference]: Finished difference Result 973 states and 2098 transitions. [2019-11-19 19:06:56,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 19:06:56,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-19 19:06:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:06:56,560 INFO L225 Difference]: With dead ends: 973 [2019-11-19 19:06:56,561 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 19:06:56,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:06:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 19:06:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 19:06:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 19:06:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 19:06:56,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2019-11-19 19:06:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:06:56,563 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 19:06:56,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 19:06:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 19:06:56,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 19:06:56,567 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-19 19:06:56,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:06:56 BasicIcfg [2019-11-19 19:06:56,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 19:06:56,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 19:06:56,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 19:06:56,571 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 19:06:56,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:06:51" (3/4) ... [2019-11-19 19:06:56,576 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 19:06:56,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2019-11-19 19:06:56,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2019-11-19 19:06:56,614 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-19 19:06:56,614 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 19:06:56,685 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 19:06:56,685 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 19:06:56,690 INFO L168 Benchmark]: Toolchain (without parser) took 6145.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 253.8 MB). Free memory was 960.4 MB in the beginning and 830.3 MB in the end (delta: 130.1 MB). Peak memory consumption was 383.8 MB. Max. memory is 11.5 GB. [2019-11-19 19:06:56,691 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:06:56,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -123.6 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-11-19 19:06:56,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 19:06:56,693 INFO L168 Benchmark]: Boogie Preprocessor took 28.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:06:56,693 INFO L168 Benchmark]: RCFGBuilder took 614.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-11-19 19:06:56,697 INFO L168 Benchmark]: TraceAbstraction took 4615.01 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 830.3 MB in the end (delta: 221.8 MB). Peak memory consumption was 360.2 MB. Max. memory is 11.5 GB. [2019-11-19 19:06:56,697 INFO L168 Benchmark]: Witness Printer took 116.80 ms. Allocated memory is still 1.3 GB. Free memory is still 830.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:06:56,699 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 717.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -123.6 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 614.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4615.01 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 830.3 MB in the end (delta: 221.8 MB). Peak memory consumption was 360.2 MB. Max. memory is 11.5 GB. * Witness Printer took 116.80 ms. Allocated memory is still 1.3 GB. Free memory is still 830.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 708]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 159 locations, 1 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1451 SDtfs, 898 SDslu, 3802 SDs, 0 SdLazy, 387 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5618occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 224 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 567 ConstructedInterpolants, 0 QuantifiedInterpolants, 154413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...