./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe015_pso.oepc_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/safe015_pso.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 8eb71b3e80cb1e8cf1b5bf1e2410413a36312e01 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 00:57:03,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:57:03,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:57:03,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:57:03,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:57:03,211 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:57:03,213 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:57:03,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:57:03,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:57:03,221 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:57:03,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:57:03,222 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:57:03,225 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:57:03,226 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:57:03,227 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:57:03,236 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:57:03,237 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:57:03,239 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:57:03,241 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:57:03,244 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:57:03,250 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:57:03,251 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:57:03,256 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:57:03,257 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:57:03,257 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:57:03,258 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:57:03,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:57:03,260 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:57:03,260 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:57:03,261 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:57:03,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:57:03,262 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:57:03,262 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:57:03,263 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:57:03,264 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:57:03,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:57:03,264 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:57:03,290 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:57:03,291 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:57:03,294 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:57:03,295 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:57:03,295 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:57:03,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:57:03,296 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:57:03,296 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:57:03,296 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:57:03,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:57:03,296 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:57:03,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:57:03,297 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:57:03,297 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:57:03,297 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:57:03,297 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:57:03,297 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:57:03,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:57:03,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:57:03,300 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:57:03,300 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:57:03,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:57:03,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:57:03,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:57:03,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:57:03,302 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:57:03,302 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:57:03,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:57:03,303 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 -> 8eb71b3e80cb1e8cf1b5bf1e2410413a36312e01 [2019-01-01 00:57:03,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:57:03,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:57:03,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:57:03,389 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:57:03,390 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:57:03,391 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe015_pso.oepc_true-unreach-call.i [2019-01-01 00:57:03,454 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e634e6ecd/3d7c2c85cf964a8fb8a55dc43d949776/FLAGcacc2b696 [2019-01-01 00:57:04,052 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:57:04,053 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe015_pso.oepc_true-unreach-call.i [2019-01-01 00:57:04,072 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e634e6ecd/3d7c2c85cf964a8fb8a55dc43d949776/FLAGcacc2b696 [2019-01-01 00:57:04,268 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e634e6ecd/3d7c2c85cf964a8fb8a55dc43d949776 [2019-01-01 00:57:04,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:57:04,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:57:04,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:57:04,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:57:04,279 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:57:04,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:57:04" (1/1) ... [2019-01-01 00:57:04,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d48e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04, skipping insertion in model container [2019-01-01 00:57:04,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:57:04" (1/1) ... [2019-01-01 00:57:04,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:57:04,340 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:57:04,690 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:57:04,705 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:57:04,853 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:57:04,933 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:57:04,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04 WrapperNode [2019-01-01 00:57:04,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:57:04,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:57:04,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:57:04,935 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:57:04,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04" (1/1) ... [2019-01-01 00:57:04,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04" (1/1) ... [2019-01-01 00:57:04,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:57:04,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:57:04,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:57:04,988 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:57:04,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04" (1/1) ... [2019-01-01 00:57:05,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04" (1/1) ... [2019-01-01 00:57:05,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04" (1/1) ... [2019-01-01 00:57:05,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04" (1/1) ... [2019-01-01 00:57:05,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04" (1/1) ... [2019-01-01 00:57:05,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04" (1/1) ... [2019-01-01 00:57:05,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04" (1/1) ... [2019-01-01 00:57:05,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:57:05,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:57:05,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:57:05,019 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:57:05,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:57:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:57:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:57:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:57:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:57:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:57:05,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:57:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:57:05,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:57:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-01 00:57:05,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-01 00:57:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:57:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:57:05,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:57:05,096 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:57:05,581 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:57:05,581 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 00:57:05,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:57:05 BoogieIcfgContainer [2019-01-01 00:57:05,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:57:05,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:57:05,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:57:05,587 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:57:05,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:57:04" (1/3) ... [2019-01-01 00:57:05,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e60cd09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:57:05, skipping insertion in model container [2019-01-01 00:57:05,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:04" (2/3) ... [2019-01-01 00:57:05,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e60cd09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:57:05, skipping insertion in model container [2019-01-01 00:57:05,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:57:05" (3/3) ... [2019-01-01 00:57:05,592 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_pso.oepc_true-unreach-call.i [2019-01-01 00:57:05,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,630 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,630 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,633 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,634 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,634 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,634 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,634 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,634 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,636 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,636 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,637 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,637 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,637 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,639 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,639 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,639 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:05,685 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:57:05,685 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:57:05,694 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-01 00:57:05,711 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-01 00:57:05,737 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:57:05,738 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:57:05,738 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:57:05,738 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:57:05,738 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:57:05,738 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:57:05,738 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:57:05,739 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:57:05,739 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:57:05,749 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55places, 52 transitions [2019-01-01 00:57:05,879 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2384 states. [2019-01-01 00:57:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states. [2019-01-01 00:57:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 00:57:05,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:05,909 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] [2019-01-01 00:57:05,912 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:05,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:05,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1952890995, now seen corresponding path program 1 times [2019-01-01 00:57:05,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:05,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:05,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:05,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:05,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:06,298 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-01 00:57:06,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:06,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:57:06,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:57:06,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:57:06,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:57:06,331 INFO L87 Difference]: Start difference. First operand 2384 states. Second operand 4 states. [2019-01-01 00:57:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:06,738 INFO L93 Difference]: Finished difference Result 2492 states and 8068 transitions. [2019-01-01 00:57:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:57:06,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-01-01 00:57:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:06,776 INFO L225 Difference]: With dead ends: 2492 [2019-01-01 00:57:06,777 INFO L226 Difference]: Without dead ends: 1127 [2019-01-01 00:57:06,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:57:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2019-01-01 00:57:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1127. [2019-01-01 00:57:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127 states. [2019-01-01 00:57:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 3557 transitions. [2019-01-01 00:57:06,970 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 3557 transitions. Word has length 29 [2019-01-01 00:57:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:06,972 INFO L480 AbstractCegarLoop]: Abstraction has 1127 states and 3557 transitions. [2019-01-01 00:57:06,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:57:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 3557 transitions. [2019-01-01 00:57:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 00:57:06,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:06,984 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] [2019-01-01 00:57:06,985 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:06,985 INFO L82 PathProgramCache]: Analyzing trace with hash 237831011, now seen corresponding path program 1 times [2019-01-01 00:57:06,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:06,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:07,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:07,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:07,205 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-01 00:57:07,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:07,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:57:07,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:57:07,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:57:07,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:57:07,209 INFO L87 Difference]: Start difference. First operand 1127 states and 3557 transitions. Second operand 5 states. [2019-01-01 00:57:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:07,534 INFO L93 Difference]: Finished difference Result 1167 states and 3551 transitions. [2019-01-01 00:57:07,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:57:07,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-01 00:57:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:07,549 INFO L225 Difference]: With dead ends: 1167 [2019-01-01 00:57:07,550 INFO L226 Difference]: Without dead ends: 1043 [2019-01-01 00:57:07,551 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-01 00:57:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-01-01 00:57:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-01-01 00:57:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-01-01 00:57:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 3242 transitions. [2019-01-01 00:57:07,595 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 3242 transitions. Word has length 30 [2019-01-01 00:57:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:07,595 INFO L480 AbstractCegarLoop]: Abstraction has 1043 states and 3242 transitions. [2019-01-01 00:57:07,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:57:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 3242 transitions. [2019-01-01 00:57:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 00:57:07,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:07,601 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] [2019-01-01 00:57:07,602 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:07,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1963848659, now seen corresponding path program 1 times [2019-01-01 00:57:07,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:07,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:07,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:07,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:07,934 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-01 00:57:07,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:07,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:57:07,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:57:07,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:57:07,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:57:07,937 INFO L87 Difference]: Start difference. First operand 1043 states and 3242 transitions. Second operand 6 states. [2019-01-01 00:57:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:08,283 INFO L93 Difference]: Finished difference Result 819 states and 2378 transitions. [2019-01-01 00:57:08,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:08,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-01-01 00:57:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:08,290 INFO L225 Difference]: With dead ends: 819 [2019-01-01 00:57:08,291 INFO L226 Difference]: Without dead ends: 707 [2019-01-01 00:57:08,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:57:08,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-01-01 00:57:08,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2019-01-01 00:57:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-01-01 00:57:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 2066 transitions. [2019-01-01 00:57:08,317 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 2066 transitions. Word has length 31 [2019-01-01 00:57:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:08,319 INFO L480 AbstractCegarLoop]: Abstraction has 707 states and 2066 transitions. [2019-01-01 00:57:08,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:57:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 2066 transitions. [2019-01-01 00:57:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 00:57:08,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:08,322 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] [2019-01-01 00:57:08,322 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:08,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:08,323 INFO L82 PathProgramCache]: Analyzing trace with hash 994118133, now seen corresponding path program 1 times [2019-01-01 00:57:08,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:08,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:08,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:08,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:08,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:08,675 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-01 00:57:08,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:08,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 00:57:08,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 00:57:08,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 00:57:08,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-01 00:57:08,677 INFO L87 Difference]: Start difference. First operand 707 states and 2066 transitions. Second operand 10 states. [2019-01-01 00:57:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:09,571 INFO L93 Difference]: Finished difference Result 1107 states and 3290 transitions. [2019-01-01 00:57:09,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:57:09,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-01-01 00:57:09,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:09,578 INFO L225 Difference]: With dead ends: 1107 [2019-01-01 00:57:09,578 INFO L226 Difference]: Without dead ends: 591 [2019-01-01 00:57:09,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-01-01 00:57:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-01 00:57:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-01-01 00:57:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-01-01 00:57:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1754 transitions. [2019-01-01 00:57:09,601 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1754 transitions. Word has length 32 [2019-01-01 00:57:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:09,601 INFO L480 AbstractCegarLoop]: Abstraction has 591 states and 1754 transitions. [2019-01-01 00:57:09,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 00:57:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1754 transitions. [2019-01-01 00:57:09,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 00:57:09,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:09,606 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] [2019-01-01 00:57:09,606 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:09,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1831555919, now seen corresponding path program 2 times [2019-01-01 00:57:09,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:09,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:09,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:09,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:09,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:09,805 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-01 00:57:09,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:09,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:57:09,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:57:09,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:57:09,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:57:09,807 INFO L87 Difference]: Start difference. First operand 591 states and 1754 transitions. Second operand 7 states. [2019-01-01 00:57:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:09,969 INFO L93 Difference]: Finished difference Result 975 states and 2938 transitions. [2019-01-01 00:57:09,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:09,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-01-01 00:57:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:09,977 INFO L225 Difference]: With dead ends: 975 [2019-01-01 00:57:09,977 INFO L226 Difference]: Without dead ends: 555 [2019-01-01 00:57:09,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-01 00:57:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-01-01 00:57:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-01-01 00:57:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-01-01 00:57:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1670 transitions. [2019-01-01 00:57:09,994 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1670 transitions. Word has length 32 [2019-01-01 00:57:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:09,994 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1670 transitions. [2019-01-01 00:57:09,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:57:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1670 transitions. [2019-01-01 00:57:09,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 00:57:09,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:09,997 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] [2019-01-01 00:57:09,997 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:09,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2073035831, now seen corresponding path program 3 times [2019-01-01 00:57:09,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:09,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:10,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:10,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:57:10,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:10,241 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-01 00:57:10,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:10,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 00:57:10,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 00:57:10,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 00:57:10,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:57:10,243 INFO L87 Difference]: Start difference. First operand 555 states and 1670 transitions. Second operand 11 states. [2019-01-01 00:57:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:10,468 INFO L93 Difference]: Finished difference Result 427 states and 1254 transitions. [2019-01-01 00:57:10,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:57:10,468 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-01-01 00:57:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:10,469 INFO L225 Difference]: With dead ends: 427 [2019-01-01 00:57:10,469 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 00:57:10,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-01-01 00:57:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 00:57:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 00:57:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 00:57:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 00:57:10,470 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-01-01 00:57:10,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:10,470 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 00:57:10,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 00:57:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 00:57:10,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 00:57:10,478 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:57:10,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:57:10 BasicIcfg [2019-01-01 00:57:10,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:57:10,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:57:10,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:57:10,481 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:57:10,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:57:05" (3/4) ... [2019-01-01 00:57:10,487 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 00:57:10,495 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-01-01 00:57:10,495 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-01-01 00:57:10,495 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-01-01 00:57:10,500 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-01 00:57:10,501 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 00:57:10,555 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:57:10,555 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:57:10,556 INFO L168 Benchmark]: Toolchain (without parser) took 6284.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.0 MB in the beginning and 804.3 MB in the end (delta: 141.7 MB). Peak memory consumption was 267.5 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:10,560 INFO L168 Benchmark]: CDTParser took 0.41 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-01 00:57:10,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:10,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.33 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-01 00:57:10,562 INFO L168 Benchmark]: Boogie Preprocessor took 29.93 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-01 00:57:10,569 INFO L168 Benchmark]: RCFGBuilder took 563.73 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:10,569 INFO L168 Benchmark]: TraceAbstraction took 4896.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 804.3 MB in the end (delta: 261.6 MB). Peak memory consumption was 261.6 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:10,572 INFO L168 Benchmark]: Witness Printer took 74.81 ms. Allocated memory is still 1.2 GB. Free memory is still 804.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:57:10,578 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.41 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 659.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.33 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 29.93 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 563.73 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4896.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 804.3 MB in the end (delta: 261.6 MB). Peak memory consumption was 261.6 MB. Max. memory is 11.5 GB. * Witness Printer took 74.81 ms. Allocated memory is still 1.2 GB. Free memory is still 804.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: 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 7 procedures, 70 locations, 1 error locations. SAFE Result, 4.7s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 367 SDtfs, 458 SDslu, 1387 SDs, 0 SdLazy, 246 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2384occurred 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: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 19346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...