./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe018_tso.opt_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/safe018_tso.opt_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 3827f12dd9ecad44fa1330ae0ce4c9ad2f41575a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:28,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:57:28,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:57:28,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:57:28,743 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:57:28,744 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:57:28,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:57:28,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:57:28,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:57:28,761 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:57:28,762 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:57:28,764 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:57:28,766 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:57:28,767 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:57:28,768 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:57:28,771 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:57:28,772 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:57:28,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:57:28,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:57:28,784 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:57:28,786 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:57:28,787 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:57:28,792 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:57:28,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:57:28,792 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:57:28,793 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:57:28,794 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:57:28,795 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:57:28,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:57:28,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:57:28,799 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:57:28,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:57:28,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:57:28,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:57:28,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:57:28,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:57:28,805 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:28,833 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:57:28,834 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:57:28,837 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:57:28,838 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:57:28,838 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:57:28,839 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:57:28,839 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:57:28,839 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:57:28,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:57:28,839 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:57:28,839 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:57:28,840 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:57:28,840 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:57:28,840 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:57:28,840 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:57:28,840 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:57:28,841 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:57:28,841 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:57:28,841 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:57:28,841 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:57:28,841 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:57:28,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:57:28,842 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:57:28,842 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:57:28,842 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:57:28,842 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:57:28,842 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:57:28,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:57:28,844 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 -> 3827f12dd9ecad44fa1330ae0ce4c9ad2f41575a [2019-01-01 00:57:28,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:57:28,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:57:28,908 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:57:28,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:57:28,912 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:57:28,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe018_tso.opt_true-unreach-call.i [2019-01-01 00:57:28,976 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282b328ab/863c1bc9f79e470ba1360fcefbf07e81/FLAG536936fc1 [2019-01-01 00:57:29,506 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:57:29,506 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe018_tso.opt_true-unreach-call.i [2019-01-01 00:57:29,521 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282b328ab/863c1bc9f79e470ba1360fcefbf07e81/FLAG536936fc1 [2019-01-01 00:57:29,775 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282b328ab/863c1bc9f79e470ba1360fcefbf07e81 [2019-01-01 00:57:29,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:57:29,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:57:29,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:57:29,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:57:29,788 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:57:29,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:57:29" (1/1) ... [2019-01-01 00:57:29,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a64539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:29, skipping insertion in model container [2019-01-01 00:57:29,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:57:29" (1/1) ... [2019-01-01 00:57:29,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:57:29,869 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:57:30,352 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:57:30,372 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:57:30,563 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:57:30,648 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:57:30,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:30 WrapperNode [2019-01-01 00:57:30,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:57:30,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:57:30,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:57:30,650 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:57:30,660 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:30" (1/1) ... [2019-01-01 00:57:30,678 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:30" (1/1) ... [2019-01-01 00:57:30,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:57:30,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:57:30,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:57:30,702 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:57:30,711 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:30" (1/1) ... [2019-01-01 00:57:30,712 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:30" (1/1) ... [2019-01-01 00:57:30,715 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:30" (1/1) ... [2019-01-01 00:57:30,716 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:30" (1/1) ... [2019-01-01 00:57:30,723 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:30" (1/1) ... [2019-01-01 00:57:30,726 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:30" (1/1) ... [2019-01-01 00:57:30,728 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:30" (1/1) ... [2019-01-01 00:57:30,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:57:30,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:57:30,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:57:30,733 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:57:30,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:30" (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:30,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:57:30,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:57:30,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:57:30,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:57:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:57:30,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:57:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:57:30,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:57:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-01 00:57:30,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-01 00:57:30,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:57:30,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:57:30,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:57:30,812 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:31,325 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:57:31,326 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 00:57:31,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:57:31 BoogieIcfgContainer [2019-01-01 00:57:31,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:57:31,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:57:31,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:57:31,332 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:57:31,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:57:29" (1/3) ... [2019-01-01 00:57:31,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a40fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:57:31, skipping insertion in model container [2019-01-01 00:57:31,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:30" (2/3) ... [2019-01-01 00:57:31,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a40fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:57:31, skipping insertion in model container [2019-01-01 00:57:31,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:57:31" (3/3) ... [2019-01-01 00:57:31,336 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_tso.opt_true-unreach-call.i [2019-01-01 00:57:31,375 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:31,375 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:31,375 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:31,375 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:31,376 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:31,377 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:31,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:31,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:31,377 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:31,377 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:31,378 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:31,378 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:31,378 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:31,378 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:31,378 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:31,380 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:31,380 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:31,381 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:31,381 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:31,381 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:31,381 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:31,383 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:31,383 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:31,383 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:31,383 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:31,383 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:31,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:31,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:31,384 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:31,384 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:31,416 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:57:31,416 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:57:31,424 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-01 00:57:31,442 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-01 00:57:31,471 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:57:31,471 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:57:31,472 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:57:31,472 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:57:31,472 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:57:31,472 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:57:31,472 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:57:31,472 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:57:31,472 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:57:31,483 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56places, 53 transitions [2019-01-01 00:57:31,658 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2385 states. [2019-01-01 00:57:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states. [2019-01-01 00:57:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 00:57:31,682 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:31,683 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:31,686 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:31,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:31,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1493068601, now seen corresponding path program 1 times [2019-01-01 00:57:31,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:31,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:31,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:31,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:31,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:32,086 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:32,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:32,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:57:32,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:57:32,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:57:32,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:57:32,111 INFO L87 Difference]: Start difference. First operand 2385 states. Second operand 4 states. [2019-01-01 00:57:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:32,308 INFO L93 Difference]: Finished difference Result 2493 states and 8069 transitions. [2019-01-01 00:57:32,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:57:32,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-01-01 00:57:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:32,349 INFO L225 Difference]: With dead ends: 2493 [2019-01-01 00:57:32,349 INFO L226 Difference]: Without dead ends: 1128 [2019-01-01 00:57:32,351 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-01 00:57:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-01-01 00:57:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2019-01-01 00:57:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2019-01-01 00:57:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 3558 transitions. [2019-01-01 00:57:32,505 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 3558 transitions. Word has length 30 [2019-01-01 00:57:32,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:32,506 INFO L480 AbstractCegarLoop]: Abstraction has 1128 states and 3558 transitions. [2019-01-01 00:57:32,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:57:32,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 3558 transitions. [2019-01-01 00:57:32,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 00:57:32,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:32,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:32,512 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:32,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:32,512 INFO L82 PathProgramCache]: Analyzing trace with hash 257798501, now seen corresponding path program 1 times [2019-01-01 00:57:32,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:32,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:32,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:32,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:32,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:57:32,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:32,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:57:32,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:57:32,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:57:32,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:57:32,813 INFO L87 Difference]: Start difference. First operand 1128 states and 3558 transitions. Second operand 5 states. [2019-01-01 00:57:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:33,058 INFO L93 Difference]: Finished difference Result 1168 states and 3552 transitions. [2019-01-01 00:57:33,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:57:33,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-01 00:57:33,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:33,071 INFO L225 Difference]: With dead ends: 1168 [2019-01-01 00:57:33,071 INFO L226 Difference]: Without dead ends: 1044 [2019-01-01 00:57:33,073 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:33,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2019-01-01 00:57:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2019-01-01 00:57:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2019-01-01 00:57:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 3243 transitions. [2019-01-01 00:57:33,120 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 3243 transitions. Word has length 31 [2019-01-01 00:57:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:33,120 INFO L480 AbstractCegarLoop]: Abstraction has 1044 states and 3243 transitions. [2019-01-01 00:57:33,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:57:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 3243 transitions. [2019-01-01 00:57:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 00:57:33,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:33,126 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:33,126 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:33,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:33,128 INFO L82 PathProgramCache]: Analyzing trace with hash 490078413, now seen corresponding path program 1 times [2019-01-01 00:57:33,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:33,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:33,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:33,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:33,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:33,412 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:33,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:33,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:57:33,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:57:33,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:57:33,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:57:33,414 INFO L87 Difference]: Start difference. First operand 1044 states and 3243 transitions. Second operand 6 states. [2019-01-01 00:57:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:33,586 INFO L93 Difference]: Finished difference Result 820 states and 2379 transitions. [2019-01-01 00:57:33,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:33,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-01-01 00:57:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:33,594 INFO L225 Difference]: With dead ends: 820 [2019-01-01 00:57:33,595 INFO L226 Difference]: Without dead ends: 708 [2019-01-01 00:57:33,595 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-01 00:57:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-01-01 00:57:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-01-01 00:57:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-01-01 00:57:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 2067 transitions. [2019-01-01 00:57:33,621 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 2067 transitions. Word has length 32 [2019-01-01 00:57:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:33,622 INFO L480 AbstractCegarLoop]: Abstraction has 708 states and 2067 transitions. [2019-01-01 00:57:33,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:57:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 2067 transitions. [2019-01-01 00:57:33,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 00:57:33,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:33,625 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] [2019-01-01 00:57:33,626 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:33,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:33,626 INFO L82 PathProgramCache]: Analyzing trace with hash -774622655, now seen corresponding path program 1 times [2019-01-01 00:57:33,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:33,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:33,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:33,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:33,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:33,867 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:33,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:33,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:57:33,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:57:33,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:57:33,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:57:33,868 INFO L87 Difference]: Start difference. First operand 708 states and 2067 transitions. Second operand 7 states. [2019-01-01 00:57:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:34,248 INFO L93 Difference]: Finished difference Result 1108 states and 3291 transitions. [2019-01-01 00:57:34,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:34,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-01-01 00:57:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:34,255 INFO L225 Difference]: With dead ends: 1108 [2019-01-01 00:57:34,256 INFO L226 Difference]: Without dead ends: 592 [2019-01-01 00:57:34,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:57:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-01-01 00:57:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-01-01 00:57:34,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-01-01 00:57:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1755 transitions. [2019-01-01 00:57:34,281 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1755 transitions. Word has length 33 [2019-01-01 00:57:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:34,282 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 1755 transitions. [2019-01-01 00:57:34,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:57:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1755 transitions. [2019-01-01 00:57:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 00:57:34,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:34,286 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] [2019-01-01 00:57:34,286 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1731473919, now seen corresponding path program 2 times [2019-01-01 00:57:34,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:34,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:34,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:34,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:34,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:34,678 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:34,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:34,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:57:34,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:57:34,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:57:34,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:57:34,680 INFO L87 Difference]: Start difference. First operand 592 states and 1755 transitions. Second operand 7 states. [2019-01-01 00:57:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:35,041 INFO L93 Difference]: Finished difference Result 976 states and 2939 transitions. [2019-01-01 00:57:35,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:35,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-01-01 00:57:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:35,048 INFO L225 Difference]: With dead ends: 976 [2019-01-01 00:57:35,048 INFO L226 Difference]: Without dead ends: 556 [2019-01-01 00:57:35,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:57:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-01-01 00:57:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-01-01 00:57:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-01-01 00:57:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1671 transitions. [2019-01-01 00:57:35,068 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1671 transitions. Word has length 33 [2019-01-01 00:57:35,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:35,069 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 1671 transitions. [2019-01-01 00:57:35,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:57:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1671 transitions. [2019-01-01 00:57:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 00:57:35,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:35,071 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] [2019-01-01 00:57:35,071 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1959007825, now seen corresponding path program 3 times [2019-01-01 00:57:35,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:35,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:35,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:35,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:57:35,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:35,408 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:35,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:35,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:57:35,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:57:35,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:57:35,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:57:35,410 INFO L87 Difference]: Start difference. First operand 556 states and 1671 transitions. Second operand 7 states. [2019-01-01 00:57:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:35,563 INFO L93 Difference]: Finished difference Result 428 states and 1255 transitions. [2019-01-01 00:57:35,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:35,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-01-01 00:57:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:35,563 INFO L225 Difference]: With dead ends: 428 [2019-01-01 00:57:35,563 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 00:57:35,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:57:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 00:57:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 00:57:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 00:57:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 00:57:35,567 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-01-01 00:57:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:35,567 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 00:57:35,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:57:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 00:57:35,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 00:57:35,570 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:57:35,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:57:35 BasicIcfg [2019-01-01 00:57:35,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:57:35,573 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:57:35,573 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:57:35,573 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:57:35,573 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:31" (3/4) ... [2019-01-01 00:57:35,577 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 00:57:35,584 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-01-01 00:57:35,584 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-01-01 00:57:35,584 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-01-01 00:57:35,589 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-01 00:57:35,589 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 00:57:35,634 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:57:35,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:57:35,636 INFO L168 Benchmark]: Toolchain (without parser) took 5855.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 951.3 MB in the beginning and 848.0 MB in the end (delta: 103.3 MB). Peak memory consumption was 229.1 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:35,637 INFO L168 Benchmark]: CDTParser took 0.22 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:35,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 867.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:35,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.93 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:35,639 INFO L168 Benchmark]: Boogie Preprocessor took 30.77 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:35,640 INFO L168 Benchmark]: RCFGBuilder took 593.98 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:35,640 INFO L168 Benchmark]: TraceAbstraction took 4244.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 855.0 MB in the end (delta: 217.2 MB). Peak memory consumption was 217.2 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:35,641 INFO L168 Benchmark]: Witness Printer took 62.09 ms. Allocated memory is still 1.2 GB. Free memory was 855.0 MB in the beginning and 848.0 MB 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:35,646 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.22 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 867.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.93 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 30.77 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 593.98 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4244.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 855.0 MB in the end (delta: 217.2 MB). Peak memory consumption was 217.2 MB. Max. memory is 11.5 GB. * Witness Printer took 62.09 ms. Allocated memory is still 1.2 GB. Free memory was 855.0 MB in the beginning and 848.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. 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, 71 locations, 1 error locations. SAFE Result, 4.1s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 333 SDtfs, 434 SDslu, 874 SDs, 0 SdLazy, 116 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2385occurred 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.5s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 15294 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...