/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-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 00:43:52,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 00:43:52,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 00:43:52,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 00:43:52,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 00:43:52,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 00:43:52,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 00:43:52,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 00:43:52,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 00:43:52,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 00:43:52,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 00:43:52,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 00:43:52,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 00:43:52,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 00:43:52,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 00:43:52,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 00:43:52,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 00:43:52,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 00:43:52,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 00:43:52,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 00:43:52,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 00:43:52,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 00:43:52,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 00:43:52,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 00:43:52,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 00:43:52,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 00:43:52,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 00:43:52,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 00:43:52,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 00:43:52,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 00:43:52,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 00:43:52,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 00:43:52,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 00:43:52,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 00:43:52,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 00:43:52,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 00:43:52,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 00:43:52,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 00:43:52,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 00:43:52,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 00:43:52,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 00:43:52,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 00:43:52,220 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 00:43:52,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 00:43:52,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 00:43:52,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 00:43:52,222 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 00:43:52,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 00:43:52,222 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 00:43:52,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 00:43:52,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 00:43:52,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 00:43:52,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 00:43:52,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 00:43:52,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 00:43:52,224 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 00:43:52,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 00:43:52,224 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 00:43:52,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 00:43:52,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 00:43:52,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 00:43:52,225 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 00:43:52,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 00:43:52,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:43:52,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 00:43:52,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 00:43:52,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 00:43:52,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 00:43:52,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 00:43:52,226 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 00:43:52,226 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 00:43:52,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 00:43:52,227 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 00:43:52,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 00:43:52,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 00:43:52,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 00:43:52,579 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 00:43:52,579 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 00:43:52,581 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_rmo.opt.i [2020-10-06 00:43:52,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6275fcba3/e1b220b13dc04c45a4b03efb03723049/FLAGa3d434fd7 [2020-10-06 00:43:53,225 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 00:43:53,226 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_rmo.opt.i [2020-10-06 00:43:53,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6275fcba3/e1b220b13dc04c45a4b03efb03723049/FLAGa3d434fd7 [2020-10-06 00:43:53,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6275fcba3/e1b220b13dc04c45a4b03efb03723049 [2020-10-06 00:43:53,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 00:43:53,424 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 00:43:53,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 00:43:53,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 00:43:53,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 00:43:53,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:43:53" (1/1) ... [2020-10-06 00:43:53,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ecf1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:53, skipping insertion in model container [2020-10-06 00:43:53,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:43:53" (1/1) ... [2020-10-06 00:43:53,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 00:43:53,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 00:43:54,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:43:54,120 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 00:43:54,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:43:54,271 INFO L208 MainTranslator]: Completed translation [2020-10-06 00:43:54,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:54 WrapperNode [2020-10-06 00:43:54,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 00:43:54,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 00:43:54,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 00:43:54,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 00:43:54,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:54" (1/1) ... [2020-10-06 00:43:54,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:54" (1/1) ... [2020-10-06 00:43:54,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 00:43:54,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 00:43:54,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 00:43:54,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 00:43:54,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:54" (1/1) ... [2020-10-06 00:43:54,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:54" (1/1) ... [2020-10-06 00:43:54,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:54" (1/1) ... [2020-10-06 00:43:54,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:54" (1/1) ... [2020-10-06 00:43:54,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:54" (1/1) ... [2020-10-06 00:43:54,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:54" (1/1) ... [2020-10-06 00:43:54,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:54" (1/1) ... [2020-10-06 00:43:54,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 00:43:54,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 00:43:54,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 00:43:54,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 00:43:54,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:54" (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-06 00:43:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 00:43:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 00:43:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 00:43:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 00:43:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 00:43:54,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 00:43:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 00:43:54,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 00:43:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-06 00:43:54,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-06 00:43:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-06 00:43:54,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-06 00:43:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 00:43:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 00:43:54,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 00:43:54,444 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 00:43:56,416 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 00:43:56,417 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 00:43:56,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:43:56 BoogieIcfgContainer [2020-10-06 00:43:56,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 00:43:56,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 00:43:56,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 00:43:56,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 00:43:56,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 12:43:53" (1/3) ... [2020-10-06 00:43:56,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4edb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:43:56, skipping insertion in model container [2020-10-06 00:43:56,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:43:54" (2/3) ... [2020-10-06 00:43:56,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4edb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:43:56, skipping insertion in model container [2020-10-06 00:43:56,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:43:56" (3/3) ... [2020-10-06 00:43:56,427 INFO L109 eAbstractionObserver]: Analyzing ICFG mix051_rmo.opt.i [2020-10-06 00:43:56,438 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 00:43:56,438 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 00:43:56,446 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 00:43:56,447 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 00:43:56,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,481 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,482 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,494 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,495 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,495 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,495 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,498 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,498 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,504 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,511 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,513 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,513 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,515 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,516 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,520 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,520 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:43:56,539 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-06 00:43:56,560 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 00:43:56,561 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 00:43:56,561 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 00:43:56,561 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 00:43:56,561 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 00:43:56,561 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 00:43:56,561 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 00:43:56,561 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 00:43:56,581 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 236 flow [2020-10-06 00:43:56,583 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow [2020-10-06 00:43:56,644 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-06 00:43:56,645 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:43:56,650 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2020-10-06 00:43:56,654 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow [2020-10-06 00:43:56,684 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-06 00:43:56,684 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:43:56,685 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2020-10-06 00:43:56,689 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2248 [2020-10-06 00:43:56,691 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 00:43:58,095 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-06 00:43:58,208 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-06 00:43:59,124 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-06 00:43:59,244 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-06 00:43:59,509 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-06 00:43:59,666 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-06 00:43:59,675 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5420 [2020-10-06 00:43:59,675 INFO L214 etLargeBlockEncoding]: Total number of compositions: 89 [2020-10-06 00:43:59,679 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 31 transitions, 82 flow [2020-10-06 00:43:59,814 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2090 states. [2020-10-06 00:43:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states. [2020-10-06 00:43:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 00:43:59,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:43:59,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:43:59,827 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-06 00:43:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:43:59,833 INFO L82 PathProgramCache]: Analyzing trace with hash 539311764, now seen corresponding path program 1 times [2020-10-06 00:43:59,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:43:59,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268337496] [2020-10-06 00:43:59,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:44:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:44:00,104 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-06 00:44:00,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268337496] [2020-10-06 00:44:00,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:44:00,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:44:00,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [654665479] [2020-10-06 00:44:00,109 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:44:00,113 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:44:00,128 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 00:44:00,129 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:44:00,133 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:44:00,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:44:00,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:44:00,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:44:00,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:44:00,147 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 3 states. [2020-10-06 00:44:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:44:00,240 INFO L93 Difference]: Finished difference Result 1770 states and 6672 transitions. [2020-10-06 00:44:00,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:44:00,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-06 00:44:00,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:44:00,276 INFO L225 Difference]: With dead ends: 1770 [2020-10-06 00:44:00,276 INFO L226 Difference]: Without dead ends: 1450 [2020-10-06 00:44:00,277 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-06 00:44:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-10-06 00:44:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-10-06 00:44:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-06 00:44:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 5376 transitions. [2020-10-06 00:44:00,414 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 5376 transitions. Word has length 9 [2020-10-06 00:44:00,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:44:00,416 INFO L479 AbstractCegarLoop]: Abstraction has 1450 states and 5376 transitions. [2020-10-06 00:44:00,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:44:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 5376 transitions. [2020-10-06 00:44:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:44:00,419 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:44:00,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:44:00,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 00:44:00,420 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-06 00:44:00,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:44:00,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1412373152, now seen corresponding path program 1 times [2020-10-06 00:44:00,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:44:00,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846515540] [2020-10-06 00:44:00,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:44:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:44:00,515 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-06 00:44:00,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846515540] [2020-10-06 00:44:00,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:44:00,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:44:00,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1732881162] [2020-10-06 00:44:00,516 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:44:00,518 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:44:00,520 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-06 00:44:00,520 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:44:00,520 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:44:00,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:44:00,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:44:00,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:44:00,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:44:00,523 INFO L87 Difference]: Start difference. First operand 1450 states and 5376 transitions. Second operand 3 states. [2020-10-06 00:44:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:44:00,547 INFO L93 Difference]: Finished difference Result 1410 states and 5194 transitions. [2020-10-06 00:44:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:44:00,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-06 00:44:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:44:00,560 INFO L225 Difference]: With dead ends: 1410 [2020-10-06 00:44:00,560 INFO L226 Difference]: Without dead ends: 1410 [2020-10-06 00:44:00,561 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-06 00:44:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-10-06 00:44:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2020-10-06 00:44:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2020-10-06 00:44:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 5194 transitions. [2020-10-06 00:44:00,612 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 5194 transitions. Word has length 11 [2020-10-06 00:44:00,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:44:00,613 INFO L479 AbstractCegarLoop]: Abstraction has 1410 states and 5194 transitions. [2020-10-06 00:44:00,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:44:00,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 5194 transitions. [2020-10-06 00:44:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 00:44:00,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:44:00,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:44:00,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 00:44:00,616 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-06 00:44:00,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:44:00,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1274955836, now seen corresponding path program 1 times [2020-10-06 00:44:00,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:44:00,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955073534] [2020-10-06 00:44:00,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:44:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:44:00,739 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-06 00:44:00,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955073534] [2020-10-06 00:44:00,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:44:00,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:44:00,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [565710394] [2020-10-06 00:44:00,741 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:44:00,745 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:44:00,748 INFO L258 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-06 00:44:00,748 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:44:00,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:00,834 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:44:00,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:44:00,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:44:00,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:44:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:44:00,836 INFO L87 Difference]: Start difference. First operand 1410 states and 5194 transitions. Second operand 4 states. [2020-10-06 00:44:00,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:44:00,903 INFO L93 Difference]: Finished difference Result 1430 states and 4778 transitions. [2020-10-06 00:44:00,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:44:00,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-06 00:44:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:44:00,913 INFO L225 Difference]: With dead ends: 1430 [2020-10-06 00:44:00,913 INFO L226 Difference]: Without dead ends: 1110 [2020-10-06 00:44:00,914 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:44:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2020-10-06 00:44:00,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2020-10-06 00:44:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2020-10-06 00:44:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 3694 transitions. [2020-10-06 00:44:00,960 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 3694 transitions. Word has length 12 [2020-10-06 00:44:00,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:44:00,961 INFO L479 AbstractCegarLoop]: Abstraction has 1110 states and 3694 transitions. [2020-10-06 00:44:00,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:44:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 3694 transitions. [2020-10-06 00:44:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 00:44:00,964 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:44:00,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:44:00,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 00:44:00,965 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-06 00:44:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:44:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash -321783927, now seen corresponding path program 1 times [2020-10-06 00:44:00,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:44:00,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121143869] [2020-10-06 00:44:00,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:44:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:44:01,038 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-06 00:44:01,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121143869] [2020-10-06 00:44:01,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:44:01,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:44:01,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1742561286] [2020-10-06 00:44:01,040 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:44:01,042 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:44:01,046 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 38 transitions. [2020-10-06 00:44:01,046 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:44:01,180 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:44:01,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:44:01,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:44:01,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:44:01,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:44:01,182 INFO L87 Difference]: Start difference. First operand 1110 states and 3694 transitions. Second operand 5 states. [2020-10-06 00:44:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:44:01,261 INFO L93 Difference]: Finished difference Result 931 states and 2809 transitions. [2020-10-06 00:44:01,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:44:01,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-06 00:44:01,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:44:01,268 INFO L225 Difference]: With dead ends: 931 [2020-10-06 00:44:01,268 INFO L226 Difference]: Without dead ends: 719 [2020-10-06 00:44:01,269 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:44:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2020-10-06 00:44:01,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2020-10-06 00:44:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2020-10-06 00:44:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 2130 transitions. [2020-10-06 00:44:01,294 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 2130 transitions. Word has length 14 [2020-10-06 00:44:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:44:01,294 INFO L479 AbstractCegarLoop]: Abstraction has 719 states and 2130 transitions. [2020-10-06 00:44:01,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:44:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 2130 transitions. [2020-10-06 00:44:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 00:44:01,297 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:44:01,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:44:01,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 00:44:01,297 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-06 00:44:01,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:44:01,298 INFO L82 PathProgramCache]: Analyzing trace with hash -13821285, now seen corresponding path program 1 times [2020-10-06 00:44:01,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:44:01,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546688935] [2020-10-06 00:44:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:44:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:44:01,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-06 00:44:01,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546688935] [2020-10-06 00:44:01,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:44:01,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:44:01,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779165966] [2020-10-06 00:44:01,413 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:44:01,417 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:44:01,425 INFO L258 McrAutomatonBuilder]: Finished intersection with 42 states and 69 transitions. [2020-10-06 00:44:01,426 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:44:01,557 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:44:01,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:44:01,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:44:01,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:44:01,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:44:01,559 INFO L87 Difference]: Start difference. First operand 719 states and 2130 transitions. Second operand 6 states. [2020-10-06 00:44:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:44:01,629 INFO L93 Difference]: Finished difference Result 609 states and 1771 transitions. [2020-10-06 00:44:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:44:01,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-06 00:44:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:44:01,634 INFO L225 Difference]: With dead ends: 609 [2020-10-06 00:44:01,634 INFO L226 Difference]: Without dead ends: 532 [2020-10-06 00:44:01,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:44:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-10-06 00:44:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2020-10-06 00:44:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2020-10-06 00:44:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1569 transitions. [2020-10-06 00:44:01,652 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1569 transitions. Word has length 17 [2020-10-06 00:44:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:44:01,653 INFO L479 AbstractCegarLoop]: Abstraction has 532 states and 1569 transitions. [2020-10-06 00:44:01,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:44:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1569 transitions. [2020-10-06 00:44:01,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 00:44:01,655 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:44:01,655 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-06 00:44:01,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 00:44:01,656 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-06 00:44:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:44:01,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1047536322, now seen corresponding path program 1 times [2020-10-06 00:44:01,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:44:01,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189186840] [2020-10-06 00:44:01,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:44:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:44:01,719 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-06 00:44:01,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189186840] [2020-10-06 00:44:01,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:44:01,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:44:01,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357128301] [2020-10-06 00:44:01,721 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:44:01,725 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:44:01,754 INFO L258 McrAutomatonBuilder]: Finished intersection with 119 states and 271 transitions. [2020-10-06 00:44:01,755 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:44:01,931 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:44:01,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:44:01,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:44:01,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:44:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:44:01,932 INFO L87 Difference]: Start difference. First operand 532 states and 1569 transitions. Second operand 3 states. [2020-10-06 00:44:01,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:44:01,944 INFO L93 Difference]: Finished difference Result 735 states and 2102 transitions. [2020-10-06 00:44:01,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:44:01,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-06 00:44:01,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:44:01,949 INFO L225 Difference]: With dead ends: 735 [2020-10-06 00:44:01,949 INFO L226 Difference]: Without dead ends: 533 [2020-10-06 00:44:01,950 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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-06 00:44:01,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-10-06 00:44:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 531. [2020-10-06 00:44:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2020-10-06 00:44:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1475 transitions. [2020-10-06 00:44:01,966 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 1475 transitions. Word has length 20 [2020-10-06 00:44:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:44:01,967 INFO L479 AbstractCegarLoop]: Abstraction has 531 states and 1475 transitions. [2020-10-06 00:44:01,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:44:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 1475 transitions. [2020-10-06 00:44:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 00:44:01,969 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:44:01,969 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-06 00:44:01,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 00:44:01,970 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-06 00:44:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:44:01,970 INFO L82 PathProgramCache]: Analyzing trace with hash 570080024, now seen corresponding path program 2 times [2020-10-06 00:44:01,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:44:01,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410656737] [2020-10-06 00:44:01,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:44:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:44:02,050 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-06 00:44:02,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410656737] [2020-10-06 00:44:02,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:44:02,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:44:02,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1493674002] [2020-10-06 00:44:02,052 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:44:02,056 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:44:02,151 INFO L258 McrAutomatonBuilder]: Finished intersection with 134 states and 308 transitions. [2020-10-06 00:44:02,151 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:44:02,466 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:44:02,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:44:02,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:44:02,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:44:02,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:44:02,468 INFO L87 Difference]: Start difference. First operand 531 states and 1475 transitions. Second operand 4 states. [2020-10-06 00:44:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:44:02,490 INFO L93 Difference]: Finished difference Result 723 states and 1940 transitions. [2020-10-06 00:44:02,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:44:02,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-06 00:44:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:44:02,495 INFO L225 Difference]: With dead ends: 723 [2020-10-06 00:44:02,496 INFO L226 Difference]: Without dead ends: 491 [2020-10-06 00:44:02,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-06 00:44:02,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2020-10-06 00:44:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2020-10-06 00:44:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2020-10-06 00:44:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1248 transitions. [2020-10-06 00:44:02,516 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1248 transitions. Word has length 20 [2020-10-06 00:44:02,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:44:02,516 INFO L479 AbstractCegarLoop]: Abstraction has 489 states and 1248 transitions. [2020-10-06 00:44:02,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:44:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1248 transitions. [2020-10-06 00:44:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 00:44:02,519 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:44:02,519 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-06 00:44:02,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 00:44:02,520 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-06 00:44:02,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:44:02,520 INFO L82 PathProgramCache]: Analyzing trace with hash -147066962, now seen corresponding path program 3 times [2020-10-06 00:44:02,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:44:02,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003807443] [2020-10-06 00:44:02,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:44:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:44:02,637 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-06 00:44:02,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003807443] [2020-10-06 00:44:02,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:44:02,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 00:44:02,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1739970223] [2020-10-06 00:44:02,639 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:44:02,643 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:44:02,683 INFO L258 McrAutomatonBuilder]: Finished intersection with 121 states and 253 transitions. [2020-10-06 00:44:02,683 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:44:02,947 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:44:02,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:44:02,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:44:02,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:44:02,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:44:02,949 INFO L87 Difference]: Start difference. First operand 489 states and 1248 transitions. Second operand 7 states. [2020-10-06 00:44:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:44:03,023 INFO L93 Difference]: Finished difference Result 465 states and 1200 transitions. [2020-10-06 00:44:03,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-06 00:44:03,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-06 00:44:03,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:44:03,026 INFO L225 Difference]: With dead ends: 465 [2020-10-06 00:44:03,026 INFO L226 Difference]: Without dead ends: 187 [2020-10-06 00:44:03,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:44:03,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-10-06 00:44:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2020-10-06 00:44:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-10-06 00:44:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 447 transitions. [2020-10-06 00:44:03,032 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 447 transitions. Word has length 20 [2020-10-06 00:44:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:44:03,032 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 447 transitions. [2020-10-06 00:44:03,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:44:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 447 transitions. [2020-10-06 00:44:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-06 00:44:03,033 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:44:03,033 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-06 00:44:03,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 00:44:03,034 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-06 00:44:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:44:03,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1868599459, now seen corresponding path program 1 times [2020-10-06 00:44:03,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:44:03,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25597791] [2020-10-06 00:44:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:44:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:44:03,174 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-06 00:44:03,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25597791] [2020-10-06 00:44:03,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:44:03,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:44:03,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551082597] [2020-10-06 00:44:03,176 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:44:03,182 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:44:03,272 INFO L258 McrAutomatonBuilder]: Finished intersection with 84 states and 146 transitions. [2020-10-06 00:44:03,273 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:44:03,347 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-06 00:44:03,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,348 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,349 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,349 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,351 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,351 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,352 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,353 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,355 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-06 00:44:03,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,356 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,357 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:03,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:03,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:03,539 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-06 00:44:03,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,540 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,541 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,542 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-06 00:44:03,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,543 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,544 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,546 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,547 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,548 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:03,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:03,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:03,652 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:44:03,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,653 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-06 00:44:03,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:44:03,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:44:03,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,673 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:44:03,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:03,679 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:44:03,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,688 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:44:03,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:03,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,701 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:44:03,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,712 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:44:03,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,777 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-06 00:44:03,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,778 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-06 00:44:03,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,780 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:44:03,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,781 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:44:03,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,797 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:44:03,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:03,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,813 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:44:03,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:03,816 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:44:03,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,823 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:44:03,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,836 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:44:03,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,895 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-06 00:44:03,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,896 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,897 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,899 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,900 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,900 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,902 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,903 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,904 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:44:03,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:03,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:44:03,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:03,965 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-06 00:44:03,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,966 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-06 00:44:03,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,967 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:44:03,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,968 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:44:03,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,970 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:44:03,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:03,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:44:03,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:03,993 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:44:04,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,006 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:44:04,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:44:04,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,027 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:44:04,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,049 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-06 00:44:04,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,050 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-06 00:44:04,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,053 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:44:04,054 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:44:04,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,072 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:44:04,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,104 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:44:04,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,125 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-06 00:44:04,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,126 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-06 00:44:04,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,130 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:44:04,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,151 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:44:04,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,252 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:44:04,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,271 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:44:04,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:44:04,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,326 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:44:04,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,346 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:44:04,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,380 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:44:04,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:44:04,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,477 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:44:04,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:44:04,487 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:44:04,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:44:04,506 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [25282#(and (not (= ~z$w_buff0~0 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd4~0 256) 0)))] [2020-10-06 00:44:04,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:44:04,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:44:04,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:44:04,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:44:04,507 INFO L87 Difference]: Start difference. First operand 187 states and 447 transitions. Second operand 6 states. [2020-10-06 00:44:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:44:04,571 INFO L93 Difference]: Finished difference Result 238 states and 555 transitions. [2020-10-06 00:44:04,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:44:04,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-06 00:44:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:44:04,573 INFO L225 Difference]: With dead ends: 238 [2020-10-06 00:44:04,573 INFO L226 Difference]: Without dead ends: 192 [2020-10-06 00:44:04,573 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:44:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-10-06 00:44:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 159. [2020-10-06 00:44:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-10-06 00:44:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 371 transitions. [2020-10-06 00:44:04,585 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 371 transitions. Word has length 24 [2020-10-06 00:44:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:44:04,585 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 371 transitions. [2020-10-06 00:44:04,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:44:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 371 transitions. [2020-10-06 00:44:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-06 00:44:04,587 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:44:04,587 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-06 00:44:04,587 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 00:44:04,587 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-06 00:44:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:44:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1549421185, now seen corresponding path program 2 times [2020-10-06 00:44:04,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:44:04,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094896100] [2020-10-06 00:44:04,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:44:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:44:04,670 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:44:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:44:04,707 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:44:04,743 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 00:44:04,743 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 00:44:04,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 00:44:04,745 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 00:44:04,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L2-->L853: Formula: (let ((.cse8 (= (mod ~z$w_buff1_used~0_In-941270769 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-941270769 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-941270769 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-941270769 256) 0))) (let ((.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-941270769 0)) (or (and .cse0 (= ~z$w_buff1_used~0_In-941270769 ~z$w_buff1_used~0_Out-941270769)) (and (= ~z$w_buff1_used~0_Out-941270769 0) .cse1 .cse2)) (= ~z$r_buff1_thd0~0_Out-941270769 ~z$r_buff1_thd0~0_In-941270769) (or (and (= ~z$w_buff0_used~0_Out-941270769 ~z$w_buff0_used~0_In-941270769) .cse3) (and .cse4 .cse5 (= ~z$w_buff0_used~0_Out-941270769 0))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-941270769 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-941270769|) (= ~z$r_buff0_thd0~0_In-941270769 ~z$r_buff0_thd0~0_Out-941270769) (or (and .cse4 .cse5 (= ~z~0_Out-941270769 ~z$w_buff0~0_In-941270769)) (and (or (and .cse1 .cse2 (= ~z$w_buff1~0_In-941270769 ~z~0_Out-941270769)) (and (= ~z~0_In-941270769 ~z~0_Out-941270769) .cse0)) .cse3))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-941270769|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-941270769, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-941270769, ~z$w_buff0~0=~z$w_buff0~0_In-941270769, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-941270769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-941270769, ~z$w_buff1~0=~z$w_buff1~0_In-941270769, ~z~0=~z~0_In-941270769} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-941270769, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-941270769|, ~z$w_buff0~0=~z$w_buff0~0_In-941270769, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-941270769, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-941270769|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-941270769|, ~z$w_buff1~0=~z$w_buff1~0_In-941270769, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-941270769|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-941270769|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-941270769|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-941270769, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-941270769|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-941270769, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-941270769, ~z~0=~z~0_Out-941270769} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~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-06 00:44:04,777 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-06 00:44:04,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,779 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-06 00:44:04,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,780 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-06 00:44:04,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,780 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-06 00:44:04,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,780 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-06 00:44:04,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,781 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-06 00:44:04,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,781 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-06 00:44:04,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,781 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-06 00:44:04,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,782 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-06 00:44:04,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,782 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-06 00:44:04,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,783 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-06 00:44:04,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,783 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-06 00:44:04,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,783 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-06 00:44:04,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,784 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-06 00:44:04,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,784 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-06 00:44:04,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:44:04,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 12:44:04 BasicIcfg [2020-10-06 00:44:04,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 00:44:04,856 INFO L168 Benchmark]: Toolchain (without parser) took 11432.84 ms. Allocated memory was 144.2 MB in the beginning and 400.6 MB in the end (delta: 256.4 MB). Free memory was 98.6 MB in the beginning and 210.8 MB in the end (delta: -112.2 MB). Peak memory consumption was 144.2 MB. Max. memory is 7.1 GB. [2020-10-06 00:44:04,857 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-06 00:44:04,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 846.12 ms. Allocated memory was 144.2 MB in the beginning and 199.2 MB in the end (delta: 55.1 MB). Free memory was 98.4 MB in the beginning and 150.5 MB in the end (delta: -52.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-10-06 00:44:04,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.99 ms. Allocated memory is still 199.2 MB. Free memory was 150.5 MB in the beginning and 148.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-06 00:44:04,859 INFO L168 Benchmark]: Boogie Preprocessor took 37.94 ms. Allocated memory is still 199.2 MB. Free memory was 148.4 MB in the beginning and 145.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-06 00:44:04,860 INFO L168 Benchmark]: RCFGBuilder took 2050.30 ms. Allocated memory was 199.2 MB in the beginning and 252.2 MB in the end (delta: 53.0 MB). Free memory was 145.6 MB in the beginning and 217.9 MB in the end (delta: -72.3 MB). Peak memory consumption was 102.3 MB. Max. memory is 7.1 GB. [2020-10-06 00:44:04,861 INFO L168 Benchmark]: TraceAbstraction took 8434.01 ms. Allocated memory was 252.2 MB in the beginning and 400.6 MB in the end (delta: 148.4 MB). Free memory was 217.9 MB in the beginning and 210.8 MB in the end (delta: 7.1 MB). Peak memory consumption was 155.4 MB. Max. memory is 7.1 GB. [2020-10-06 00:44:04,864 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.19 ms. Allocated memory is still 144.2 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 846.12 ms. Allocated memory was 144.2 MB in the beginning and 199.2 MB in the end (delta: 55.1 MB). Free memory was 98.4 MB in the beginning and 150.5 MB in the end (delta: -52.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.99 ms. Allocated memory is still 199.2 MB. Free memory was 150.5 MB in the beginning and 148.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.94 ms. Allocated memory is still 199.2 MB. Free memory was 148.4 MB in the beginning and 145.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2050.30 ms. Allocated memory was 199.2 MB in the beginning and 252.2 MB in the end (delta: 53.0 MB). Free memory was 145.6 MB in the beginning and 217.9 MB in the end (delta: -72.3 MB). Peak memory consumption was 102.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8434.01 ms. Allocated memory was 252.2 MB in the beginning and 400.6 MB in the end (delta: 148.4 MB). Free memory was 217.9 MB in the beginning and 210.8 MB in the end (delta: 7.1 MB). Peak memory consumption was 155.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 119 ProgramPointsBefore, 43 ProgramPointsAfterwards, 108 TransitionsBefore, 31 TransitionsAfterwards, 2248 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 1148 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5420 CheckedPairsTotal, 89 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_p1_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int a = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L713] 0 int y = 0; [L715] 0 int z = 0; [L716] 0 _Bool z$flush_delayed; [L717] 0 int z$mem_tmp; [L718] 0 _Bool z$r_buff0_thd0; [L719] 0 _Bool z$r_buff0_thd1; [L720] 0 _Bool z$r_buff0_thd2; [L721] 0 _Bool z$r_buff0_thd3; [L722] 0 _Bool z$r_buff0_thd4; [L723] 0 _Bool z$r_buff1_thd0; [L724] 0 _Bool z$r_buff1_thd1; [L725] 0 _Bool z$r_buff1_thd2; [L726] 0 _Bool z$r_buff1_thd3; [L727] 0 _Bool z$r_buff1_thd4; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1373; [L836] FCALL, FORK 0 pthread_create(&t1373, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L837] 0 pthread_t t1374; [L838] FCALL, FORK 0 pthread_create(&t1374, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L839] 0 pthread_t t1375; [L840] FCALL, FORK 0 pthread_create(&t1375, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L841] 0 pthread_t t1376; [L842] FCALL, FORK 0 pthread_create(&t1376, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L797] 4 z$w_buff1 = z$w_buff0 [L798] 4 z$w_buff0 = 1 [L799] 4 z$w_buff1_used = z$w_buff0_used [L800] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L802] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L803] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L804] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L805] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L806] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L807] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L810] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __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] [L757] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __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] [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 2 return 0; [L769] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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=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] [L772] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 3 z$flush_delayed = weak$$choice2 [L775] 3 z$mem_tmp = z [L776] 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) [L776] 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) [L777] 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)) [L777] 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)) [L778] 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)) [L778] 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)) [L779] 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)) [L779] 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)) [L780] 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)) [L780] 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)) [L781] 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)) [L781] 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)) [L782] 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)) [L782] 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) [L782] 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)) [L782] 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)) [L783] 3 __unbuffered_p2_EAX = z [L784] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L784] 3 z = z$flush_delayed ? z$mem_tmp : z [L785] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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=255, 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] [L813] 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) [L813] 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) [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 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 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L817] 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 [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 4 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L790] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __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_p1_EAX=0, __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=255, x=2, y=1, 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, 107 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 283 SDtfs, 250 SDslu, 474 SDs, 0 SdLazy, 187 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 253 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s 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.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 7973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...