/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:25:24,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:25:24,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:25:24,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:25:24,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:25:24,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:25:24,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:25:24,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:25:24,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:25:24,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:25:24,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:25:24,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:25:24,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:25:24,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:25:24,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:25:24,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:25:24,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:25:24,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:25:24,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:25:24,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:25:24,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:25:24,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:25:24,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:25:24,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:25:24,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:25:24,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:25:24,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:25:24,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:25:24,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:25:24,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:25:24,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:25:24,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:25:24,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:25:24,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:25:24,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:25:24,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:25:24,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:25:24,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:25:24,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:25:24,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:25:24,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:25:24,558 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-11-09 15:25:24,587 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:25:24,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:25:24,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:25:24,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:25:24,590 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:25:24,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:25:24,591 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:25:24,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:25:24,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:25:24,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:25:24,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:25:24,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:25:24,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:25:24,592 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:25:24,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:25:24,593 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:25:24,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:25:24,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:25:24,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:25:24,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:25:24,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:25:24,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:25:24,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:25:24,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:25:24,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:25:24,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:25:24,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:25:24,597 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:25:24,597 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:25:24,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:25:24,598 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 15:25:25,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:25:25,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:25:25,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:25:25,112 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:25:25,113 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:25:25,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2020-11-09 15:25:25,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13729ea08/a4025e35706e406fb74f96c02f5e3ab4/FLAG00d0425eb [2020-11-09 15:25:25,902 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:25:25,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2020-11-09 15:25:25,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13729ea08/a4025e35706e406fb74f96c02f5e3ab4/FLAG00d0425eb [2020-11-09 15:25:26,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13729ea08/a4025e35706e406fb74f96c02f5e3ab4 [2020-11-09 15:25:26,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:25:26,183 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:25:26,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:25:26,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:25:26,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:25:26,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:26" (1/1) ... [2020-11-09 15:25:26,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76dd02cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:26, skipping insertion in model container [2020-11-09 15:25:26,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:26" (1/1) ... [2020-11-09 15:25:26,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:25:26,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:25:27,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:25:27,019 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:25:27,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:25:27,236 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:25:27,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:27 WrapperNode [2020-11-09 15:25:27,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:25:27,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:25:27,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:25:27,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:25:27,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:27" (1/1) ... [2020-11-09 15:25:27,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:27" (1/1) ... [2020-11-09 15:25:27,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:25:27,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:25:27,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:25:27,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:25:27,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:27" (1/1) ... [2020-11-09 15:25:27,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:27" (1/1) ... [2020-11-09 15:25:27,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:27" (1/1) ... [2020-11-09 15:25:27,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:27" (1/1) ... [2020-11-09 15:25:27,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:27" (1/1) ... [2020-11-09 15:25:27,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:27" (1/1) ... [2020-11-09 15:25:27,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:27" (1/1) ... [2020-11-09 15:25:27,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:25:27,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:25:27,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:25:27,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:25:27,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:27" (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 [2020-11-09 15:25:27,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:25:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:25:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:25:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:25:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:25:27,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:25:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:25:27,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:25:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:25:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:25:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:25:27,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:25:27,519 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 15:25:30,217 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:25:30,218 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:25:30,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:30 BoogieIcfgContainer [2020-11-09 15:25:30,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:25:30,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:25:30,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:25:30,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:25:30,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:25:26" (1/3) ... [2020-11-09 15:25:30,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c89dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:25:30, skipping insertion in model container [2020-11-09 15:25:30,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:27" (2/3) ... [2020-11-09 15:25:30,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c89dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:25:30, skipping insertion in model container [2020-11-09 15:25:30,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:30" (3/3) ... [2020-11-09 15:25:30,229 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_tso.opt.i [2020-11-09 15:25:30,245 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:25:30,246 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:25:30,250 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:25:30,251 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:25:30,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,285 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,286 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,286 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,286 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,292 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,292 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,293 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,293 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,293 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,294 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,297 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,313 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,315 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,315 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:30,317 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:25:30,329 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-09 15:25:30,352 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:25:30,353 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:25:30,353 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:25:30,353 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:25:30,353 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:25:30,353 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:25:30,354 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:25:30,354 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:25:30,366 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:25:30,367 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 84 transitions, 178 flow [2020-11-09 15:25:30,370 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 84 transitions, 178 flow [2020-11-09 15:25:30,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 84 transitions, 178 flow [2020-11-09 15:25:30,417 INFO L129 PetriNetUnfolder]: 3/82 cut-off events. [2020-11-09 15:25:30,417 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:25:30,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 3/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-11-09 15:25:30,424 INFO L116 LiptonReduction]: Number of co-enabled transitions 1038 [2020-11-09 15:25:31,480 WARN L194 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 15:25:32,858 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-09 15:25:33,021 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-09 15:25:33,358 WARN L194 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 15:25:33,479 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 15:25:34,060 WARN L194 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-11-09 15:25:34,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:25:34,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:34,501 WARN L194 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 15:25:36,860 WARN L194 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-11-09 15:25:36,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-09 15:25:36,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:36,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-09 15:25:36,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:37,989 WARN L194 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 144 DAG size of output: 115 [2020-11-09 15:25:40,699 WARN L194 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2020-11-09 15:25:40,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:25:40,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:25:40,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:40,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:25:40,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 1] term [2020-11-09 15:25:40,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 1] term [2020-11-09 15:25:40,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:25:40,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:25:40,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:40,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:40,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:40,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:40,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:40,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:40,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:40,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:40,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:40,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:40,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:43,676 WARN L194 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 375 DAG size of output: 259 [2020-11-09 15:25:45,679 WARN L194 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2020-11-09 15:25:45,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-09 15:25:45,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:45,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-09 15:25:45,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:46,601 WARN L194 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2020-11-09 15:25:49,518 WARN L194 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 311 DAG size of output: 266 [2020-11-09 15:25:49,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:25:49,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:49,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-11-09 15:25:49,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:49,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:49,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 15:25:49,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:25:49,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:25:49,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:49,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:49,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:49,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:49,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:49,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:25:49,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:49,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:25:49,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:49,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:49,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:49,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:25:49,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:49,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:25:49,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:49,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:49,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:49,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:25:49,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:49,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:25:49,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:49,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:49,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:49,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:25:49,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:49,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:25:49,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:49,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:25:49,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:49,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:49,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:53,329 WARN L194 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 348 DAG size of output: 233 [2020-11-09 15:25:53,983 WARN L194 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-09 15:25:54,360 WARN L194 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-09 15:25:55,526 WARN L194 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 252 [2020-11-09 15:25:56,673 WARN L194 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 252 [2020-11-09 15:25:56,902 WARN L194 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:25:57,095 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:25:57,278 WARN L194 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:25:57,456 WARN L194 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:25:57,952 WARN L194 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-11-09 15:25:58,200 WARN L194 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-09 15:25:58,730 WARN L194 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-11-09 15:25:58,973 WARN L194 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-09 15:25:58,982 INFO L131 LiptonReduction]: Checked pairs total: 2926 [2020-11-09 15:25:58,982 INFO L133 LiptonReduction]: Total number of compositions: 85 [2020-11-09 15:25:58,990 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-11-09 15:25:59,006 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-11-09 15:25:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-11-09 15:25:59,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 15:25:59,015 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:59,015 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 15:25:59,016 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:59,022 INFO L82 PathProgramCache]: Analyzing trace with hash 916373333, now seen corresponding path program 1 times [2020-11-09 15:25:59,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:59,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905714976] [2020-11-09 15:25:59,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:25:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:25:59,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905714976] [2020-11-09 15:25:59,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:25:59,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:25:59,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1996272036] [2020-11-09 15:25:59,312 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:25:59,317 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:25:59,332 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 15:25:59,333 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:25:59,338 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:25:59,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:25:59,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:25:59,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:25:59,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:25:59,360 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-11-09 15:25:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:25:59,456 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-11-09 15:25:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:25:59,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 15:25:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:25:59,469 INFO L225 Difference]: With dead ends: 137 [2020-11-09 15:25:59,469 INFO L226 Difference]: Without dead ends: 112 [2020-11-09 15:25:59,471 INFO L677 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 [2020-11-09 15:25:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-09 15:25:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-09 15:25:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-09 15:25:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-11-09 15:25:59,520 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-11-09 15:25:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:25:59,520 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-11-09 15:25:59,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:25:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-11-09 15:25:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 15:25:59,524 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:59,524 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:25:59,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:25:59,525 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:59,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:59,526 INFO L82 PathProgramCache]: Analyzing trace with hash 166530678, now seen corresponding path program 1 times [2020-11-09 15:25:59,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:59,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71880010] [2020-11-09 15:25:59,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:25:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:25:59,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71880010] [2020-11-09 15:25:59,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:25:59,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:25:59,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1321978081] [2020-11-09 15:25:59,766 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:25:59,767 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:25:59,769 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-11-09 15:25:59,770 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:25:59,770 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:25:59,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:25:59,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:25:59,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:25:59,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:25:59,773 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 4 states. [2020-11-09 15:25:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:25:59,844 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-11-09 15:25:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:25:59,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-11-09 15:25:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:25:59,848 INFO L225 Difference]: With dead ends: 110 [2020-11-09 15:25:59,849 INFO L226 Difference]: Without dead ends: 110 [2020-11-09 15:25:59,849 INFO L677 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 [2020-11-09 15:25:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-09 15:25:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-11-09 15:25:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-09 15:25:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-11-09 15:25:59,864 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-11-09 15:25:59,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:25:59,865 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-11-09 15:25:59,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:25:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-11-09 15:25:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-09 15:25:59,866 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:59,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:25:59,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:25:59,867 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:59,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:59,867 INFO L82 PathProgramCache]: Analyzing trace with hash 867482972, now seen corresponding path program 1 times [2020-11-09 15:25:59,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:59,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880578103] [2020-11-09 15:25:59,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:00,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880578103] [2020-11-09 15:26:00,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:00,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:26:00,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1314154062] [2020-11-09 15:26:00,212 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:00,214 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:00,216 INFO L252 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-11-09 15:26:00,216 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:00,216 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:26:00,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:26:00,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:00,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:26:00,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:26:00,218 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 5 states. [2020-11-09 15:26:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:00,312 INFO L93 Difference]: Finished difference Result 106 states and 237 transitions. [2020-11-09 15:26:00,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:26:00,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-11-09 15:26:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:00,316 INFO L225 Difference]: With dead ends: 106 [2020-11-09 15:26:00,316 INFO L226 Difference]: Without dead ends: 106 [2020-11-09 15:26:00,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:26:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-09 15:26:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-11-09 15:26:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-09 15:26:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 237 transitions. [2020-11-09 15:26:00,327 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 237 transitions. Word has length 8 [2020-11-09 15:26:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:00,328 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 237 transitions. [2020-11-09 15:26:00,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:26:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 237 transitions. [2020-11-09 15:26:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 15:26:00,329 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:00,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:26:00,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:26:00,329 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:00,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:00,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1731741799, now seen corresponding path program 1 times [2020-11-09 15:26:00,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:00,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628781932] [2020-11-09 15:26:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:00,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628781932] [2020-11-09 15:26:00,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:00,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:26:00,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1941592197] [2020-11-09 15:26:00,477 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:00,478 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:00,480 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 21 transitions. [2020-11-09 15:26:00,480 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:00,524 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:26:00,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:26:00,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:00,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:26:00,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:26:00,526 INFO L87 Difference]: Start difference. First operand 106 states and 237 transitions. Second operand 5 states. [2020-11-09 15:26:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:00,668 INFO L93 Difference]: Finished difference Result 104 states and 231 transitions. [2020-11-09 15:26:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:26:00,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-09 15:26:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:00,674 INFO L225 Difference]: With dead ends: 104 [2020-11-09 15:26:00,675 INFO L226 Difference]: Without dead ends: 104 [2020-11-09 15:26:00,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:26:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-09 15:26:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2020-11-09 15:26:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-09 15:26:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 229 transitions. [2020-11-09 15:26:00,688 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 229 transitions. Word has length 9 [2020-11-09 15:26:00,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:00,688 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 229 transitions. [2020-11-09 15:26:00,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:26:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 229 transitions. [2020-11-09 15:26:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:26:00,690 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:00,690 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:26:00,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:26:00,690 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:00,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:00,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2144387467, now seen corresponding path program 1 times [2020-11-09 15:26:00,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:00,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801858014] [2020-11-09 15:26:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:00,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801858014] [2020-11-09 15:26:00,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:00,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:26:00,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1542794766] [2020-11-09 15:26:00,945 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:00,947 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:00,950 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-11-09 15:26:00,950 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:00,979 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:26:00,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:26:00,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:00,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:26:00,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:26:00,981 INFO L87 Difference]: Start difference. First operand 103 states and 229 transitions. Second operand 6 states. [2020-11-09 15:26:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:01,157 INFO L93 Difference]: Finished difference Result 113 states and 249 transitions. [2020-11-09 15:26:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:26:01,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-09 15:26:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:01,160 INFO L225 Difference]: With dead ends: 113 [2020-11-09 15:26:01,160 INFO L226 Difference]: Without dead ends: 113 [2020-11-09 15:26:01,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:26:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-11-09 15:26:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-11-09 15:26:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-11-09 15:26:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 249 transitions. [2020-11-09 15:26:01,171 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 249 transitions. Word has length 10 [2020-11-09 15:26:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:01,171 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 249 transitions. [2020-11-09 15:26:01,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:26:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 249 transitions. [2020-11-09 15:26:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:26:01,172 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:01,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:26:01,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:26:01,173 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:01,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash 427426939, now seen corresponding path program 1 times [2020-11-09 15:26:01,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:01,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574886404] [2020-11-09 15:26:01,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:01,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574886404] [2020-11-09 15:26:01,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:01,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:26:01,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317020937] [2020-11-09 15:26:01,326 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:01,328 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:01,330 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-11-09 15:26:01,330 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:01,330 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:26:01,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:26:01,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:01,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:26:01,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:26:01,332 INFO L87 Difference]: Start difference. First operand 113 states and 249 transitions. Second operand 4 states. [2020-11-09 15:26:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:01,375 INFO L93 Difference]: Finished difference Result 100 states and 187 transitions. [2020-11-09 15:26:01,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:26:01,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-09 15:26:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:01,377 INFO L225 Difference]: With dead ends: 100 [2020-11-09 15:26:01,377 INFO L226 Difference]: Without dead ends: 71 [2020-11-09 15:26:01,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:26:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-09 15:26:01,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-11-09 15:26:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-09 15:26:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 123 transitions. [2020-11-09 15:26:01,383 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 123 transitions. Word has length 10 [2020-11-09 15:26:01,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:01,383 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 123 transitions. [2020-11-09 15:26:01,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:26:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 123 transitions. [2020-11-09 15:26:01,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 15:26:01,384 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:01,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:26:01,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:26:01,385 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:01,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:01,385 INFO L82 PathProgramCache]: Analyzing trace with hash 859195324, now seen corresponding path program 1 times [2020-11-09 15:26:01,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:01,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266809648] [2020-11-09 15:26:01,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:01,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266809648] [2020-11-09 15:26:01,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:01,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:26:01,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1107196201] [2020-11-09 15:26:01,476 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:01,482 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:01,485 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-11-09 15:26:01,486 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:01,489 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:26:01,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:26:01,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:01,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:26:01,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:26:01,493 INFO L87 Difference]: Start difference. First operand 71 states and 123 transitions. Second operand 5 states. [2020-11-09 15:26:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:01,564 INFO L93 Difference]: Finished difference Result 55 states and 89 transitions. [2020-11-09 15:26:01,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:26:01,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-09 15:26:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:01,567 INFO L225 Difference]: With dead ends: 55 [2020-11-09 15:26:01,567 INFO L226 Difference]: Without dead ends: 44 [2020-11-09 15:26:01,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:26:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-11-09 15:26:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-11-09 15:26:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-09 15:26:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2020-11-09 15:26:01,570 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 11 [2020-11-09 15:26:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:01,570 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. [2020-11-09 15:26:01,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:26:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2020-11-09 15:26:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:26:01,571 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:01,571 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:26:01,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:26:01,572 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:01,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:01,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1015613484, now seen corresponding path program 1 times [2020-11-09 15:26:01,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:01,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268605731] [2020-11-09 15:26:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:01,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268605731] [2020-11-09 15:26:01,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:01,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:26:01,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [35383611] [2020-11-09 15:26:01,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:01,661 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:01,668 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 37 transitions. [2020-11-09 15:26:01,668 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:01,686 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:01,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:01,688 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:01,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:01,689 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:01,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:01,770 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:01,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:01,772 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:01,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:01,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:01,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:01,840 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:01,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:01,841 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:01,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:01,845 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:01,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:01,888 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:26:01,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:26:01,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:01,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:26:01,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:26:01,890 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 4 states. [2020-11-09 15:26:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:01,926 INFO L93 Difference]: Finished difference Result 54 states and 82 transitions. [2020-11-09 15:26:01,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:26:01,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-09 15:26:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:01,928 INFO L225 Difference]: With dead ends: 54 [2020-11-09 15:26:01,928 INFO L226 Difference]: Without dead ends: 24 [2020-11-09 15:26:01,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:26:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-09 15:26:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-09 15:26:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-09 15:26:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-11-09 15:26:01,931 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2020-11-09 15:26:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:01,931 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-11-09 15:26:01,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:26:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-11-09 15:26:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:26:01,933 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:01,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:26:01,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:26:01,933 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:01,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1062004012, now seen corresponding path program 2 times [2020-11-09 15:26:01,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:01,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475275452] [2020-11-09 15:26:01,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:26:02,047 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:26:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:26:02,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:26:02,188 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:26:02,189 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:26:02,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:26:02,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:26:02 BasicIcfg [2020-11-09 15:26:02,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:26:02,311 INFO L168 Benchmark]: Toolchain (without parser) took 36133.66 ms. Allocated memory was 156.2 MB in the beginning and 325.1 MB in the end (delta: 168.8 MB). Free memory was 129.8 MB in the beginning and 273.4 MB in the end (delta: -143.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 8.0 GB. [2020-11-09 15:26:02,311 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 125.8 MB. Free memory was 100.5 MB in the beginning and 100.5 MB in the end (delta: 69.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:26:02,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1051.34 ms. Allocated memory is still 156.2 MB. Free memory was 129.2 MB in the beginning and 127.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 8.0 GB. [2020-11-09 15:26:02,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.56 ms. Allocated memory is still 156.2 MB. Free memory was 127.0 MB in the beginning and 124.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:26:02,316 INFO L168 Benchmark]: Boogie Preprocessor took 49.60 ms. Allocated memory is still 156.2 MB. Free memory was 124.0 MB in the beginning and 122.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:26:02,316 INFO L168 Benchmark]: RCFGBuilder took 2803.37 ms. Allocated memory was 156.2 MB in the beginning and 187.7 MB in the end (delta: 31.5 MB). Free memory was 121.9 MB in the beginning and 126.6 MB in the end (delta: -4.7 MB). Peak memory consumption was 64.9 MB. Max. memory is 8.0 GB. [2020-11-09 15:26:02,317 INFO L168 Benchmark]: TraceAbstraction took 32086.99 ms. Allocated memory was 187.7 MB in the beginning and 325.1 MB in the end (delta: 137.4 MB). Free memory was 126.0 MB in the beginning and 273.4 MB in the end (delta: -147.3 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:26:02,321 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 125.8 MB. Free memory was 100.5 MB in the beginning and 100.5 MB in the end (delta: 69.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1051.34 ms. Allocated memory is still 156.2 MB. Free memory was 129.2 MB in the beginning and 127.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 122.56 ms. Allocated memory is still 156.2 MB. Free memory was 127.0 MB in the beginning and 124.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 49.60 ms. Allocated memory is still 156.2 MB. Free memory was 124.0 MB in the beginning and 122.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2803.37 ms. Allocated memory was 156.2 MB in the beginning and 187.7 MB in the end (delta: 31.5 MB). Free memory was 121.9 MB in the beginning and 126.6 MB in the end (delta: -4.7 MB). Peak memory consumption was 64.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 32086.99 ms. Allocated memory was 187.7 MB in the beginning and 325.1 MB in the end (delta: 137.4 MB). Free memory was 126.0 MB in the beginning and 273.4 MB in the end (delta: -147.3 MB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 547 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 36 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 28.6s, 88 PlacesBefore, 26 PlacesAfterwards, 84 TransitionsBefore, 19 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 85 TotalNumberOfCompositions, 2926 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1455; [L793] FCALL, FORK 0 pthread_create(&t1455, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1456; [L795] FCALL, FORK 0 pthread_create(&t1456, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix054_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.8s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 28.6s, HoareTripleCheckerStatistics: 124 SDtfs, 111 SDslu, 147 SDs, 0 SdLazy, 121 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred 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, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 3990 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, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...