./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe027_tso.oepc_true-unreach-call.i --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/pthread-wmm/safe027_tso.oepc_true-unreach-call.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 a4a1ed3717742c64aba9f64e644e7ca336441d21 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-13 05:51:06,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:51:06,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:51:06,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:51:06,195 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:51:06,197 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:51:06,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:51:06,201 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:51:06,203 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:51:06,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:51:06,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:51:06,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:51:06,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:51:06,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:51:06,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:51:06,215 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:51:06,216 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:51:06,225 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:51:06,228 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:51:06,231 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:51:06,233 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:51:06,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:51:06,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:51:06,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:51:06,240 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:51:06,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:51:06,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:51:06,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:51:06,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:51:06,248 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:51:06,248 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:51:06,250 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:51:06,251 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:51:06,251 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:51:06,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:51:06,253 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:51:06,253 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 05:51:06,269 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:51:06,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:51:06,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:51:06,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:51:06,271 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:51:06,271 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:51:06,271 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:51:06,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:51:06,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:51:06,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:51:06,272 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:51:06,273 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:51:06,273 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:51:06,273 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:51:06,274 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:51:06,274 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:51:06,274 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:51:06,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:51:06,274 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:51:06,274 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:51:06,275 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:51:06,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:51:06,276 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:51:06,276 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:51:06,276 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:51:06,277 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:51:06,277 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:51:06,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:51:06,278 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 -> a4a1ed3717742c64aba9f64e644e7ca336441d21 [2019-01-13 05:51:06,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:51:06,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:51:06,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:51:06,362 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:51:06,362 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:51:06,363 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe027_tso.oepc_true-unreach-call.i [2019-01-13 05:51:06,426 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb14be02/183be01f02fb4a2b9e4d97771a14a5b5/FLAGe3905178f [2019-01-13 05:51:06,952 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:51:06,952 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe027_tso.oepc_true-unreach-call.i [2019-01-13 05:51:06,966 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb14be02/183be01f02fb4a2b9e4d97771a14a5b5/FLAGe3905178f [2019-01-13 05:51:07,218 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb14be02/183be01f02fb4a2b9e4d97771a14a5b5 [2019-01-13 05:51:07,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:51:07,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:51:07,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:51:07,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:51:07,235 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:51:07,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:51:07" (1/1) ... [2019-01-13 05:51:07,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7730cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:07, skipping insertion in model container [2019-01-13 05:51:07,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:51:07" (1/1) ... [2019-01-13 05:51:07,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:51:07,323 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:51:07,805 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:51:07,818 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:51:07,990 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:51:08,090 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:51:08,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08 WrapperNode [2019-01-13 05:51:08,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:51:08,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:51:08,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:51:08,092 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:51:08,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:08,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:08,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:51:08,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:51:08,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:51:08,155 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:51:08,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:08,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:08,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:08,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:08,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:08,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:08,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (1/1) ... [2019-01-13 05:51:08,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:51:08,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:51:08,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:51:08,219 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:51:08,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (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-13 05:51:08,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:51:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 05:51:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:51:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:51:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 05:51:08,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 05:51:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 05:51:08,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 05:51:08,295 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-13 05:51:08,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-13 05:51:08,296 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-01-13 05:51:08,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-01-13 05:51:08,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 05:51:08,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:51:08,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:51:08,299 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 05:51:08,912 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:51:08,913 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-13 05:51:08,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:51:08 BoogieIcfgContainer [2019-01-13 05:51:08,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:51:08,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:51:08,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:51:08,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:51:08,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:51:07" (1/3) ... [2019-01-13 05:51:08,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@866b3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:51:08, skipping insertion in model container [2019-01-13 05:51:08,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:51:08" (2/3) ... [2019-01-13 05:51:08,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@866b3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:51:08, skipping insertion in model container [2019-01-13 05:51:08,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:51:08" (3/3) ... [2019-01-13 05:51:08,931 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_tso.oepc_true-unreach-call.i [2019-01-13 05:51:08,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,972 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,972 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,974 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,974 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,979 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,979 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,980 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,980 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,980 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,980 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,980 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,980 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,981 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,983 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,983 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,983 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,983 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,984 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,984 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,985 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:08,985 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:51:09,007 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:51:09,007 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:51:09,015 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-13 05:51:09,033 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-13 05:51:09,060 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:51:09,060 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:51:09,061 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:51:09,061 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:51:09,061 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:51:09,061 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:51:09,061 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:51:09,061 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:51:09,061 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:51:09,073 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68places, 64 transitions [2019-01-13 05:51:10,042 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13136 states. [2019-01-13 05:51:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 13136 states. [2019-01-13 05:51:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 05:51:10,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:10,089 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] [2019-01-13 05:51:10,091 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:10,098 INFO L82 PathProgramCache]: Analyzing trace with hash -791038270, now seen corresponding path program 1 times [2019-01-13 05:51:10,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:10,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:10,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:10,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:51:10,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:10,452 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-13 05:51:10,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:10,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:51:10,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:51:10,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:51:10,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:51:10,476 INFO L87 Difference]: Start difference. First operand 13136 states. Second operand 4 states. [2019-01-13 05:51:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:10,954 INFO L93 Difference]: Finished difference Result 13742 states and 55793 transitions. [2019-01-13 05:51:10,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:51:10,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-13 05:51:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:11,071 INFO L225 Difference]: With dead ends: 13742 [2019-01-13 05:51:11,072 INFO L226 Difference]: Without dead ends: 5629 [2019-01-13 05:51:11,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:51:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5629 states. [2019-01-13 05:51:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5629 to 5629. [2019-01-13 05:51:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5629 states. [2019-01-13 05:51:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5629 states to 5629 states and 22352 transitions. [2019-01-13 05:51:11,618 INFO L78 Accepts]: Start accepts. Automaton has 5629 states and 22352 transitions. Word has length 35 [2019-01-13 05:51:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:11,620 INFO L480 AbstractCegarLoop]: Abstraction has 5629 states and 22352 transitions. [2019-01-13 05:51:11,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:51:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 5629 states and 22352 transitions. [2019-01-13 05:51:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 05:51:11,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:11,629 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] [2019-01-13 05:51:11,629 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:11,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:11,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1324297606, now seen corresponding path program 1 times [2019-01-13 05:51:11,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:11,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:11,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:11,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:51:11,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:11,976 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-13 05:51:11,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:11,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:51:11,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:51:11,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:51:11,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:51:11,979 INFO L87 Difference]: Start difference. First operand 5629 states and 22352 transitions. Second operand 5 states. [2019-01-13 05:51:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:12,560 INFO L93 Difference]: Finished difference Result 6141 states and 23832 transitions. [2019-01-13 05:51:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:51:12,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-13 05:51:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:12,622 INFO L225 Difference]: With dead ends: 6141 [2019-01-13 05:51:12,623 INFO L226 Difference]: Without dead ends: 5517 [2019-01-13 05:51:12,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:51:12,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5517 states. [2019-01-13 05:51:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5517 to 5517. [2019-01-13 05:51:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5517 states. [2019-01-13 05:51:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5517 states to 5517 states and 21820 transitions. [2019-01-13 05:51:12,881 INFO L78 Accepts]: Start accepts. Automaton has 5517 states and 21820 transitions. Word has length 36 [2019-01-13 05:51:12,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:12,882 INFO L480 AbstractCegarLoop]: Abstraction has 5517 states and 21820 transitions. [2019-01-13 05:51:12,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:51:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5517 states and 21820 transitions. [2019-01-13 05:51:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 05:51:12,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:12,891 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] [2019-01-13 05:51:12,892 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash -999628882, now seen corresponding path program 1 times [2019-01-13 05:51:12,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:12,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:12,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:12,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:51:12,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:13,101 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-13 05:51:13,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:13,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:51:13,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:51:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:51:13,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:51:13,104 INFO L87 Difference]: Start difference. First operand 5517 states and 21820 transitions. Second operand 6 states. [2019-01-13 05:51:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:13,487 INFO L93 Difference]: Finished difference Result 5453 states and 20828 transitions. [2019-01-13 05:51:13,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:51:13,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-01-13 05:51:13,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:13,533 INFO L225 Difference]: With dead ends: 5453 [2019-01-13 05:51:13,533 INFO L226 Difference]: Without dead ends: 4845 [2019-01-13 05:51:13,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:51:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states. [2019-01-13 05:51:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 4845. [2019-01-13 05:51:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2019-01-13 05:51:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 18796 transitions. [2019-01-13 05:51:13,708 INFO L78 Accepts]: Start accepts. Automaton has 4845 states and 18796 transitions. Word has length 37 [2019-01-13 05:51:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:13,708 INFO L480 AbstractCegarLoop]: Abstraction has 4845 states and 18796 transitions. [2019-01-13 05:51:13,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:51:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4845 states and 18796 transitions. [2019-01-13 05:51:13,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 05:51:13,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:13,717 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] [2019-01-13 05:51:13,718 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:13,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:13,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1893784710, now seen corresponding path program 1 times [2019-01-13 05:51:13,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:13,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:13,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:13,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:51:13,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:13,925 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-13 05:51:13,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:13,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:51:13,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:51:13,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:51:13,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:51:13,928 INFO L87 Difference]: Start difference. First operand 4845 states and 18796 transitions. Second operand 7 states. [2019-01-13 05:51:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:14,451 INFO L93 Difference]: Finished difference Result 3565 states and 13036 transitions. [2019-01-13 05:51:14,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:51:14,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-01-13 05:51:14,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:14,478 INFO L225 Difference]: With dead ends: 3565 [2019-01-13 05:51:14,478 INFO L226 Difference]: Without dead ends: 3053 [2019-01-13 05:51:14,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:51:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2019-01-13 05:51:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 3053. [2019-01-13 05:51:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3053 states. [2019-01-13 05:51:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 11180 transitions. [2019-01-13 05:51:14,633 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 11180 transitions. Word has length 38 [2019-01-13 05:51:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:14,634 INFO L480 AbstractCegarLoop]: Abstraction has 3053 states and 11180 transitions. [2019-01-13 05:51:14,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:51:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 11180 transitions. [2019-01-13 05:51:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 05:51:14,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:14,643 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] [2019-01-13 05:51:14,643 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1572457708, now seen corresponding path program 1 times [2019-01-13 05:51:14,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:14,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:14,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:51:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:14,919 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-13 05:51:14,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:14,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:51:14,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:51:14,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:51:14,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:51:14,922 INFO L87 Difference]: Start difference. First operand 3053 states and 11180 transitions. Second operand 7 states. [2019-01-13 05:51:15,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:15,152 INFO L93 Difference]: Finished difference Result 4733 states and 17540 transitions. [2019-01-13 05:51:15,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:51:15,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-01-13 05:51:15,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:15,166 INFO L225 Difference]: With dead ends: 4733 [2019-01-13 05:51:15,166 INFO L226 Difference]: Without dead ends: 2457 [2019-01-13 05:51:15,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:51:15,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2019-01-13 05:51:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2457. [2019-01-13 05:51:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-01-13 05:51:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 9124 transitions. [2019-01-13 05:51:15,258 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 9124 transitions. Word has length 39 [2019-01-13 05:51:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:15,259 INFO L480 AbstractCegarLoop]: Abstraction has 2457 states and 9124 transitions. [2019-01-13 05:51:15,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:51:15,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 9124 transitions. [2019-01-13 05:51:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 05:51:15,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:15,266 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] [2019-01-13 05:51:15,266 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:15,266 INFO L82 PathProgramCache]: Analyzing trace with hash 540968834, now seen corresponding path program 2 times [2019-01-13 05:51:15,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:15,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:15,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:15,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:51:15,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:15,471 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-13 05:51:15,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:15,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:51:15,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:51:15,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:51:15,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:51:15,472 INFO L87 Difference]: Start difference. First operand 2457 states and 9124 transitions. Second operand 7 states. [2019-01-13 05:51:15,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:15,868 INFO L93 Difference]: Finished difference Result 4057 states and 15220 transitions. [2019-01-13 05:51:15,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:51:15,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-01-13 05:51:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:15,880 INFO L225 Difference]: With dead ends: 4057 [2019-01-13 05:51:15,880 INFO L226 Difference]: Without dead ends: 2261 [2019-01-13 05:51:15,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:51:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-01-13 05:51:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2019-01-13 05:51:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2019-01-13 05:51:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 8528 transitions. [2019-01-13 05:51:15,953 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 8528 transitions. Word has length 39 [2019-01-13 05:51:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:15,953 INFO L480 AbstractCegarLoop]: Abstraction has 2261 states and 8528 transitions. [2019-01-13 05:51:15,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:51:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 8528 transitions. [2019-01-13 05:51:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 05:51:15,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:15,959 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] [2019-01-13 05:51:15,959 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:15,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1549190684, now seen corresponding path program 3 times [2019-01-13 05:51:15,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:15,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:15,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:51:15,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:16,180 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-13 05:51:16,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:16,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:51:16,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:51:16,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:51:16,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:51:16,184 INFO L87 Difference]: Start difference. First operand 2261 states and 8528 transitions. Second operand 7 states. [2019-01-13 05:51:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:16,368 INFO L93 Difference]: Finished difference Result 3797 states and 14416 transitions. [2019-01-13 05:51:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:51:16,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-01-13 05:51:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:16,377 INFO L225 Difference]: With dead ends: 3797 [2019-01-13 05:51:16,377 INFO L226 Difference]: Without dead ends: 2161 [2019-01-13 05:51:16,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:51:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2019-01-13 05:51:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2161. [2019-01-13 05:51:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2161 states. [2019-01-13 05:51:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 8220 transitions. [2019-01-13 05:51:16,447 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 8220 transitions. Word has length 39 [2019-01-13 05:51:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:16,448 INFO L480 AbstractCegarLoop]: Abstraction has 2161 states and 8220 transitions. [2019-01-13 05:51:16,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:51:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 8220 transitions. [2019-01-13 05:51:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 05:51:16,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:51:16,455 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] [2019-01-13 05:51:16,455 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:51:16,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:51:16,457 INFO L82 PathProgramCache]: Analyzing trace with hash -481726390, now seen corresponding path program 4 times [2019-01-13 05:51:16,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:51:16,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:51:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:16,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:51:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:51:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:51:16,837 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-13 05:51:16,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:51:16,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:51:16,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:51:16,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:51:16,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:51:16,839 INFO L87 Difference]: Start difference. First operand 2161 states and 8220 transitions. Second operand 7 states. [2019-01-13 05:51:16,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:51:16,935 INFO L93 Difference]: Finished difference Result 1649 states and 6172 transitions. [2019-01-13 05:51:16,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:51:16,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-01-13 05:51:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:51:16,936 INFO L225 Difference]: With dead ends: 1649 [2019-01-13 05:51:16,936 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 05:51:16,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:51:16,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 05:51:16,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 05:51:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 05:51:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 05:51:16,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-01-13 05:51:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:51:16,937 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 05:51:16,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:51:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 05:51:16,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 05:51:16,941 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:51:16,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:51:16 BasicIcfg [2019-01-13 05:51:16,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:51:16,943 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:51:16,943 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:51:16,943 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:51:16,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:51:08" (3/4) ... [2019-01-13 05:51:16,948 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 05:51:16,955 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-01-13 05:51:16,955 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-01-13 05:51:16,955 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-01-13 05:51:16,955 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2019-01-13 05:51:16,960 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-13 05:51:16,961 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-13 05:51:17,013 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:51:17,013 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:51:17,014 INFO L168 Benchmark]: Toolchain (without parser) took 9791.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -140.1 MB). Peak memory consumption was 170.8 MB. Max. memory is 11.5 GB. [2019-01-13 05:51:17,017 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:51:17,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 865.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-13 05:51:17,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:51:17,019 INFO L168 Benchmark]: Boogie Preprocessor took 63.16 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-13 05:51:17,019 INFO L168 Benchmark]: RCFGBuilder took 696.28 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-01-13 05:51:17,021 INFO L168 Benchmark]: TraceAbstraction took 8022.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.0 MB). Peak memory consumption was 159.2 MB. Max. memory is 11.5 GB. [2019-01-13 05:51:17,022 INFO L168 Benchmark]: Witness Printer took 70.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:51:17,027 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 865.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.16 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 696.28 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8022.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.0 MB). Peak memory consumption was 159.2 MB. Max. memory is 11.5 GB. * Witness Printer took 70.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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, 88 locations, 1 error locations. SAFE Result, 7.8s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 560 SDtfs, 855 SDslu, 1528 SDs, 0 SdLazy, 188 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13136occurred in iteration=0, 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: 1.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 27742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...