./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/lamport.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-atomic/lamport.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 4f308056a588d49578d6b80408483bd72f47ef45 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:57:30,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:57:30,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:57:30,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:57:30,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:57:30,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:57:30,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:57:30,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:57:30,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:57:30,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:57:30,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:57:30,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:57:30,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:57:30,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:57:30,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:57:30,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:57:30,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:57:30,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:57:30,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:57:30,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:57:30,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:57:30,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:57:30,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:57:30,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:57:30,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:57:30,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:57:30,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:57:30,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:57:30,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:57:30,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:57:30,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:57:30,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:57:30,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:57:30,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:57:30,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:57:30,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:57:30,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:57:30,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:57:30,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:57:30,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:57:30,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:57:30,169 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:57:30,189 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:57:30,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:57:30,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:57:30,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:57:30,194 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:57:30,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:57:30,195 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:57:30,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:57:30,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:57:30,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:57:30,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:57:30,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:57:30,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:57:30,197 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:57:30,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:57:30,197 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:57:30,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:57:30,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:57:30,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:57:30,198 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:57:30,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:57:30,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:57:30,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:57:30,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:57:30,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:57:30,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:57:30,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:57:30,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:57:30,201 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:57:30,201 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 -> 4f308056a588d49578d6b80408483bd72f47ef45 [2019-11-28 17:57:30,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:57:30,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:57:30,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:57:30,541 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:57:30,541 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:57:30,542 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/lamport.i [2019-11-28 17:57:30,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f701722/09756da5661449a08512ebd62c449918/FLAG74040a8c1 [2019-11-28 17:57:31,193 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:57:31,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2019-11-28 17:57:31,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f701722/09756da5661449a08512ebd62c449918/FLAG74040a8c1 [2019-11-28 17:57:31,483 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f701722/09756da5661449a08512ebd62c449918 [2019-11-28 17:57:31,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:57:31,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:57:31,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:57:31,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:57:31,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:57:31,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:57:31" (1/1) ... [2019-11-28 17:57:31,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f05020b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:31, skipping insertion in model container [2019-11-28 17:57:31,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:57:31" (1/1) ... [2019-11-28 17:57:31,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:57:31,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:57:31,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:57:31,972 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:57:32,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:57:32,111 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:57:32,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:32 WrapperNode [2019-11-28 17:57:32,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:57:32,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:57:32,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:57:32,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:57:32,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:32" (1/1) ... [2019-11-28 17:57:32,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:32" (1/1) ... [2019-11-28 17:57:32,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:57:32,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:57:32,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:57:32,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:57:32,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:32" (1/1) ... [2019-11-28 17:57:32,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:32" (1/1) ... [2019-11-28 17:57:32,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:32" (1/1) ... [2019-11-28 17:57:32,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:32" (1/1) ... [2019-11-28 17:57:32,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:32" (1/1) ... [2019-11-28 17:57:32,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:32" (1/1) ... [2019-11-28 17:57:32,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:32" (1/1) ... [2019-11-28 17:57:32,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:57:32,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:57:32,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:57:32,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:57:32,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:32" (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 17:57:32,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 17:57:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-11-28 17:57:32,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-11-28 17:57:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-28 17:57:32,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-28 17:57:32,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 17:57:32,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:57:32,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:57:32,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:57:32,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:57:32,283 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 17:57:32,705 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:57:32,705 INFO L287 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-28 17:57:32,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:57:32 BoogieIcfgContainer [2019-11-28 17:57:32,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:57:32,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:57:32,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:57:32,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:57:32,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:57:31" (1/3) ... [2019-11-28 17:57:32,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4064455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:57:32, skipping insertion in model container [2019-11-28 17:57:32,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:32" (2/3) ... [2019-11-28 17:57:32,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4064455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:57:32, skipping insertion in model container [2019-11-28 17:57:32,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:57:32" (3/3) ... [2019-11-28 17:57:32,722 INFO L109 eAbstractionObserver]: Analyzing ICFG lamport.i [2019-11-28 17:57:32,732 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 17:57:32,733 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:57:32,742 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 17:57:32,743 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 17:57:32,777 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:32,778 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:32,778 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:32,778 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:32,779 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:32,779 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:32,780 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:32,780 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:32,781 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:32,781 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:32,782 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:32,782 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:32,808 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 17:57:32,824 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:57:32,824 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:57:32,825 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:57:32,825 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:57:32,825 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:57:32,825 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:57:32,825 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:57:32,825 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:57:32,838 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 103 transitions [2019-11-28 17:57:32,840 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 103 transitions [2019-11-28 17:57:32,889 INFO L134 PetriNetUnfolder]: 25/103 cut-off events. [2019-11-28 17:57:32,890 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:57:32,899 INFO L76 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 103 events. 25/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 342 event pairs. 19/96 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2019-11-28 17:57:32,908 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 103 transitions [2019-11-28 17:57:32,933 INFO L134 PetriNetUnfolder]: 25/103 cut-off events. [2019-11-28 17:57:32,934 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:57:32,937 INFO L76 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 103 events. 25/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 342 event pairs. 19/96 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2019-11-28 17:57:32,944 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3196 [2019-11-28 17:57:32,945 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 17:57:34,248 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-28 17:57:34,327 INFO L206 etLargeBlockEncoding]: Checked pairs total: 9503 [2019-11-28 17:57:34,327 INFO L214 etLargeBlockEncoding]: Total number of compositions: 44 [2019-11-28 17:57:34,330 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 63 transitions [2019-11-28 17:57:34,394 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 719 states. [2019-11-28 17:57:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states. [2019-11-28 17:57:34,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-28 17:57:34,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:34,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-28 17:57:34,404 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash 14012195, now seen corresponding path program 1 times [2019-11-28 17:57:34,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:34,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453405511] [2019-11-28 17:57:34,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:34,599 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 17:57:34,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453405511] [2019-11-28 17:57:34,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:34,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:57:34,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200418245] [2019-11-28 17:57:34,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:57:34,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:34,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:57:34,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:57:34,625 INFO L87 Difference]: Start difference. First operand 719 states. Second operand 2 states. [2019-11-28 17:57:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:34,672 INFO L93 Difference]: Finished difference Result 719 states and 2103 transitions. [2019-11-28 17:57:34,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:57:34,674 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-11-28 17:57:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:34,701 INFO L225 Difference]: With dead ends: 719 [2019-11-28 17:57:34,701 INFO L226 Difference]: Without dead ends: 680 [2019-11-28 17:57:34,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:57:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-11-28 17:57:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2019-11-28 17:57:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-11-28 17:57:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 2018 transitions. [2019-11-28 17:57:34,836 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 2018 transitions. Word has length 4 [2019-11-28 17:57:34,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:34,839 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 2018 transitions. [2019-11-28 17:57:34,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:57:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 2018 transitions. [2019-11-28 17:57:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:57:34,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:34,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:34,842 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash -870713509, now seen corresponding path program 1 times [2019-11-28 17:57:34,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:34,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669495311] [2019-11-28 17:57:34,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:34,941 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 17:57:34,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669495311] [2019-11-28 17:57:34,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:34,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:57:34,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372920260] [2019-11-28 17:57:34,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:34,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:34,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:34,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:34,946 INFO L87 Difference]: Start difference. First operand 680 states and 2018 transitions. Second operand 3 states. [2019-11-28 17:57:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:35,003 INFO L93 Difference]: Finished difference Result 685 states and 1989 transitions. [2019-11-28 17:57:35,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:35,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 17:57:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:35,013 INFO L225 Difference]: With dead ends: 685 [2019-11-28 17:57:35,013 INFO L226 Difference]: Without dead ends: 568 [2019-11-28 17:57:35,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 17:57:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-11-28 17:57:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 550. [2019-11-28 17:57:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-11-28 17:57:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1644 transitions. [2019-11-28 17:57:35,047 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1644 transitions. Word has length 9 [2019-11-28 17:57:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:35,057 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 1644 transitions. [2019-11-28 17:57:35,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1644 transitions. [2019-11-28 17:57:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 17:57:35,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:35,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:35,062 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:35,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:35,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1073713561, now seen corresponding path program 1 times [2019-11-28 17:57:35,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:35,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811066218] [2019-11-28 17:57:35,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:35,132 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 17:57:35,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811066218] [2019-11-28 17:57:35,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:35,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:57:35,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434780136] [2019-11-28 17:57:35,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:35,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:35,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:35,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,134 INFO L87 Difference]: Start difference. First operand 550 states and 1644 transitions. Second operand 3 states. [2019-11-28 17:57:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:35,169 INFO L93 Difference]: Finished difference Result 531 states and 1570 transitions. [2019-11-28 17:57:35,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:35,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 17:57:35,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:35,173 INFO L225 Difference]: With dead ends: 531 [2019-11-28 17:57:35,173 INFO L226 Difference]: Without dead ends: 408 [2019-11-28 17:57:35,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 17:57:35,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-28 17:57:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-11-28 17:57:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-28 17:57:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1242 transitions. [2019-11-28 17:57:35,192 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 1242 transitions. Word has length 11 [2019-11-28 17:57:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:35,193 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 1242 transitions. [2019-11-28 17:57:35,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 1242 transitions. [2019-11-28 17:57:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:57:35,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:35,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:35,203 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:35,203 INFO L82 PathProgramCache]: Analyzing trace with hash -783095282, now seen corresponding path program 1 times [2019-11-28 17:57:35,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:35,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235991974] [2019-11-28 17:57:35,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:35,265 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 17:57:35,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235991974] [2019-11-28 17:57:35,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:35,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:57:35,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907734337] [2019-11-28 17:57:35,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:35,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:35,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:35,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,267 INFO L87 Difference]: Start difference. First operand 408 states and 1242 transitions. Second operand 3 states. [2019-11-28 17:57:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:35,341 INFO L93 Difference]: Finished difference Result 538 states and 1566 transitions. [2019-11-28 17:57:35,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:35,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:57:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:35,347 INFO L225 Difference]: With dead ends: 538 [2019-11-28 17:57:35,347 INFO L226 Difference]: Without dead ends: 424 [2019-11-28 17:57:35,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-11-28 17:57:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 398. [2019-11-28 17:57:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-28 17:57:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1161 transitions. [2019-11-28 17:57:35,364 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1161 transitions. Word has length 17 [2019-11-28 17:57:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:35,365 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 1161 transitions. [2019-11-28 17:57:35,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1161 transitions. [2019-11-28 17:57:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:57:35,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:35,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:35,367 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:35,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:35,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1243088422, now seen corresponding path program 1 times [2019-11-28 17:57:35,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:35,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074725723] [2019-11-28 17:57:35,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:35,428 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 17:57:35,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074725723] [2019-11-28 17:57:35,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:35,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:57:35,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074483380] [2019-11-28 17:57:35,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:35,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:35,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:35,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,431 INFO L87 Difference]: Start difference. First operand 398 states and 1161 transitions. Second operand 3 states. [2019-11-28 17:57:35,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:35,458 INFO L93 Difference]: Finished difference Result 702 states and 2033 transitions. [2019-11-28 17:57:35,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:35,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:57:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:35,466 INFO L225 Difference]: With dead ends: 702 [2019-11-28 17:57:35,466 INFO L226 Difference]: Without dead ends: 702 [2019-11-28 17:57:35,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-11-28 17:57:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 422. [2019-11-28 17:57:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-28 17:57:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1239 transitions. [2019-11-28 17:57:35,491 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1239 transitions. Word has length 17 [2019-11-28 17:57:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:35,492 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 1239 transitions. [2019-11-28 17:57:35,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1239 transitions. [2019-11-28 17:57:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:57:35,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:35,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:35,499 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:35,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1398088036, now seen corresponding path program 2 times [2019-11-28 17:57:35,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:35,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755167729] [2019-11-28 17:57:35,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:35,593 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 17:57:35,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755167729] [2019-11-28 17:57:35,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:35,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:57:35,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884654843] [2019-11-28 17:57:35,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:35,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:35,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:35,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,597 INFO L87 Difference]: Start difference. First operand 422 states and 1239 transitions. Second operand 3 states. [2019-11-28 17:57:35,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:35,618 INFO L93 Difference]: Finished difference Result 650 states and 1805 transitions. [2019-11-28 17:57:35,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:35,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:57:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:35,624 INFO L225 Difference]: With dead ends: 650 [2019-11-28 17:57:35,625 INFO L226 Difference]: Without dead ends: 642 [2019-11-28 17:57:35,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-28 17:57:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 456. [2019-11-28 17:57:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-28 17:57:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1316 transitions. [2019-11-28 17:57:35,642 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1316 transitions. Word has length 17 [2019-11-28 17:57:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:35,643 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 1316 transitions. [2019-11-28 17:57:35,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1316 transitions. [2019-11-28 17:57:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:57:35,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:35,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:35,646 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:35,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:35,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1301572, now seen corresponding path program 2 times [2019-11-28 17:57:35,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:35,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572583404] [2019-11-28 17:57:35,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:35,682 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 17:57:35,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572583404] [2019-11-28 17:57:35,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:35,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:57:35,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943732567] [2019-11-28 17:57:35,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:35,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:35,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:35,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,685 INFO L87 Difference]: Start difference. First operand 456 states and 1316 transitions. Second operand 3 states. [2019-11-28 17:57:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:35,730 INFO L93 Difference]: Finished difference Result 406 states and 1059 transitions. [2019-11-28 17:57:35,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:35,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:57:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:35,733 INFO L225 Difference]: With dead ends: 406 [2019-11-28 17:57:35,733 INFO L226 Difference]: Without dead ends: 254 [2019-11-28 17:57:35,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-28 17:57:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 216. [2019-11-28 17:57:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-28 17:57:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 520 transitions. [2019-11-28 17:57:35,741 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 520 transitions. Word has length 17 [2019-11-28 17:57:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:35,742 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 520 transitions. [2019-11-28 17:57:35,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 520 transitions. [2019-11-28 17:57:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 17:57:35,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:35,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:35,744 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:35,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash 567307087, now seen corresponding path program 1 times [2019-11-28 17:57:35,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:35,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366617692] [2019-11-28 17:57:35,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:35,782 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 17:57:35,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366617692] [2019-11-28 17:57:35,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:35,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:57:35,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982133991] [2019-11-28 17:57:35,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:35,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:35,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:35,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,784 INFO L87 Difference]: Start difference. First operand 216 states and 520 transitions. Second operand 3 states. [2019-11-28 17:57:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:35,799 INFO L93 Difference]: Finished difference Result 224 states and 530 transitions. [2019-11-28 17:57:35,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:35,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 17:57:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:35,802 INFO L225 Difference]: With dead ends: 224 [2019-11-28 17:57:35,802 INFO L226 Difference]: Without dead ends: 208 [2019-11-28 17:57:35,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-28 17:57:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-11-28 17:57:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-28 17:57:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 496 transitions. [2019-11-28 17:57:35,811 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 496 transitions. Word has length 19 [2019-11-28 17:57:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:35,811 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 496 transitions. [2019-11-28 17:57:35,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 496 transitions. [2019-11-28 17:57:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 17:57:35,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:35,813 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:35,813 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:35,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:35,813 INFO L82 PathProgramCache]: Analyzing trace with hash 684902644, now seen corresponding path program 1 times [2019-11-28 17:57:35,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:35,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604735456] [2019-11-28 17:57:35,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:35,853 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 17:57:35,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604735456] [2019-11-28 17:57:35,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:35,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:57:35,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495175297] [2019-11-28 17:57:35,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:35,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:35,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:35,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,859 INFO L87 Difference]: Start difference. First operand 208 states and 496 transitions. Second operand 3 states. [2019-11-28 17:57:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:35,865 INFO L93 Difference]: Finished difference Result 142 states and 367 transitions. [2019-11-28 17:57:35,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:35,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 17:57:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:35,867 INFO L225 Difference]: With dead ends: 142 [2019-11-28 17:57:35,867 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:57:35,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:57:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:57:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:57:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:57:35,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-11-28 17:57:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:35,870 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:57:35,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:57:35,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:57:35,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:57:35 BasicIcfg [2019-11-28 17:57:35,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:57:35,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:57:35,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:57:35,878 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:57:35,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:57:32" (3/4) ... [2019-11-28 17:57:35,884 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:57:35,892 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2019-11-28 17:57:35,892 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-28 17:57:35,897 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 17:57:35,897 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 17:57:35,898 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 17:57:35,958 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:57:35,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:57:35,960 INFO L168 Benchmark]: Toolchain (without parser) took 4471.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:35,960 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:57:35,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -125.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:35,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:35,966 INFO L168 Benchmark]: Boogie Preprocessor took 43.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:57:35,967 INFO L168 Benchmark]: RCFGBuilder took 486.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:35,973 INFO L168 Benchmark]: TraceAbstraction took 3169.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -90.7 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:35,973 INFO L168 Benchmark]: Witness Printer took 80.48 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:35,978 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.75 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 622.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -125.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 486.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3169.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -90.7 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Witness Printer took 80.48 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 84 ProgramPointsBefore, 51 ProgramPointsAfterwards, 103 TransitionsBefore, 63 TransitionsAfterwards, 3196 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 22 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 8 ChoiceCompositions, 1170 VarBasedMoverChecksPositive, 91 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 63 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 9503 CheckedPairsTotal, 44 TotalNumberOfCompositions - PositiveResult [Line: 723]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 697]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Result: SAFE, OverallTime: 3.0s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 542 SDtfs, 221 SDslu, 266 SDs, 0 SdLazy, 93 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=719occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 548 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 3005 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...