./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe016_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe016_tso.opt.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 b3a0869f001de62b6943524698cd9c3b7e844f7c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 18:29:05,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:29:05,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:29:05,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:29:05,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:29:05,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:29:05,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:29:05,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:29:05,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:29:05,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:29:05,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:29:05,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:29:05,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:29:05,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:29:05,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:29:05,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:29:05,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:29:05,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:29:05,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:29:05,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:29:05,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:29:05,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:29:05,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:29:05,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:29:05,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:29:05,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:29:05,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:29:05,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:29:05,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:29:05,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:29:05,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:29:05,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:29:05,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:29:05,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:29:05,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:29:05,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:29:05,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:29:05,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:29:05,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:29:05,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:29:05,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:29:05,138 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:29:05,173 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:29:05,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:29:05,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:29:05,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:29:05,176 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:29:05,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:29:05,176 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:29:05,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:29:05,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:29:05,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:29:05,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:29:05,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:29:05,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:29:05,180 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:29:05,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:29:05,181 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:29:05,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:29:05,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:29:05,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:29:05,185 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:29:05,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:29:05,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:29:05,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:29:05,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:29:05,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:29:05,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:29:05,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:29:05,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:29:05,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:29:05,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3a0869f001de62b6943524698cd9c3b7e844f7c [2019-11-28 18:29:05,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:29:05,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:29:05,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:29:05,523 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:29:05,524 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:29:05,525 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe016_tso.opt.i [2019-11-28 18:29:05,596 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f37668dd/53123da13a3b41bdb1ba1df49ecc9bbd/FLAG407f63efc [2019-11-28 18:29:06,121 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:29:06,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe016_tso.opt.i [2019-11-28 18:29:06,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f37668dd/53123da13a3b41bdb1ba1df49ecc9bbd/FLAG407f63efc [2019-11-28 18:29:06,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f37668dd/53123da13a3b41bdb1ba1df49ecc9bbd [2019-11-28 18:29:06,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:29:06,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:29:06,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:29:06,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:29:06,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:29:06,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:29:06" (1/1) ... [2019-11-28 18:29:06,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d265c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:06, skipping insertion in model container [2019-11-28 18:29:06,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:29:06" (1/1) ... [2019-11-28 18:29:06,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:29:06,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:29:06,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:29:06,996 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:29:07,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:29:07,157 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:29:07,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:07 WrapperNode [2019-11-28 18:29:07,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:29:07,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:29:07,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:29:07,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:29:07,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:07" (1/1) ... [2019-11-28 18:29:07,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:07" (1/1) ... [2019-11-28 18:29:07,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:29:07,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:29:07,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:29:07,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:29:07,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:07" (1/1) ... [2019-11-28 18:29:07,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:07" (1/1) ... [2019-11-28 18:29:07,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:07" (1/1) ... [2019-11-28 18:29:07,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:07" (1/1) ... [2019-11-28 18:29:07,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:07" (1/1) ... [2019-11-28 18:29:07,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:07" (1/1) ... [2019-11-28 18:29:07,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:07" (1/1) ... [2019-11-28 18:29:07,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:29:07,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:29:07,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:29:07,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:29:07,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:29:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:29:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:29:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:29:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:29:07,307 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:29:07,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:29:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:29:07,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:29:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:29:07,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:29:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-11-28 18:29:07,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-11-28 18:29:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:29:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:29:07,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:29:07,312 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:29:07,685 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:29:07,685 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 18:29:07,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:29:07 BoogieIcfgContainer [2019-11-28 18:29:07,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:29:07,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:29:07,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:29:07,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:29:07,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:29:06" (1/3) ... [2019-11-28 18:29:07,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7100d895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:29:07, skipping insertion in model container [2019-11-28 18:29:07,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:29:07" (2/3) ... [2019-11-28 18:29:07,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7100d895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:29:07, skipping insertion in model container [2019-11-28 18:29:07,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:29:07" (3/3) ... [2019-11-28 18:29:07,695 INFO L109 eAbstractionObserver]: Analyzing ICFG safe016_tso.opt.i [2019-11-28 18:29:07,705 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:29:07,705 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:29:07,713 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 18:29:07,715 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:29:07,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,762 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,763 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,767 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,768 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:29:07,805 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:29:07,821 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:29:07,822 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:29:07,822 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:29:07,822 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:29:07,822 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:29:07,822 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:29:07,823 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:29:07,823 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:29:07,837 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 63 transitions [2019-11-28 18:29:07,839 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 75 places, 63 transitions [2019-11-28 18:29:07,899 INFO L134 PetriNetUnfolder]: 1/59 cut-off events. [2019-11-28 18:29:07,899 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:29:07,907 INFO L76 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 59 events. 1/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs. 12/69 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2019-11-28 18:29:07,911 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 75 places, 63 transitions [2019-11-28 18:29:07,944 INFO L134 PetriNetUnfolder]: 1/59 cut-off events. [2019-11-28 18:29:07,944 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:29:07,946 INFO L76 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 59 events. 1/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs. 12/69 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2019-11-28 18:29:07,951 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 732 [2019-11-28 18:29:07,952 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:29:09,626 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-28 18:29:09,815 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 18:29:10,077 INFO L206 etLargeBlockEncoding]: Checked pairs total: 749 [2019-11-28 18:29:10,077 INFO L214 etLargeBlockEncoding]: Total number of compositions: 49 [2019-11-28 18:29:10,082 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 19 transitions [2019-11-28 18:29:10,099 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 94 states. [2019-11-28 18:29:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2019-11-28 18:29:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 18:29:10,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:29:10,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:29:10,112 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:29:10,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:29:10,119 INFO L82 PathProgramCache]: Analyzing trace with hash 364087523, now seen corresponding path program 1 times [2019-11-28 18:29:10,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:29:10,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729430191] [2019-11-28 18:29:10,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:29:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:29:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:29:10,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729430191] [2019-11-28 18:29:10,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:29:10,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:29:10,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112141113] [2019-11-28 18:29:10,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:29:10,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:29:10,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:29:10,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:29:10,498 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 3 states. [2019-11-28 18:29:10,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:29:10,546 INFO L93 Difference]: Finished difference Result 137 states and 310 transitions. [2019-11-28 18:29:10,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:29:10,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 18:29:10,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:29:10,586 INFO L225 Difference]: With dead ends: 137 [2019-11-28 18:29:10,586 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 18:29:10,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:29:10,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 18:29:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2019-11-28 18:29:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 18:29:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 206 transitions. [2019-11-28 18:29:10,648 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 206 transitions. Word has length 10 [2019-11-28 18:29:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:29:10,649 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 206 transitions. [2019-11-28 18:29:10,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:29:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 206 transitions. [2019-11-28 18:29:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:29:10,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:29:10,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:29:10,652 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:29:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:29:10,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1598188831, now seen corresponding path program 1 times [2019-11-28 18:29:10,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:29:10,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919054006] [2019-11-28 18:29:10,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:29:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:29:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:29:10,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919054006] [2019-11-28 18:29:10,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:29:10,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:29:10,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171855960] [2019-11-28 18:29:10,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:29:10,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:29:10,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:29:10,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:29:10,810 INFO L87 Difference]: Start difference. First operand 94 states and 206 transitions. Second operand 4 states. [2019-11-28 18:29:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:29:10,837 INFO L93 Difference]: Finished difference Result 91 states and 189 transitions. [2019-11-28 18:29:10,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:29:10,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:29:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:29:10,840 INFO L225 Difference]: With dead ends: 91 [2019-11-28 18:29:10,841 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 18:29:10,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:29:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 18:29:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2019-11-28 18:29:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 18:29:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 163 transitions. [2019-11-28 18:29:10,852 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 163 transitions. Word has length 11 [2019-11-28 18:29:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:29:10,852 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 163 transitions. [2019-11-28 18:29:10,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:29:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 163 transitions. [2019-11-28 18:29:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 18:29:10,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:29:10,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:29:10,855 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:29:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:29:10,855 INFO L82 PathProgramCache]: Analyzing trace with hash 925343788, now seen corresponding path program 1 times [2019-11-28 18:29:10,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:29:10,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44421392] [2019-11-28 18:29:10,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:29:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:29:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:29:11,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44421392] [2019-11-28 18:29:11,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:29:11,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:29:11,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327292951] [2019-11-28 18:29:11,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:29:11,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:29:11,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:29:11,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:29:11,023 INFO L87 Difference]: Start difference. First operand 78 states and 163 transitions. Second operand 6 states. [2019-11-28 18:29:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:29:11,124 INFO L93 Difference]: Finished difference Result 82 states and 161 transitions. [2019-11-28 18:29:11,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:29:11,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-28 18:29:11,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:29:11,127 INFO L225 Difference]: With dead ends: 82 [2019-11-28 18:29:11,127 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 18:29:11,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:29:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 18:29:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2019-11-28 18:29:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 18:29:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 109 transitions. [2019-11-28 18:29:11,147 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 109 transitions. Word has length 12 [2019-11-28 18:29:11,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:29:11,150 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 109 transitions. [2019-11-28 18:29:11,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:29:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 109 transitions. [2019-11-28 18:29:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:29:11,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:29:11,152 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:29:11,152 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:29:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:29:11,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1348878632, now seen corresponding path program 1 times [2019-11-28 18:29:11,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:29:11,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740266228] [2019-11-28 18:29:11,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:29:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:29:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:29:11,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740266228] [2019-11-28 18:29:11,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:29:11,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:29:11,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4892085] [2019-11-28 18:29:11,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:29:11,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:29:11,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:29:11,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:29:11,277 INFO L87 Difference]: Start difference. First operand 58 states and 109 transitions. Second operand 7 states. [2019-11-28 18:29:11,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:29:11,393 INFO L93 Difference]: Finished difference Result 56 states and 103 transitions. [2019-11-28 18:29:11,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:29:11,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-28 18:29:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:29:11,395 INFO L225 Difference]: With dead ends: 56 [2019-11-28 18:29:11,395 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 18:29:11,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:29:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 18:29:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2019-11-28 18:29:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 18:29:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 88 transitions. [2019-11-28 18:29:11,401 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 88 transitions. Word has length 13 [2019-11-28 18:29:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:29:11,402 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 88 transitions. [2019-11-28 18:29:11,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:29:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 88 transitions. [2019-11-28 18:29:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:29:11,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:29:11,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:29:11,403 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:29:11,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:29:11,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1134517083, now seen corresponding path program 1 times [2019-11-28 18:29:11,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:29:11,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200279959] [2019-11-28 18:29:11,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:29:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:29:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:29:11,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200279959] [2019-11-28 18:29:11,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:29:11,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:29:11,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420208573] [2019-11-28 18:29:11,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:29:11,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:29:11,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:29:11,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:29:11,510 INFO L87 Difference]: Start difference. First operand 45 states and 88 transitions. Second operand 4 states. [2019-11-28 18:29:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:29:11,538 INFO L93 Difference]: Finished difference Result 55 states and 100 transitions. [2019-11-28 18:29:11,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:29:11,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:29:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:29:11,544 INFO L225 Difference]: With dead ends: 55 [2019-11-28 18:29:11,544 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 18:29:11,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11-28 18:29:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 18:29:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-28 18:29:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 18:29:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 54 transitions. [2019-11-28 18:29:11,548 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 54 transitions. Word has length 14 [2019-11-28 18:29:11,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:29:11,549 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 54 transitions. [2019-11-28 18:29:11,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:29:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 54 transitions. [2019-11-28 18:29:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:29:11,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:29:11,551 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:29:11,551 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:29:11,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:29:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1937154369, now seen corresponding path program 2 times [2019-11-28 18:29:11,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:29:11,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515840842] [2019-11-28 18:29:11,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:29:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:29:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:29:11,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515840842] [2019-11-28 18:29:11,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:29:11,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:29:11,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934672220] [2019-11-28 18:29:11,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:29:11,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:29:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:29:11,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:29:11,651 INFO L87 Difference]: Start difference. First operand 33 states and 54 transitions. Second operand 5 states. [2019-11-28 18:29:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:29:11,679 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2019-11-28 18:29:11,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:29:11,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:29:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:29:11,680 INFO L225 Difference]: With dead ends: 42 [2019-11-28 18:29:11,680 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 18:29:11,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:29:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 18:29:11,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 18:29:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 18:29:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-11-28 18:29:11,683 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 14 [2019-11-28 18:29:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:29:11,684 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-28 18:29:11,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:29:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-11-28 18:29:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:29:11,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:29:11,685 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:29:11,685 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:29:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:29:11,686 INFO L82 PathProgramCache]: Analyzing trace with hash 562302313, now seen corresponding path program 3 times [2019-11-28 18:29:11,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:29:11,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212117939] [2019-11-28 18:29:11,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:29:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:29:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:29:11,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212117939] [2019-11-28 18:29:11,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:29:11,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:29:11,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616749958] [2019-11-28 18:29:11,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:29:11,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:29:11,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:29:11,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:29:11,741 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 4 states. [2019-11-28 18:29:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:29:11,758 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-28 18:29:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:29:11,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:29:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:29:11,759 INFO L225 Difference]: With dead ends: 28 [2019-11-28 18:29:11,759 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 18:29:11,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:29:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 18:29:11,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 18:29:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 18:29:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-11-28 18:29:11,762 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2019-11-28 18:29:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:29:11,763 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-28 18:29:11,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:29:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2019-11-28 18:29:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:29:11,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:29:11,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:29:11,764 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:29:11,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:29:11,764 INFO L82 PathProgramCache]: Analyzing trace with hash 586461853, now seen corresponding path program 4 times [2019-11-28 18:29:11,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:29:11,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588631060] [2019-11-28 18:29:11,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:29:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:29:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:29:11,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588631060] [2019-11-28 18:29:11,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:29:11,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:29:11,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071894673] [2019-11-28 18:29:11,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:29:11,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:29:11,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:29:11,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:29:11,817 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 4 states. [2019-11-28 18:29:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:29:11,829 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2019-11-28 18:29:11,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:29:11,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:29:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:29:11,830 INFO L225 Difference]: With dead ends: 22 [2019-11-28 18:29:11,831 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 18:29:11,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:29:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 18:29:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 18:29:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 18:29:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 18:29:11,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-11-28 18:29:11,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:29:11,832 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 18:29:11,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:29:11,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 18:29:11,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 18:29:11,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:29:11 BasicIcfg [2019-11-28 18:29:11,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:29:11,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:29:11,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:29:11,839 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:29:11,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:29:07" (3/4) ... [2019-11-28 18:29:11,844 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 18:29:11,852 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-11-28 18:29:11,852 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-11-28 18:29:11,852 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-11-28 18:29:11,853 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2019-11-28 18:29:11,858 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-28 18:29:11,858 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 18:29:11,859 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 18:29:11,906 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:29:11,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:29:11,909 INFO L168 Benchmark]: Toolchain (without parser) took 5502.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 87.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:29:11,910 INFO L168 Benchmark]: CDTParser took 0.92 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:29:11,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:29:11,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.36 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-11-28 18:29:11,911 INFO L168 Benchmark]: Boogie Preprocessor took 29.61 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-11-28 18:29:11,912 INFO L168 Benchmark]: RCFGBuilder took 446.54 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:29:11,913 INFO L168 Benchmark]: TraceAbstraction took 4150.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.1 MB). Peak memory consumption was 74.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:29:11,913 INFO L168 Benchmark]: Witness Printer took 68.23 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-11-28 18:29:11,917 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.92 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 750.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.36 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.61 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. * RCFGBuilder took 446.54 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4150.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.1 MB). Peak memory consumption was 74.8 MB. Max. memory is 11.5 GB. * Witness Printer took 68.23 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.2s, 75 ProgramPointsBefore, 27 ProgramPointsAfterwards, 63 TransitionsBefore, 19 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 6 FixpointIterations, 13 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 363 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 9 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.3s, 0 MoverChecksTotal, 749 CheckedPairsTotal, 49 TotalNumberOfCompositions - 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 5 procedures, 63 locations, 1 error locations. Result: SAFE, OverallTime: 4.0s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 101 SDtfs, 143 SDslu, 97 SDs, 0 SdLazy, 92 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 5451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...