/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/safe016_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:36:30,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:36:30,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:36:30,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:36:30,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:36:30,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:36:30,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:36:30,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:36:30,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:36:30,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:36:30,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:36:30,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:36:30,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:36:30,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:36:30,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:36:30,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:36:30,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:36:30,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:36:30,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:36:30,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:36:30,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:36:30,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:36:30,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:36:30,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:36:30,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:36:30,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:36:30,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:36:30,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:36:30,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:36:30,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:36:30,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:36:30,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:36:30,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:36:30,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:36:30,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:36:30,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:36:30,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:36:30,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:36:30,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:36:30,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:36:30,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:36:30,528 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-22 00:36:30,570 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:36:30,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:36:30,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:36:30,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:36:30,572 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:36:30,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:36:30,572 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:36:30,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:36:30,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:36:30,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:36:30,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:36:30,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:36:30,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:36:30,574 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:36:30,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:36:30,575 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:36:30,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:36:30,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:36:30,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:36:30,577 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:36:30,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:36:30,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:36:30,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:36:30,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:36:30,578 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:36:30,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:36:30,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:36:30,578 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:36:30,579 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:36:30,579 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:36:30,579 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:36:30,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:36:30,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:36:30,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:36:30,882 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:36:30,882 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:36:30,883 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2020-10-22 00:36:30,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af28f16aa/be33f9acff2c4a2a8dadb2e5d31673af/FLAG08912c6b2 [2020-10-22 00:36:31,533 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:36:31,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2020-10-22 00:36:31,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af28f16aa/be33f9acff2c4a2a8dadb2e5d31673af/FLAG08912c6b2 [2020-10-22 00:36:31,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af28f16aa/be33f9acff2c4a2a8dadb2e5d31673af [2020-10-22 00:36:31,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:36:31,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:36:31,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:36:31,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:36:31,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:36:31,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:36:31" (1/1) ... [2020-10-22 00:36:31,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583129f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:31, skipping insertion in model container [2020-10-22 00:36:31,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:36:31" (1/1) ... [2020-10-22 00:36:31,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:36:32,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:36:32,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:36:32,609 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:36:32,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:36:32,766 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:36:32,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:32 WrapperNode [2020-10-22 00:36:32,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:36:32,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:36:32,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:36:32,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:36:32,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:32" (1/1) ... [2020-10-22 00:36:32,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:32" (1/1) ... [2020-10-22 00:36:32,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:36:32,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:36:32,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:36:32,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:36:32,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:32" (1/1) ... [2020-10-22 00:36:32,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:32" (1/1) ... [2020-10-22 00:36:32,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:32" (1/1) ... [2020-10-22 00:36:32,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:32" (1/1) ... [2020-10-22 00:36:32,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:32" (1/1) ... [2020-10-22 00:36:32,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:32" (1/1) ... [2020-10-22 00:36:32,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:32" (1/1) ... [2020-10-22 00:36:32,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:36:32,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:36:32,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:36:32,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:36:32,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:36:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-22 00:36:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:36:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:36:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:36:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:36:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:36:32,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:36:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:36:32,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:36:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 00:36:32,976 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 00:36:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-22 00:36:32,976 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-22 00:36:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:36:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:36:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:36:32,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:36:32,978 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:36:35,803 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:36:35,804 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-22 00:36:35,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:36:35 BoogieIcfgContainer [2020-10-22 00:36:35,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:36:35,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:36:35,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:36:35,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:36:35,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:36:31" (1/3) ... [2020-10-22 00:36:35,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4b830c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:36:35, skipping insertion in model container [2020-10-22 00:36:35,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:36:32" (2/3) ... [2020-10-22 00:36:35,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4b830c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:36:35, skipping insertion in model container [2020-10-22 00:36:35,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:36:35" (3/3) ... [2020-10-22 00:36:35,819 INFO L111 eAbstractionObserver]: Analyzing ICFG safe016_rmo.oepc.i [2020-10-22 00:36:35,836 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:36:35,837 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:36:35,847 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-22 00:36:35,849 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:36:35,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,899 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,900 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,914 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,915 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,916 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,917 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,921 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,921 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,923 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,923 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,923 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,923 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,923 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,924 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,931 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,940 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,941 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,944 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,945 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,948 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,950 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:36:35,952 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:36:35,970 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-22 00:36:36,001 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:36:36,001 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:36:36,001 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:36:36,002 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:36:36,002 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:36:36,002 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:36:36,002 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:36:36,003 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:36:36,025 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:36:36,026 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 132 transitions, 284 flow [2020-10-22 00:36:36,030 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 132 transitions, 284 flow [2020-10-22 00:36:36,033 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 142 places, 132 transitions, 284 flow [2020-10-22 00:36:36,103 INFO L129 PetriNetUnfolder]: 3/128 cut-off events. [2020-10-22 00:36:36,103 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:36:36,109 INFO L80 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 3/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-22 00:36:36,114 INFO L116 LiptonReduction]: Number of co-enabled transitions 2294 [2020-10-22 00:36:37,610 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-10-22 00:36:37,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-22 00:36:37,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:36:38,244 WARN L193 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-22 00:36:39,175 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2020-10-22 00:36:39,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-22 00:36:39,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:36:39,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 00:36:39,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:36:41,700 WARN L193 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 300 DAG size of output: 259 [2020-10-22 00:36:41,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-22 00:36:41,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:36:41,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2020-10-22 00:36:41,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-22 00:36:41,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 2, 2, 2, 1] term [2020-10-22 00:36:41,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-22 00:36:41,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:36:41,783 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-22 00:36:41,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:36:41,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:36:41,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:36:43,641 WARN L193 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 204 DAG size of output: 184 [2020-10-22 00:36:46,521 WARN L193 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 184 DAG size of output: 156 [2020-10-22 00:36:47,089 WARN L193 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2020-10-22 00:36:48,409 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 184 DAG size of output: 156 [2020-10-22 00:36:48,938 WARN L193 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2020-10-22 00:36:49,432 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2020-10-22 00:36:49,536 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-22 00:36:51,574 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 200 DAG size of output: 189 [2020-10-22 00:36:52,296 WARN L193 SmtUtils]: Spent 715.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2020-10-22 00:36:52,528 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-22 00:36:52,716 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 00:36:53,651 WARN L193 SmtUtils]: Spent 890.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 165 [2020-10-22 00:36:54,055 WARN L193 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-10-22 00:36:54,062 INFO L131 LiptonReduction]: Checked pairs total: 5471 [2020-10-22 00:36:54,062 INFO L133 LiptonReduction]: Total number of compositions: 118 [2020-10-22 00:36:54,069 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 28 transitions, 76 flow [2020-10-22 00:36:54,150 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1354 states. [2020-10-22 00:36:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states. [2020-10-22 00:36:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:36:54,173 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:36:54,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:36:54,174 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:36:54,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:36:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1371579098, now seen corresponding path program 1 times [2020-10-22 00:36:54,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:36:54,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952020705] [2020-10-22 00:36:54,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:36:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:36:54,536 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-22 00:36:54,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952020705] [2020-10-22 00:36:54,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:36:54,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:36:54,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369692224] [2020-10-22 00:36:54,540 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:36:54,545 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:36:54,563 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 00:36:54,563 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:36:54,568 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:36:54,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:36:54,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:36:54,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:36:54,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:36:54,587 INFO L87 Difference]: Start difference. First operand 1354 states. Second operand 3 states. [2020-10-22 00:36:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:36:54,674 INFO L93 Difference]: Finished difference Result 1306 states and 4780 transitions. [2020-10-22 00:36:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:36:54,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 00:36:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:36:54,724 INFO L225 Difference]: With dead ends: 1306 [2020-10-22 00:36:54,725 INFO L226 Difference]: Without dead ends: 1066 [2020-10-22 00:36:54,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:36:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2020-10-22 00:36:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1066. [2020-10-22 00:36:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2020-10-22 00:36:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 3828 transitions. [2020-10-22 00:36:54,899 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 3828 transitions. Word has length 11 [2020-10-22 00:36:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:36:54,900 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 3828 transitions. [2020-10-22 00:36:54,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:36:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 3828 transitions. [2020-10-22 00:36:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:36:54,910 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:36:54,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:36:54,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:36:54,911 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:36:54,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:36:54,912 INFO L82 PathProgramCache]: Analyzing trace with hash -427047198, now seen corresponding path program 1 times [2020-10-22 00:36:54,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:36:54,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97845641] [2020-10-22 00:36:54,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:36:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:36:55,077 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-22 00:36:55,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97845641] [2020-10-22 00:36:55,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:36:55,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:36:55,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [11971979] [2020-10-22 00:36:55,078 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:36:55,080 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:36:55,083 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2020-10-22 00:36:55,084 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:36:55,182 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:36:55,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:36:55,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:36:55,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:36:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:36:55,185 INFO L87 Difference]: Start difference. First operand 1066 states and 3828 transitions. Second operand 4 states. [2020-10-22 00:36:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:36:55,241 INFO L93 Difference]: Finished difference Result 1594 states and 5592 transitions. [2020-10-22 00:36:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:36:55,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-22 00:36:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:36:55,250 INFO L225 Difference]: With dead ends: 1594 [2020-10-22 00:36:55,250 INFO L226 Difference]: Without dead ends: 922 [2020-10-22 00:36:55,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-22 00:36:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2020-10-22 00:36:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2020-10-22 00:36:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2020-10-22 00:36:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 3196 transitions. [2020-10-22 00:36:55,289 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 3196 transitions. Word has length 12 [2020-10-22 00:36:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:36:55,289 INFO L481 AbstractCegarLoop]: Abstraction has 922 states and 3196 transitions. [2020-10-22 00:36:55,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:36:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 3196 transitions. [2020-10-22 00:36:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:36:55,291 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:36:55,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:36:55,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:36:55,291 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:36:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:36:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash 795278514, now seen corresponding path program 1 times [2020-10-22 00:36:55,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:36:55,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821545759] [2020-10-22 00:36:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:36:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:36:55,481 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-22 00:36:55,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821545759] [2020-10-22 00:36:55,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:36:55,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:36:55,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [849448824] [2020-10-22 00:36:55,482 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:36:55,485 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:36:55,489 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 33 transitions. [2020-10-22 00:36:55,489 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:36:55,808 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:36:55,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:36:55,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:36:55,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:36:55,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:36:55,810 INFO L87 Difference]: Start difference. First operand 922 states and 3196 transitions. Second operand 3 states. [2020-10-22 00:36:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:36:55,863 INFO L93 Difference]: Finished difference Result 890 states and 3068 transitions. [2020-10-22 00:36:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:36:55,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-22 00:36:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:36:55,872 INFO L225 Difference]: With dead ends: 890 [2020-10-22 00:36:55,872 INFO L226 Difference]: Without dead ends: 890 [2020-10-22 00:36:55,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-22 00:36:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2020-10-22 00:36:55,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2020-10-22 00:36:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2020-10-22 00:36:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 3068 transitions. [2020-10-22 00:36:55,907 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 3068 transitions. Word has length 13 [2020-10-22 00:36:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:36:55,908 INFO L481 AbstractCegarLoop]: Abstraction has 890 states and 3068 transitions. [2020-10-22 00:36:55,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:36:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 3068 transitions. [2020-10-22 00:36:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:36:55,909 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:36:55,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:36:55,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:36:55,910 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:36:55,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:36:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1308094352, now seen corresponding path program 1 times [2020-10-22 00:36:55,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:36:55,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240333676] [2020-10-22 00:36:55,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:36:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:36:55,974 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-22 00:36:55,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240333676] [2020-10-22 00:36:55,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:36:55,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:36:55,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [48497030] [2020-10-22 00:36:55,975 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:36:55,978 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:36:55,985 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 38 transitions. [2020-10-22 00:36:55,985 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:36:56,059 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:36:56,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:36:56,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:36:56,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:36:56,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:36:56,061 INFO L87 Difference]: Start difference. First operand 890 states and 3068 transitions. Second operand 4 states. [2020-10-22 00:36:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:36:56,176 INFO L93 Difference]: Finished difference Result 1658 states and 5392 transitions. [2020-10-22 00:36:56,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:36:56,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-22 00:36:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:36:56,193 INFO L225 Difference]: With dead ends: 1658 [2020-10-22 00:36:56,193 INFO L226 Difference]: Without dead ends: 810 [2020-10-22 00:36:56,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-22 00:36:56,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2020-10-22 00:36:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 746. [2020-10-22 00:36:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2020-10-22 00:36:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 2364 transitions. [2020-10-22 00:36:56,224 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 2364 transitions. Word has length 14 [2020-10-22 00:36:56,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:36:56,226 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 2364 transitions. [2020-10-22 00:36:56,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:36:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 2364 transitions. [2020-10-22 00:36:56,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:36:56,228 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:36:56,228 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:36:56,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:36:56,228 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:36:56,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:36:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash -661850536, now seen corresponding path program 1 times [2020-10-22 00:36:56,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:36:56,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759995111] [2020-10-22 00:36:56,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:36:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:36:57,045 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 26 [2020-10-22 00:36:57,048 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-22 00:36:57,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759995111] [2020-10-22 00:36:57,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:36:57,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:36:57,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [112878304] [2020-10-22 00:36:57,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:36:57,052 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:36:57,059 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-10-22 00:36:57,059 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:36:57,069 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 3 conjuncts [2020-10-22 00:36:57,104 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 3 conjuncts [2020-10-22 00:36:57,498 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:36:57,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:36:57,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:36:57,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:36:57,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:36:57,500 INFO L87 Difference]: Start difference. First operand 746 states and 2364 transitions. Second operand 9 states. [2020-10-22 00:36:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:36:57,882 INFO L93 Difference]: Finished difference Result 870 states and 2688 transitions. [2020-10-22 00:36:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:36:57,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-10-22 00:36:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:36:57,893 INFO L225 Difference]: With dead ends: 870 [2020-10-22 00:36:57,894 INFO L226 Difference]: Without dead ends: 870 [2020-10-22 00:36:57,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:36:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2020-10-22 00:36:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 869. [2020-10-22 00:36:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2020-10-22 00:36:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2687 transitions. [2020-10-22 00:36:57,927 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2687 transitions. Word has length 14 [2020-10-22 00:36:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:36:57,927 INFO L481 AbstractCegarLoop]: Abstraction has 869 states and 2687 transitions. [2020-10-22 00:36:57,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:36:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2687 transitions. [2020-10-22 00:36:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:36:57,929 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:36:57,929 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:36:57,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:36:57,930 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:36:57,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:36:57,930 INFO L82 PathProgramCache]: Analyzing trace with hash 955751417, now seen corresponding path program 1 times [2020-10-22 00:36:57,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:36:57,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523004714] [2020-10-22 00:36:57,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:36:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:36:58,125 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-22 00:36:58,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523004714] [2020-10-22 00:36:58,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:36:58,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:36:58,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1154874632] [2020-10-22 00:36:58,126 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:36:58,130 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:36:58,137 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2020-10-22 00:36:58,138 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:36:58,438 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:36:58,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:36:58,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:36:58,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:36:58,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:36:58,439 INFO L87 Difference]: Start difference. First operand 869 states and 2687 transitions. Second operand 4 states. [2020-10-22 00:36:58,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:36:58,493 INFO L93 Difference]: Finished difference Result 943 states and 2697 transitions. [2020-10-22 00:36:58,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:36:58,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-22 00:36:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:36:58,500 INFO L225 Difference]: With dead ends: 943 [2020-10-22 00:36:58,500 INFO L226 Difference]: Without dead ends: 759 [2020-10-22 00:36:58,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-22 00:36:58,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2020-10-22 00:36:58,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2020-10-22 00:36:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2020-10-22 00:36:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 2185 transitions. [2020-10-22 00:36:58,524 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 2185 transitions. Word has length 15 [2020-10-22 00:36:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:36:58,524 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 2185 transitions. [2020-10-22 00:36:58,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:36:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 2185 transitions. [2020-10-22 00:36:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:36:58,527 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:36:58,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:36:58,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:36:58,527 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:36:58,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:36:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1698815720, now seen corresponding path program 1 times [2020-10-22 00:36:58,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:36:58,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715017093] [2020-10-22 00:36:58,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:36:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:36:58,763 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-22 00:36:58,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715017093] [2020-10-22 00:36:58,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:36:58,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:36:58,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [465039896] [2020-10-22 00:36:58,764 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:36:58,767 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:36:58,773 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2020-10-22 00:36:58,774 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:36:58,790 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-22 00:36:59,166 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-22 00:36:59,377 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:36:59,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:36:59,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:36:59,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:36:59,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:36:59,379 INFO L87 Difference]: Start difference. First operand 759 states and 2185 transitions. Second operand 8 states. [2020-10-22 00:36:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:36:59,518 INFO L93 Difference]: Finished difference Result 755 states and 2170 transitions. [2020-10-22 00:36:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:36:59,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-22 00:36:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:36:59,525 INFO L225 Difference]: With dead ends: 755 [2020-10-22 00:36:59,525 INFO L226 Difference]: Without dead ends: 755 [2020-10-22 00:36:59,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:36:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2020-10-22 00:36:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2020-10-22 00:36:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2020-10-22 00:36:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 2170 transitions. [2020-10-22 00:36:59,546 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 2170 transitions. Word has length 15 [2020-10-22 00:36:59,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:36:59,547 INFO L481 AbstractCegarLoop]: Abstraction has 755 states and 2170 transitions. [2020-10-22 00:36:59,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:36:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 2170 transitions. [2020-10-22 00:36:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 00:36:59,548 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:36:59,549 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:36:59,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:36:59,549 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:36:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:36:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1675743977, now seen corresponding path program 1 times [2020-10-22 00:36:59,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:36:59,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513311037] [2020-10-22 00:36:59,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:36:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:36:59,649 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-22 00:36:59,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513311037] [2020-10-22 00:36:59,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:36:59,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:36:59,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1872822894] [2020-10-22 00:36:59,650 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:36:59,653 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:36:59,661 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 62 transitions. [2020-10-22 00:36:59,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:00,013 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [22930#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:37:00,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:37:00,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:00,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:37:00,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:37:00,014 INFO L87 Difference]: Start difference. First operand 755 states and 2170 transitions. Second operand 6 states. [2020-10-22 00:37:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:00,080 INFO L93 Difference]: Finished difference Result 694 states and 1805 transitions. [2020-10-22 00:37:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:37:00,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-22 00:37:00,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:00,085 INFO L225 Difference]: With dead ends: 694 [2020-10-22 00:37:00,085 INFO L226 Difference]: Without dead ends: 541 [2020-10-22 00:37:00,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:37:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-10-22 00:37:00,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2020-10-22 00:37:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-10-22 00:37:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 1377 transitions. [2020-10-22 00:37:00,101 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 1377 transitions. Word has length 16 [2020-10-22 00:37:00,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:00,101 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 1377 transitions. [2020-10-22 00:37:00,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:37:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1377 transitions. [2020-10-22 00:37:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:37:00,103 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:00,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:00,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:37:00,103 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:00,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:00,104 INFO L82 PathProgramCache]: Analyzing trace with hash -35547819, now seen corresponding path program 1 times [2020-10-22 00:37:00,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:00,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404657715] [2020-10-22 00:37:00,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:00,381 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-22 00:37:00,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404657715] [2020-10-22 00:37:00,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:00,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:37:00,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2121746857] [2020-10-22 00:37:00,382 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:00,385 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:00,401 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 125 transitions. [2020-10-22 00:37:00,401 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:02,021 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:37:02,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:37:02,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:37:02,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:37:02,023 INFO L87 Difference]: Start difference. First operand 541 states and 1377 transitions. Second operand 6 states. [2020-10-22 00:37:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:02,372 INFO L93 Difference]: Finished difference Result 800 states and 1984 transitions. [2020-10-22 00:37:02,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:37:02,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-22 00:37:02,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:02,378 INFO L225 Difference]: With dead ends: 800 [2020-10-22 00:37:02,378 INFO L226 Difference]: Without dead ends: 670 [2020-10-22 00:37:02,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:37:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2020-10-22 00:37:02,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 531. [2020-10-22 00:37:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2020-10-22 00:37:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1322 transitions. [2020-10-22 00:37:02,393 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 1322 transitions. Word has length 18 [2020-10-22 00:37:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:02,394 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 1322 transitions. [2020-10-22 00:37:02,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:37:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 1322 transitions. [2020-10-22 00:37:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:37:02,396 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:02,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:02,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:37:02,396 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash -17851965, now seen corresponding path program 1 times [2020-10-22 00:37:02,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:02,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077753457] [2020-10-22 00:37:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:02,506 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-22 00:37:02,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077753457] [2020-10-22 00:37:02,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:02,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:37:02,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [301337721] [2020-10-22 00:37:02,507 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:02,510 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:02,530 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 138 transitions. [2020-10-22 00:37:02,530 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:03,254 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [26587#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:37:03,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:37:03,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:03,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:37:03,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:37:03,256 INFO L87 Difference]: Start difference. First operand 531 states and 1322 transitions. Second operand 7 states. [2020-10-22 00:37:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:03,348 INFO L93 Difference]: Finished difference Result 466 states and 1114 transitions. [2020-10-22 00:37:03,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:37:03,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-22 00:37:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:03,354 INFO L225 Difference]: With dead ends: 466 [2020-10-22 00:37:03,354 INFO L226 Difference]: Without dead ends: 391 [2020-10-22 00:37:03,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:37:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2020-10-22 00:37:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 366. [2020-10-22 00:37:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-10-22 00:37:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 873 transitions. [2020-10-22 00:37:03,364 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 873 transitions. Word has length 18 [2020-10-22 00:37:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:03,365 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 873 transitions. [2020-10-22 00:37:03,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:37:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 873 transitions. [2020-10-22 00:37:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:37:03,366 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:03,366 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-22 00:37:03,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:37:03,367 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash -73728734, now seen corresponding path program 1 times [2020-10-22 00:37:03,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:03,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302764203] [2020-10-22 00:37:03,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:03,493 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-22 00:37:03,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302764203] [2020-10-22 00:37:03,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:03,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:37:03,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1815332835] [2020-10-22 00:37:03,494 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:03,498 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:03,523 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 160 transitions. [2020-10-22 00:37:03,524 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:04,383 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [27795#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:37:04,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:37:04,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:04,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:37:04,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:37:04,384 INFO L87 Difference]: Start difference. First operand 366 states and 873 transitions. Second operand 8 states. [2020-10-22 00:37:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:04,482 INFO L93 Difference]: Finished difference Result 346 states and 833 transitions. [2020-10-22 00:37:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 00:37:04,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-22 00:37:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:04,485 INFO L225 Difference]: With dead ends: 346 [2020-10-22 00:37:04,485 INFO L226 Difference]: Without dead ends: 175 [2020-10-22 00:37:04,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:37:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-10-22 00:37:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 137. [2020-10-22 00:37:04,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-22 00:37:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2020-10-22 00:37:04,490 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 20 [2020-10-22 00:37:04,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:04,491 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2020-10-22 00:37:04,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:37:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2020-10-22 00:37:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:37:04,492 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:04,492 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] [2020-10-22 00:37:04,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:37:04,492 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:04,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:04,493 INFO L82 PathProgramCache]: Analyzing trace with hash 370727674, now seen corresponding path program 1 times [2020-10-22 00:37:04,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:04,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149263860] [2020-10-22 00:37:04,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:37:04,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:37:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:37:04,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:37:04,743 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:37:04,744 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:37:04,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:37:04,745 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:37:04,768 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1412] [1412] L3-->L869: Formula: (let ((.cse8 (= (mod ~y$w_buff0_used~0_In871368301 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In871368301 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In871368301 256) 0)) (.cse10 (= (mod ~y$w_buff1_used~0_In871368301 256) 0))) (let ((.cse3 (or .cse9 .cse10)) (.cse0 (not .cse10)) (.cse2 (not .cse9)) (.cse4 (or .cse8 .cse7)) (.cse5 (not .cse8)) (.cse6 (not .cse7))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out871368301 |ULTIMATE.start_assume_abort_if_not_#in~cond_In871368301|) (= ~y$r_buff0_thd0~0_In871368301 ~y$r_buff0_thd0~0_Out871368301) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out871368301 0)) (let ((.cse1 (select |#memory_int_In871368301| |~#y~0.base_In871368301|))) (or (and (or (and .cse0 (= |#memory_int_Out871368301| (store |#memory_int_In871368301| |~#y~0.base_In871368301| (store .cse1 |~#y~0.offset_In871368301| ~y$w_buff1~0_In871368301))) .cse2) (and .cse3 (= (store |#memory_int_In871368301| |~#y~0.base_In871368301| (store .cse1 |~#y~0.offset_In871368301| (select .cse1 |~#y~0.offset_In871368301|))) |#memory_int_Out871368301|))) .cse4) (and .cse5 (= |#memory_int_Out871368301| (store |#memory_int_In871368301| |~#y~0.base_In871368301| (store .cse1 |~#y~0.offset_In871368301| ~y$w_buff0~0_In871368301))) .cse6))) (or (and (= ~y$w_buff1_used~0_Out871368301 ~y$w_buff1_used~0_In871368301) .cse3) (and (= ~y$w_buff1_used~0_Out871368301 0) .cse0 .cse2)) (= ~y$r_buff1_thd0~0_Out871368301 ~y$r_buff1_thd0~0_In871368301) (or (and (= ~y$w_buff0_used~0_Out871368301 ~y$w_buff0_used~0_In871368301) .cse4) (and .cse5 .cse6 (= ~y$w_buff0_used~0_Out871368301 0)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In871368301|, ~#y~0.offset=|~#y~0.offset_In871368301|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In871368301, ~y$w_buff1~0=~y$w_buff1~0_In871368301, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In871368301, ~y$w_buff0~0=~y$w_buff0~0_In871368301, #memory_int=|#memory_int_In871368301|, ~#y~0.base=|~#y~0.base_In871368301|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In871368301, ~y$w_buff1_used~0=~y$w_buff1_used~0_In871368301} OutVars{~#y~0.offset=|~#y~0.offset_In871368301|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out871368301, ULTIMATE.start_main_#t~mem50=|ULTIMATE.start_main_#t~mem50_Out871368301|, ~#y~0.base=|~#y~0.base_In871368301|, ULTIMATE.start_main_#t~ite54=|ULTIMATE.start_main_#t~ite54_Out871368301|, ULTIMATE.start_main_#t~ite53=|ULTIMATE.start_main_#t~ite53_Out871368301|, ULTIMATE.start_main_#t~ite56=|ULTIMATE.start_main_#t~ite56_Out871368301|, ULTIMATE.start_main_#t~ite55=|ULTIMATE.start_main_#t~ite55_Out871368301|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In871368301|, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out871368301|, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out871368301|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out871368301, ~y$w_buff1~0=~y$w_buff1~0_In871368301, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out871368301, ~y$w_buff0~0=~y$w_buff0~0_In871368301, #memory_int=|#memory_int_Out871368301|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out871368301, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out871368301} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem50, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_assume_abort_if_not_~cond, ~y$r_buff0_thd0~0, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-22 00:37: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-22 00:37:04,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37: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-22 00:37:04,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37: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-22 00:37:04,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37: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-22 00:37:04,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37: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-22 00:37:04,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37: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-22 00:37:04,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,785 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-22 00:37:04,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,785 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-22 00:37:04,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,785 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-22 00:37:04,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,786 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-22 00:37:04,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,786 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-22 00:37:04,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,786 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-22 00:37:04,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,787 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-22 00:37:04,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,793 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-22 00:37:04,793 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,793 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-22 00:37:04,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,798 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-22 00:37:04,798 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,798 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-22 00:37:04,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,799 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-22 00:37:04,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,799 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-22 00:37:04,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,800 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-22 00:37:04,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,801 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-22 00:37:04,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,801 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-22 00:37:04,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,801 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-22 00:37:04,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,801 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-22 00:37:04,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,802 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-22 00:37:04,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,803 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-22 00:37:04,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,803 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-22 00:37:04,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,803 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-22 00:37:04,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,804 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-22 00:37:04,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,804 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-22 00:37:04,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,804 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-22 00:37:04,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,805 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-22 00:37:04,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,805 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-22 00:37:04,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,805 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-22 00:37:04,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,805 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-22 00:37:04,806 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,806 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-22 00:37:04,806 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,806 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-22 00:37:04,806 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,806 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-22 00:37:04,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:04,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:37:04 BasicIcfg [2020-10-22 00:37:04,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:37:04,944 INFO L168 Benchmark]: Toolchain (without parser) took 32970.33 ms. Allocated memory was 140.0 MB in the beginning and 541.1 MB in the end (delta: 401.1 MB). Free memory was 101.3 MB in the beginning and 108.0 MB in the end (delta: -6.7 MB). Peak memory consumption was 394.4 MB. Max. memory is 7.1 GB. [2020-10-22 00:37:04,945 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 00:37:04,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.85 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 100.5 MB in the beginning and 151.7 MB in the end (delta: -51.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-10-22 00:37:04,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.29 ms. Allocated memory is still 201.3 MB. Free memory was 151.7 MB in the beginning and 148.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-22 00:37:04,949 INFO L168 Benchmark]: Boogie Preprocessor took 52.06 ms. Allocated memory is still 201.3 MB. Free memory was 148.4 MB in the beginning and 145.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 00:37:04,952 INFO L168 Benchmark]: RCFGBuilder took 2921.46 ms. Allocated memory was 201.3 MB in the beginning and 249.0 MB in the end (delta: 47.7 MB). Free memory was 145.7 MB in the beginning and 159.6 MB in the end (delta: -14.0 MB). Peak memory consumption was 107.2 MB. Max. memory is 7.1 GB. [2020-10-22 00:37:04,953 INFO L168 Benchmark]: TraceAbstraction took 29128.69 ms. Allocated memory was 249.0 MB in the beginning and 541.1 MB in the end (delta: 292.0 MB). Free memory was 159.6 MB in the beginning and 108.0 MB in the end (delta: 51.7 MB). Peak memory consumption was 343.7 MB. Max. memory is 7.1 GB. [2020-10-22 00:37:04,959 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.85 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 100.5 MB in the beginning and 151.7 MB in the end (delta: -51.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.29 ms. Allocated memory is still 201.3 MB. Free memory was 151.7 MB in the beginning and 148.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.06 ms. Allocated memory is still 201.3 MB. Free memory was 148.4 MB in the beginning and 145.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2921.46 ms. Allocated memory was 201.3 MB in the beginning and 249.0 MB in the end (delta: 47.7 MB). Free memory was 145.7 MB in the beginning and 159.6 MB in the end (delta: -14.0 MB). Peak memory consumption was 107.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29128.69 ms. Allocated memory was 249.0 MB in the beginning and 541.1 MB in the end (delta: 292.0 MB). Free memory was 159.6 MB in the beginning and 108.0 MB in the end (delta: 51.7 MB). Peak memory consumption was 343.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1199 VarBasedMoverChecksPositive, 48 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 86 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 18.0s, 142 PlacesBefore, 41 PlacesAfterwards, 132 TransitionsBefore, 28 TransitionsAfterwards, 2294 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 118 TotalNumberOfCompositions, 5471 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2161; [L852] FCALL, FORK 0 pthread_create(&t2161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L769] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L769] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L770] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L770] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L771] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L771] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L772] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L772] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L773] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L773] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L773] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L774] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L774] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L777] EXPR 1 \read(y) [L777] 1 __unbuffered_p0_EAX = y [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] EXPR 1 \read(y) [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] 1 y = y$flush_delayed ? y$mem_tmp : y [L779] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L853] 0 pthread_t t2162; [L854] FCALL, FORK 0 pthread_create(&t2162, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t2163; [L856] FCALL, FORK 0 pthread_create(&t2163, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] 0 pthread_t t2164; [L794] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=50, weak$$choice1=0, weak$$choice2=255, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=50, weak$$choice1=0, weak$$choice2=255, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L809] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=50, weak$$choice1=0, weak$$choice2=255, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L858] FCALL, FORK 0 pthread_create(&t2164, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, 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=50, weak$$choice1=0, weak$$choice2=255, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 4 y = 2 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, 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=50, weak$$choice1=0, weak$$choice2=255, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 \read(y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L878] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L880] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 x == 2 && y == 2 [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe016_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, 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=49, weak$$choice1=255, weak$$choice2=0, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 130 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.1s, HoareTripleCheckerStatistics: 286 SDtfs, 342 SDslu, 541 SDs, 0 SdLazy, 432 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 217 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1354occurred 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, 11 MinimizatonAttempts, 267 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 23910 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...