/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:35:06,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:35:06,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:35:06,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:35:06,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:35:06,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:35:06,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:35:06,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:35:06,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:35:06,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:35:06,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:35:06,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:35:06,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:35:06,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:35:06,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:35:06,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:35:06,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:35:06,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:35:06,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:35:06,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:35:06,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:35:06,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:35:06,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:35:06,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:35:06,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:35:06,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:35:06,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:35:06,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:35:06,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:35:06,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:35:06,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:35:06,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:35:06,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:35:06,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:35:06,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:35:06,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:35:06,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:35:06,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:35:06,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:35:06,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:35:06,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:35:06,147 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.epf [2020-10-05 23:35:06,169 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:35:06,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:35:06,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:35:06,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:35:06,171 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:35:06,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:35:06,172 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:35:06,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:35:06,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:35:06,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:35:06,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:35:06,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:35:06,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:35:06,173 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:35:06,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:35:06,174 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:35:06,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:35:06,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:35:06,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:35:06,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:35:06,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:35:06,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:35:06,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:35:06,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:35:06,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:35:06,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:35:06,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:35:06,176 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:35:06,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:35:06,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:35:06,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:35:06,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:35:06,517 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:35:06,519 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:35:06,520 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.opt.i [2020-10-05 23:35:06,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171b37d56/77e77817767e4b1896ca7b768b063349/FLAG676ea2ba5 [2020-10-05 23:35:07,152 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:35:07,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.opt.i [2020-10-05 23:35:07,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171b37d56/77e77817767e4b1896ca7b768b063349/FLAG676ea2ba5 [2020-10-05 23:35:07,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171b37d56/77e77817767e4b1896ca7b768b063349 [2020-10-05 23:35:07,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:35:07,505 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:35:07,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:35:07,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:35:07,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:35:07,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:35:07" (1/1) ... [2020-10-05 23:35:07,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe7e615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:07, skipping insertion in model container [2020-10-05 23:35:07,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:35:07" (1/1) ... [2020-10-05 23:35:07,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:35:07,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:35:08,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:35:08,053 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:35:08,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:35:08,242 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:35:08,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:08 WrapperNode [2020-10-05 23:35:08,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:35:08,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:35:08,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:35:08,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:35:08,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:08" (1/1) ... [2020-10-05 23:35:08,274 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:08" (1/1) ... [2020-10-05 23:35:08,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:35:08,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:35:08,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:35:08,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:35:08,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:08" (1/1) ... [2020-10-05 23:35:08,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:08" (1/1) ... [2020-10-05 23:35:08,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:08" (1/1) ... [2020-10-05 23:35:08,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:08" (1/1) ... [2020-10-05 23:35:08,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:08" (1/1) ... [2020-10-05 23:35:08,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:08" (1/1) ... [2020-10-05 23:35:08,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:08" (1/1) ... [2020-10-05 23:35:08,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:35:08,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:35:08,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:35:08,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:35:08,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:08" (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-10-05 23:35:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:35:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:35:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:35:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:35:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:35:08,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:35:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:35:08,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:35:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:35:08,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:35:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 23:35:08,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 23:35:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:35:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:35:08,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:35:08,414 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:35:10,169 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:35:10,170 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:35:10,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:35:10 BoogieIcfgContainer [2020-10-05 23:35:10,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:35:10,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:35:10,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:35:10,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:35:10,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:35:07" (1/3) ... [2020-10-05 23:35:10,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e992b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:35:10, skipping insertion in model container [2020-10-05 23:35:10,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:08" (2/3) ... [2020-10-05 23:35:10,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e992b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:35:10, skipping insertion in model container [2020-10-05 23:35:10,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:35:10" (3/3) ... [2020-10-05 23:35:10,182 INFO L109 eAbstractionObserver]: Analyzing ICFG mix053_tso.opt.i [2020-10-05 23:35:10,193 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:35:10,193 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:35:10,201 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:35:10,203 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:35:10,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,238 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,238 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,270 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,270 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,272 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,272 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,282 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,282 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,282 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,283 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,284 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,284 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,284 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,284 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,284 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,285 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,285 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,291 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,292 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,296 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,298 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,299 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,303 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,303 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:10,319 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:35:10,341 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:35:10,342 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:35:10,342 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:35:10,342 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:35:10,342 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:35:10,342 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:35:10,342 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:35:10,342 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:35:10,359 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-05 23:35:10,361 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-05 23:35:10,419 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-05 23:35:10,419 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:35:10,425 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2020-10-05 23:35:10,430 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-05 23:35:10,458 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-05 23:35:10,459 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:35:10,460 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2020-10-05 23:35:10,463 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2248 [2020-10-05 23:35:10,465 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:35:10,795 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-05 23:35:11,340 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:35:11,461 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-05 23:35:12,081 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-05 23:35:12,196 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-05 23:35:12,997 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-05 23:35:13,150 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-05 23:35:13,285 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4626 [2020-10-05 23:35:13,285 INFO L214 etLargeBlockEncoding]: Total number of compositions: 83 [2020-10-05 23:35:13,290 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 30 transitions, 80 flow [2020-10-05 23:35:13,563 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2090 states. [2020-10-05 23:35:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states. [2020-10-05 23:35:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:35:13,600 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:13,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:13,605 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:13,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:13,618 INFO L82 PathProgramCache]: Analyzing trace with hash -543229691, now seen corresponding path program 1 times [2020-10-05 23:35:13,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:13,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122792559] [2020-10-05 23:35:13,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:14,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122792559] [2020-10-05 23:35:14,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:14,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:14,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219757643] [2020-10-05 23:35:14,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:14,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:14,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:14,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:14,028 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 3 states. [2020-10-05 23:35:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:14,119 INFO L93 Difference]: Finished difference Result 1770 states and 6672 transitions. [2020-10-05 23:35:14,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:14,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:35:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:14,154 INFO L225 Difference]: With dead ends: 1770 [2020-10-05 23:35:14,155 INFO L226 Difference]: Without dead ends: 1450 [2020-10-05 23:35:14,156 INFO L675 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-10-05 23:35:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-10-05 23:35:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-10-05 23:35:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-05 23:35:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 5376 transitions. [2020-10-05 23:35:14,303 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 5376 transitions. Word has length 9 [2020-10-05 23:35:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:14,305 INFO L479 AbstractCegarLoop]: Abstraction has 1450 states and 5376 transitions. [2020-10-05 23:35:14,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 5376 transitions. [2020-10-05 23:35:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:35:14,310 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:14,310 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:14,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:35:14,311 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1942314390, now seen corresponding path program 1 times [2020-10-05 23:35:14,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:14,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221489009] [2020-10-05 23:35:14,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:14,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221489009] [2020-10-05 23:35:14,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:14,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:14,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286270978] [2020-10-05 23:35:14,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:14,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:14,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:14,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:14,416 INFO L87 Difference]: Start difference. First operand 1450 states and 5376 transitions. Second operand 3 states. [2020-10-05 23:35:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:14,437 INFO L93 Difference]: Finished difference Result 1410 states and 5194 transitions. [2020-10-05 23:35:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:14,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:35:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:14,450 INFO L225 Difference]: With dead ends: 1410 [2020-10-05 23:35:14,450 INFO L226 Difference]: Without dead ends: 1410 [2020-10-05 23:35:14,451 INFO L675 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-10-05 23:35:14,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-10-05 23:35:14,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2020-10-05 23:35:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2020-10-05 23:35:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 5194 transitions. [2020-10-05 23:35:14,505 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 5194 transitions. Word has length 11 [2020-10-05 23:35:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:14,506 INFO L479 AbstractCegarLoop]: Abstraction has 1410 states and 5194 transitions. [2020-10-05 23:35:14,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 5194 transitions. [2020-10-05 23:35:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:35:14,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:14,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:14,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:35:14,510 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:14,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash 82203517, now seen corresponding path program 1 times [2020-10-05 23:35:14,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:14,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029109279] [2020-10-05 23:35:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:14,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029109279] [2020-10-05 23:35:14,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:14,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:14,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647100843] [2020-10-05 23:35:14,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:14,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:14,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:14,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:14,582 INFO L87 Difference]: Start difference. First operand 1410 states and 5194 transitions. Second operand 3 states. [2020-10-05 23:35:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:14,606 INFO L93 Difference]: Finished difference Result 1380 states and 5060 transitions. [2020-10-05 23:35:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:14,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:35:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:14,619 INFO L225 Difference]: With dead ends: 1380 [2020-10-05 23:35:14,619 INFO L226 Difference]: Without dead ends: 1380 [2020-10-05 23:35:14,620 INFO L675 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-10-05 23:35:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-10-05 23:35:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2020-10-05 23:35:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2020-10-05 23:35:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 5060 transitions. [2020-10-05 23:35:14,679 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 5060 transitions. Word has length 12 [2020-10-05 23:35:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:14,680 INFO L479 AbstractCegarLoop]: Abstraction has 1380 states and 5060 transitions. [2020-10-05 23:35:14,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 5060 transitions. [2020-10-05 23:35:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:35:14,683 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:14,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:14,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:35:14,683 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:14,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:14,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1886679985, now seen corresponding path program 1 times [2020-10-05 23:35:14,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:14,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330929116] [2020-10-05 23:35:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:14,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330929116] [2020-10-05 23:35:14,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:14,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:35:14,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422840279] [2020-10-05 23:35:14,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:14,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:14,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:14,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:14,749 INFO L87 Difference]: Start difference. First operand 1380 states and 5060 transitions. Second operand 3 states. [2020-10-05 23:35:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:14,780 INFO L93 Difference]: Finished difference Result 1868 states and 6582 transitions. [2020-10-05 23:35:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:14,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-05 23:35:14,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:14,793 INFO L225 Difference]: With dead ends: 1868 [2020-10-05 23:35:14,793 INFO L226 Difference]: Without dead ends: 1460 [2020-10-05 23:35:14,794 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-10-05 23:35:14,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1340. [2020-10-05 23:35:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2020-10-05 23:35:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 4694 transitions. [2020-10-05 23:35:14,844 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 4694 transitions. Word has length 13 [2020-10-05 23:35:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:14,844 INFO L479 AbstractCegarLoop]: Abstraction has 1340 states and 4694 transitions. [2020-10-05 23:35:14,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 4694 transitions. [2020-10-05 23:35:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:35:14,847 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:14,847 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:14,847 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:35:14,847 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:14,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:14,848 INFO L82 PathProgramCache]: Analyzing trace with hash -538429830, now seen corresponding path program 1 times [2020-10-05 23:35:14,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:14,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622037963] [2020-10-05 23:35:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:14,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622037963] [2020-10-05 23:35:14,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:14,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:14,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337792049] [2020-10-05 23:35:14,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:35:14,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:14,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:35:14,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:35:14,909 INFO L87 Difference]: Start difference. First operand 1340 states and 4694 transitions. Second operand 4 states. [2020-10-05 23:35:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:14,966 INFO L93 Difference]: Finished difference Result 1388 states and 4406 transitions. [2020-10-05 23:35:14,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:14,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 23:35:14,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:14,975 INFO L225 Difference]: With dead ends: 1388 [2020-10-05 23:35:14,975 INFO L226 Difference]: Without dead ends: 1068 [2020-10-05 23:35:14,976 INFO L675 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-10-05 23:35:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2020-10-05 23:35:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2020-10-05 23:35:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2020-10-05 23:35:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 3382 transitions. [2020-10-05 23:35:15,009 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 3382 transitions. Word has length 13 [2020-10-05 23:35:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:15,010 INFO L479 AbstractCegarLoop]: Abstraction has 1068 states and 3382 transitions. [2020-10-05 23:35:15,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:35:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 3382 transitions. [2020-10-05 23:35:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:35:15,012 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:15,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:15,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:35:15,013 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:15,013 INFO L82 PathProgramCache]: Analyzing trace with hash -177822953, now seen corresponding path program 1 times [2020-10-05 23:35:15,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:15,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696776009] [2020-10-05 23:35:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:15,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696776009] [2020-10-05 23:35:15,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:15,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:35:15,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515149172] [2020-10-05 23:35:15,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:15,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:15,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:15,049 INFO L87 Difference]: Start difference. First operand 1068 states and 3382 transitions. Second operand 3 states. [2020-10-05 23:35:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:15,073 INFO L93 Difference]: Finished difference Result 1476 states and 4486 transitions. [2020-10-05 23:35:15,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:15,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-05 23:35:15,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:15,081 INFO L225 Difference]: With dead ends: 1476 [2020-10-05 23:35:15,082 INFO L226 Difference]: Without dead ends: 1104 [2020-10-05 23:35:15,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2020-10-05 23:35:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1046. [2020-10-05 23:35:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2020-10-05 23:35:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 3141 transitions. [2020-10-05 23:35:15,150 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 3141 transitions. Word has length 15 [2020-10-05 23:35:15,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:15,150 INFO L479 AbstractCegarLoop]: Abstraction has 1046 states and 3141 transitions. [2020-10-05 23:35:15,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 3141 transitions. [2020-10-05 23:35:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:35:15,153 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:15,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:15,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:35:15,153 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:15,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:15,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1050389761, now seen corresponding path program 1 times [2020-10-05 23:35:15,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:15,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931372074] [2020-10-05 23:35:15,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:15,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931372074] [2020-10-05 23:35:15,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:15,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:15,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133691909] [2020-10-05 23:35:15,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:15,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:15,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:15,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:15,244 INFO L87 Difference]: Start difference. First operand 1046 states and 3141 transitions. Second operand 5 states. [2020-10-05 23:35:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:15,301 INFO L93 Difference]: Finished difference Result 912 states and 2468 transitions. [2020-10-05 23:35:15,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:35:15,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-05 23:35:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:15,306 INFO L225 Difference]: With dead ends: 912 [2020-10-05 23:35:15,307 INFO L226 Difference]: Without dead ends: 700 [2020-10-05 23:35:15,307 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:15,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2020-10-05 23:35:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2020-10-05 23:35:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-10-05 23:35:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1861 transitions. [2020-10-05 23:35:15,326 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1861 transitions. Word has length 15 [2020-10-05 23:35:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:15,326 INFO L479 AbstractCegarLoop]: Abstraction has 700 states and 1861 transitions. [2020-10-05 23:35:15,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1861 transitions. [2020-10-05 23:35:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:35:15,328 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:15,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:15,329 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:35:15,329 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:15,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash 370067579, now seen corresponding path program 1 times [2020-10-05 23:35:15,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:15,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69297496] [2020-10-05 23:35:15,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:15,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-10-05 23:35:15,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69297496] [2020-10-05 23:35:15,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:15,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:35:15,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879362099] [2020-10-05 23:35:15,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:35:15,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:15,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:35:15,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:15,474 INFO L87 Difference]: Start difference. First operand 700 states and 1861 transitions. Second operand 6 states. [2020-10-05 23:35:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:15,549 INFO L93 Difference]: Finished difference Result 607 states and 1569 transitions. [2020-10-05 23:35:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:35:15,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-05 23:35:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:15,554 INFO L225 Difference]: With dead ends: 607 [2020-10-05 23:35:15,554 INFO L226 Difference]: Without dead ends: 488 [2020-10-05 23:35:15,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:35:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-10-05 23:35:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2020-10-05 23:35:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2020-10-05 23:35:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1246 transitions. [2020-10-05 23:35:15,567 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1246 transitions. Word has length 17 [2020-10-05 23:35:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:15,568 INFO L479 AbstractCegarLoop]: Abstraction has 488 states and 1246 transitions. [2020-10-05 23:35:15,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:35:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1246 transitions. [2020-10-05 23:35:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:35:15,570 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:15,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:15,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:35:15,571 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:15,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:15,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1261578529, now seen corresponding path program 1 times [2020-10-05 23:35:15,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:15,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458217413] [2020-10-05 23:35:15,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:15,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458217413] [2020-10-05 23:35:15,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:15,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:35:15,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375595303] [2020-10-05 23:35:15,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:35:15,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:15,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:35:15,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:15,679 INFO L87 Difference]: Start difference. First operand 488 states and 1246 transitions. Second operand 7 states. [2020-10-05 23:35:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:15,792 INFO L93 Difference]: Finished difference Result 465 states and 1200 transitions. [2020-10-05 23:35:15,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:35:15,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-05 23:35:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:15,794 INFO L225 Difference]: With dead ends: 465 [2020-10-05 23:35:15,794 INFO L226 Difference]: Without dead ends: 187 [2020-10-05 23:35:15,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:35:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-10-05 23:35:15,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2020-10-05 23:35:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-10-05 23:35:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 447 transitions. [2020-10-05 23:35:15,813 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 447 transitions. Word has length 20 [2020-10-05 23:35:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:15,813 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 447 transitions. [2020-10-05 23:35:15,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:35:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 447 transitions. [2020-10-05 23:35:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:35:15,815 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:15,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:15,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:35:15,819 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:15,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1242244738, now seen corresponding path program 1 times [2020-10-05 23:35:15,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:15,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983410076] [2020-10-05 23:35:15,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:15,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983410076] [2020-10-05 23:35:15,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:15,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:15,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711463023] [2020-10-05 23:35:15,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:35:15,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:15,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:35:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:35:15,898 INFO L87 Difference]: Start difference. First operand 187 states and 447 transitions. Second operand 4 states. [2020-10-05 23:35:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:15,913 INFO L93 Difference]: Finished difference Result 252 states and 596 transitions. [2020-10-05 23:35:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:15,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-05 23:35:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:15,914 INFO L225 Difference]: With dead ends: 252 [2020-10-05 23:35:15,915 INFO L226 Difference]: Without dead ends: 79 [2020-10-05 23:35:15,915 INFO L675 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-10-05 23:35:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-05 23:35:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-05 23:35:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-05 23:35:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 165 transitions. [2020-10-05 23:35:15,918 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 165 transitions. Word has length 24 [2020-10-05 23:35:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:15,918 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 165 transitions. [2020-10-05 23:35:15,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:35:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 165 transitions. [2020-10-05 23:35:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:35:15,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:15,919 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:15,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:35:15,920 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:15,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:15,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1788376548, now seen corresponding path program 2 times [2020-10-05 23:35:15,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:15,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909398003] [2020-10-05 23:35:15,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:35:16,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909398003] [2020-10-05 23:35:16,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:16,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:16,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347822499] [2020-10-05 23:35:16,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:16,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:16,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:16,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:16,020 INFO L87 Difference]: Start difference. First operand 79 states and 165 transitions. Second operand 5 states. [2020-10-05 23:35:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:16,066 INFO L93 Difference]: Finished difference Result 97 states and 199 transitions. [2020-10-05 23:35:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:35:16,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-10-05 23:35:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:16,067 INFO L225 Difference]: With dead ends: 97 [2020-10-05 23:35:16,067 INFO L226 Difference]: Without dead ends: 51 [2020-10-05 23:35:16,068 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-05 23:35:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-05 23:35:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-05 23:35:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. [2020-10-05 23:35:16,070 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 24 [2020-10-05 23:35:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:16,070 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 89 transitions. [2020-10-05 23:35:16,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. [2020-10-05 23:35:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:35:16,071 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:16,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:16,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:35:16,072 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:16,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:16,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1046254044, now seen corresponding path program 3 times [2020-10-05 23:35:16,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:16,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116469374] [2020-10-05 23:35:16,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:35:16,106 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:35:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:35:16,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:35:16,169 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:35:16,169 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:35:16,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:35:16,171 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:35:16,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] L3-->L851: Formula: (let ((.cse6 (= (mod ~z$r_buff0_thd0~0_In2026847702 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In2026847702 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In2026847702 256) 0)) (.cse9 (= 0 (mod ~z$w_buff1_used~0_In2026847702 256)))) (let ((.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In2026847702 0)) (or (and (or (and (= ~z$w_buff1~0_In2026847702 ~z~0_Out2026847702) .cse0 .cse1) (and (= ~z~0_In2026847702 ~z~0_Out2026847702) .cse2)) .cse3) (and .cse4 (= ~z~0_Out2026847702 ~z$w_buff0~0_In2026847702) .cse5)) (= ~z$r_buff0_thd0~0_In2026847702 ~z$r_buff0_thd0~0_Out2026847702) (or (and (= ~z$w_buff1_used~0_Out2026847702 ~z$w_buff1_used~0_In2026847702) .cse2) (and (= ~z$w_buff1_used~0_Out2026847702 0) .cse0 .cse1)) (= ~z$r_buff1_thd0~0_In2026847702 ~z$r_buff1_thd0~0_Out2026847702) (or (and .cse3 (= ~z$w_buff0_used~0_Out2026847702 ~z$w_buff0_used~0_In2026847702)) (and .cse4 (= ~z$w_buff0_used~0_Out2026847702 0) .cse5))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2026847702, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In2026847702, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2026847702, ~z$w_buff0~0=~z$w_buff0~0_In2026847702, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2026847702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2026847702, ~z$w_buff1~0=~z$w_buff1~0_In2026847702, ~z~0=~z~0_In2026847702} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out2026847702, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2026847702|, ~z$w_buff0~0=~z$w_buff0~0_In2026847702, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out2026847702, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out2026847702|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out2026847702|, ~z$w_buff1~0=~z$w_buff1~0_In2026847702, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2026847702|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2026847702|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out2026847702, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2026847702|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In2026847702, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out2026847702, ~z~0=~z~0_Out2026847702} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite40, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2020-10-05 23:35:16,202 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,202 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,204 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,204 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,204 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,205 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,205 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,205 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,205 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,205 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,206 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,206 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,206 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,207 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,207 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,207 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,208 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,208 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,209 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,209 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,209 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,210 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,210 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,210 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,210 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,211 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,211 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,211 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,212 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:16,212 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:16,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:35:16 BasicIcfg [2020-10-05 23:35:16,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:35:16,306 INFO L168 Benchmark]: Toolchain (without parser) took 8801.73 ms. Allocated memory was 137.4 MB in the beginning and 347.6 MB in the end (delta: 210.2 MB). Free memory was 99.0 MB in the beginning and 122.0 MB in the end (delta: -23.0 MB). Peak memory consumption was 187.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:16,307 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 137.4 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:35:16,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.21 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 98.8 MB in the beginning and 153.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:16,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.69 ms. Allocated memory is still 200.3 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:16,311 INFO L168 Benchmark]: Boogie Preprocessor took 41.62 ms. Allocated memory is still 200.3 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:16,315 INFO L168 Benchmark]: RCFGBuilder took 1824.04 ms. Allocated memory was 200.3 MB in the beginning and 229.6 MB in the end (delta: 29.4 MB). Free memory was 149.0 MB in the beginning and 82.1 MB in the end (delta: 66.9 MB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:16,316 INFO L168 Benchmark]: TraceAbstraction took 6130.45 ms. Allocated memory was 229.6 MB in the beginning and 347.6 MB in the end (delta: 118.0 MB). Free memory was 82.1 MB in the beginning and 122.0 MB in the end (delta: -39.9 MB). Peak memory consumption was 78.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:16,322 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 137.4 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 737.21 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 98.8 MB in the beginning and 153.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.69 ms. Allocated memory is still 200.3 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.62 ms. Allocated memory is still 200.3 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1824.04 ms. Allocated memory was 200.3 MB in the beginning and 229.6 MB in the end (delta: 29.4 MB). Free memory was 149.0 MB in the beginning and 82.1 MB in the end (delta: 66.9 MB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6130.45 ms. Allocated memory was 229.6 MB in the beginning and 347.6 MB in the end (delta: 118.0 MB). Free memory was 82.1 MB in the beginning and 122.0 MB in the end (delta: -39.9 MB). Peak memory consumption was 78.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 118 ProgramPointsBefore, 43 ProgramPointsAfterwards, 107 TransitionsBefore, 30 TransitionsAfterwards, 2248 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 1089 VarBasedMoverChecksPositive, 28 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4626 CheckedPairsTotal, 83 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p2_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1437; [L834] FCALL, FORK 0 pthread_create(&t1437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1438; [L836] FCALL, FORK 0 pthread_create(&t1438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1439; [L838] FCALL, FORK 0 pthread_create(&t1439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1440; [L840] FCALL, FORK 0 pthread_create(&t1440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 4 z$w_buff1 = z$w_buff0 [L796] 4 z$w_buff0 = 1 [L797] 4 z$w_buff1_used = z$w_buff0_used [L798] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L800] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L801] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L802] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L803] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L804] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L805] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L767] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 3 z$flush_delayed = weak$$choice2 [L773] 3 z$mem_tmp = z [L774] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L775] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1 [L776] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L777] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L777] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L778] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L778] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L779] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L779] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L780] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L780] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] 3 __unbuffered_p2_EAX = z [L782] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L782] 3 z = z$flush_delayed ? z$mem_tmp : z [L783] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L813] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L815] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L788] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 3 return 0; [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 299 SDtfs, 401 SDslu, 379 SDs, 0 SdLazy, 123 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2090occurred 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.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 178 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 8475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...