/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-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:17:54,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:17:54,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:17:54,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:17:54,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:17:54,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:17:54,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:17:54,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:17:54,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:17:54,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:17:54,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:17:54,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:17:54,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:17:54,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:17:54,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:17:54,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:17:54,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:17:54,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:17:54,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:17:54,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:17:54,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:17:54,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:17:54,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:17:54,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:17:54,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:17:54,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:17:54,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:17:54,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:17:54,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:17:54,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:17:54,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:17:54,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:17:54,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:17:54,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:17:54,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:17:54,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:17:54,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:17:54,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:17:54,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:17:54,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:17:54,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:17:54,695 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-SP.epf [2020-10-22 02:17:54,727 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:17:54,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:17:54,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:17:54,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:17:54,729 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:17:54,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:17:54,729 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:17:54,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:17:54,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:17:54,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:17:54,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:17:54,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:17:54,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:17:54,731 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:17:54,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:17:54,731 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:17:54,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:17:54,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:17:54,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:17:54,732 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:17:54,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:17:54,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:17:54,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:17:54,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:17:54,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:17:54,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:17:54,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:17:54,733 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:17:54,734 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:17:54,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:17:54,734 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:17:55,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:17:55,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:17:55,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:17:55,025 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:17:55,026 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:17:55,026 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.oepc.i [2020-10-22 02:17:55,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16bbedc16/540c143cffbe4c74a345e6d5b046f0bb/FLAG9abd2ab90 [2020-10-22 02:17:55,588 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:17:55,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.oepc.i [2020-10-22 02:17:55,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16bbedc16/540c143cffbe4c74a345e6d5b046f0bb/FLAG9abd2ab90 [2020-10-22 02:17:55,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16bbedc16/540c143cffbe4c74a345e6d5b046f0bb [2020-10-22 02:17:55,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:17:55,896 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:17:55,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:17:55,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:17:55,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:17:55,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:17:55" (1/1) ... [2020-10-22 02:17:55,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a59f231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:55, skipping insertion in model container [2020-10-22 02:17:55,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:17:55" (1/1) ... [2020-10-22 02:17:55,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:17:55,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:17:56,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:17:56,438 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:17:56,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:17:56,644 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:17:56,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:56 WrapperNode [2020-10-22 02:17:56,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:17:56,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:17:56,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:17:56,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:17:56,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:56" (1/1) ... [2020-10-22 02:17:56,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:56" (1/1) ... [2020-10-22 02:17:56,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:17:56,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:17:56,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:17:56,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:17:56,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:56" (1/1) ... [2020-10-22 02:17:56,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:56" (1/1) ... [2020-10-22 02:17:56,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:56" (1/1) ... [2020-10-22 02:17:56,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:56" (1/1) ... [2020-10-22 02:17:56,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:56" (1/1) ... [2020-10-22 02:17:56,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:56" (1/1) ... [2020-10-22 02:17:56,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:56" (1/1) ... [2020-10-22 02:17:56,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:17:56,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:17:56,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:17:56,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:17:56,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:56" (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 02:17:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-22 02:17:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:17:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:17:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:17:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:17:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:17:56,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:17:56,850 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:17:56,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:17:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:17:56,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:17:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:17:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:17:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:17:56,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:17:56,854 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 02:18:00,355 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:18:00,356 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-22 02:18:00,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:18:00 BoogieIcfgContainer [2020-10-22 02:18:00,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:18:00,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:18:00,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:18:00,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:18:00,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:17:55" (1/3) ... [2020-10-22 02:18:00,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6aefe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:18:00, skipping insertion in model container [2020-10-22 02:18:00,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:17:56" (2/3) ... [2020-10-22 02:18:00,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6aefe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:18:00, skipping insertion in model container [2020-10-22 02:18:00,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:18:00" (3/3) ... [2020-10-22 02:18:00,374 INFO L111 eAbstractionObserver]: Analyzing ICFG safe025_rmo.oepc.i [2020-10-22 02:18:00,392 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:18:00,392 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:18:00,403 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-22 02:18:00,405 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:18:00,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,464 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,488 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,528 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,529 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,540 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,541 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,550 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,551 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:18:00,559 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:18:00,579 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-22 02:18:00,609 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:18:00,609 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:18:00,609 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:18:00,609 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:18:00,610 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:18:00,610 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:18:00,610 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:18:00,610 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:18:00,625 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:18:00,626 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 118 transitions, 251 flow [2020-10-22 02:18:00,630 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 118 transitions, 251 flow [2020-10-22 02:18:00,633 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 251 flow [2020-10-22 02:18:00,702 INFO L129 PetriNetUnfolder]: 3/115 cut-off events. [2020-10-22 02:18:00,702 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:18:00,708 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-10-22 02:18:00,711 INFO L116 LiptonReduction]: Number of co-enabled transitions 1658 [2020-10-22 02:18:01,282 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-22 02:18:01,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-22 02:18:01,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:18:01,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 02:18:01,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:18:01,425 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-22 02:18:03,073 WARN L193 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 278 DAG size of output: 238 [2020-10-22 02:18:03,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-22 02:18:03,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:18:03,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 4, 3, 2, 1] term [2020-10-22 02:18:03,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-22 02:18:03,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 2, 1] term [2020-10-22 02:18:03,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-22 02:18:05,244 WARN L193 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 194 DAG size of output: 174 [2020-10-22 02:18:06,555 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-10-22 02:18:06,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-22 02:18:06,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:18:07,211 WARN L193 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-22 02:18:08,975 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 177 DAG size of output: 159 [2020-10-22 02:18:10,059 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 156 DAG size of output: 155 [2020-10-22 02:18:10,728 WARN L193 SmtUtils]: Spent 664.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-10-22 02:18:11,380 WARN L193 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-10-22 02:18:11,864 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-22 02:18:12,727 WARN L193 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2020-10-22 02:18:13,318 WARN L193 SmtUtils]: Spent 588.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2020-10-22 02:18:15,477 WARN L193 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 191 DAG size of output: 181 [2020-10-22 02:18:16,432 WARN L193 SmtUtils]: Spent 950.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2020-10-22 02:18:16,591 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-22 02:18:16,719 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-22 02:18:16,837 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-22 02:18:16,956 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-22 02:18:17,766 WARN L193 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 159 [2020-10-22 02:18:18,111 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2020-10-22 02:18:18,119 INFO L131 LiptonReduction]: Checked pairs total: 4691 [2020-10-22 02:18:18,119 INFO L133 LiptonReduction]: Total number of compositions: 107 [2020-10-22 02:18:18,126 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 24 transitions, 63 flow [2020-10-22 02:18:18,163 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 550 states. [2020-10-22 02:18:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states. [2020-10-22 02:18:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:18:18,174 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:18:18,175 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:18:18,175 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:18:18,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:18:18,181 INFO L82 PathProgramCache]: Analyzing trace with hash 452210359, now seen corresponding path program 1 times [2020-10-22 02:18:18,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:18:18,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155049627] [2020-10-22 02:18:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:18:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:18:18,539 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 02:18:18,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155049627] [2020-10-22 02:18:18,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:18:18,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:18:18,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1571724371] [2020-10-22 02:18:18,544 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:18:18,548 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:18:18,574 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 02:18:18,574 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:18:18,578 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:18:18,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:18:18,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:18:18,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:18:18,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:18:18,595 INFO L87 Difference]: Start difference. First operand 550 states. Second operand 3 states. [2020-10-22 02:18:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:18:18,651 INFO L93 Difference]: Finished difference Result 530 states and 1622 transitions. [2020-10-22 02:18:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:18:18,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 02:18:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:18:18,671 INFO L225 Difference]: With dead ends: 530 [2020-10-22 02:18:18,671 INFO L226 Difference]: Without dead ends: 430 [2020-10-22 02:18:18,673 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 02:18:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-10-22 02:18:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2020-10-22 02:18:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-10-22 02:18:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1287 transitions. [2020-10-22 02:18:18,765 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1287 transitions. Word has length 9 [2020-10-22 02:18:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:18:18,766 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 1287 transitions. [2020-10-22 02:18:18,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:18:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1287 transitions. [2020-10-22 02:18:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:18:18,768 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:18:18,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:18:18,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:18:18,769 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:18:18,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:18:18,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1132528579, now seen corresponding path program 1 times [2020-10-22 02:18:18,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:18:18,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551355286] [2020-10-22 02:18:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:18:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:18:19,127 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 02:18:19,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551355286] [2020-10-22 02:18:19,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:18:19,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:18:19,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96554038] [2020-10-22 02:18:19,129 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:18:19,131 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:18:19,133 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 12 transitions. [2020-10-22 02:18:19,134 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:18:19,165 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 2, 1] term [2020-10-22 02:18:19,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,167 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-22 02:18:19,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,169 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 3, 2, 1] term [2020-10-22 02:18:19,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,170 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 2, 1] term [2020-10-22 02:18:19,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,171 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 2, 1] term [2020-10-22 02:18:19,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,184 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:18:19,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,206 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:18:19,216 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:18:19,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,218 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:18:19,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:19,232 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:18:19,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:19,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,259 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:18:19,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:19,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:19,264 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:18:19,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:19,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:19,278 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:18:19,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:19,306 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:19,322 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:19,363 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:18:19,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:18:19,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:18:19,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:18:19,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:18:19,366 INFO L87 Difference]: Start difference. First operand 430 states and 1287 transitions. Second operand 6 states. [2020-10-22 02:18:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:18:19,506 INFO L93 Difference]: Finished difference Result 414 states and 1231 transitions. [2020-10-22 02:18:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:18:19,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-22 02:18:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:18:19,513 INFO L225 Difference]: With dead ends: 414 [2020-10-22 02:18:19,513 INFO L226 Difference]: Without dead ends: 414 [2020-10-22 02:18:19,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:18:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2020-10-22 02:18:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2020-10-22 02:18:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-10-22 02:18:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1231 transitions. [2020-10-22 02:18:19,541 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1231 transitions. Word has length 10 [2020-10-22 02:18:19,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:18:19,541 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 1231 transitions. [2020-10-22 02:18:19,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:18:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1231 transitions. [2020-10-22 02:18:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:18:19,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:18:19,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:18:19,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:18:19,544 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:18:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:18:19,545 INFO L82 PathProgramCache]: Analyzing trace with hash 748617863, now seen corresponding path program 1 times [2020-10-22 02:18:19,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:18:19,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804464509] [2020-10-22 02:18:19,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:18:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:18:19,845 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2020-10-22 02:18:19,847 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 02:18:19,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804464509] [2020-10-22 02:18:19,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:18:19,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:18:19,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [951440912] [2020-10-22 02:18:19,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:18:19,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:18:19,854 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 15 transitions. [2020-10-22 02:18:19,854 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:18:19,878 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 3, 2, 1] term [2020-10-22 02:18:19,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:19,888 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 2, 1] term [2020-10-22 02:18:19,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,890 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 02:18:19,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:19,944 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:18:19,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:18:19,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:18:19,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:18:19,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:18:19,946 INFO L87 Difference]: Start difference. First operand 414 states and 1231 transitions. Second operand 6 states. [2020-10-22 02:18:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:18:20,204 INFO L93 Difference]: Finished difference Result 498 states and 1491 transitions. [2020-10-22 02:18:20,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:18:20,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-22 02:18:20,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:18:20,209 INFO L225 Difference]: With dead ends: 498 [2020-10-22 02:18:20,209 INFO L226 Difference]: Without dead ends: 498 [2020-10-22 02:18:20,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:18:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2020-10-22 02:18:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 462. [2020-10-22 02:18:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2020-10-22 02:18:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1383 transitions. [2020-10-22 02:18:20,229 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1383 transitions. Word has length 11 [2020-10-22 02:18:20,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:18:20,229 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 1383 transitions. [2020-10-22 02:18:20,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:18:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1383 transitions. [2020-10-22 02:18:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:18:20,232 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:18:20,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:18:20,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:18:20,232 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:18:20,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:18:20,233 INFO L82 PathProgramCache]: Analyzing trace with hash 781512893, now seen corresponding path program 2 times [2020-10-22 02:18:20,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:18:20,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694923387] [2020-10-22 02:18:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:18:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:18:20,505 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 02:18:20,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694923387] [2020-10-22 02:18:20,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:18:20,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:18:20,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [738515638] [2020-10-22 02:18:20,507 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:18:20,510 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:18:20,512 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 17 transitions. [2020-10-22 02:18:20,513 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:18:20,672 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 21 [2020-10-22 02:18:20,714 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:18:20,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:18:20,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:18:20,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:18:20,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:18:20,715 INFO L87 Difference]: Start difference. First operand 462 states and 1383 transitions. Second operand 6 states. [2020-10-22 02:18:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:18:20,973 INFO L93 Difference]: Finished difference Result 594 states and 1792 transitions. [2020-10-22 02:18:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:18:20,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-22 02:18:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:18:20,978 INFO L225 Difference]: With dead ends: 594 [2020-10-22 02:18:20,979 INFO L226 Difference]: Without dead ends: 594 [2020-10-22 02:18:20,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:18:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-10-22 02:18:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 478. [2020-10-22 02:18:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2020-10-22 02:18:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1435 transitions. [2020-10-22 02:18:20,995 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1435 transitions. Word has length 11 [2020-10-22 02:18:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:18:20,996 INFO L481 AbstractCegarLoop]: Abstraction has 478 states and 1435 transitions. [2020-10-22 02:18:20,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:18:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1435 transitions. [2020-10-22 02:18:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:18:20,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:18:20,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:18:20,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:18:20,998 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:18:20,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:18:20,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1936331113, now seen corresponding path program 3 times [2020-10-22 02:18:21,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:18:21,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234897348] [2020-10-22 02:18:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:18:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:18:21,245 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 02:18:21,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234897348] [2020-10-22 02:18:21,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:18:21,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:18:21,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [992181191] [2020-10-22 02:18:21,247 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:18:21,249 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:18:21,251 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 13 transitions. [2020-10-22 02:18:21,251 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:18:21,275 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 2, 1] term [2020-10-22 02:18:21,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,276 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-22 02:18:21,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,278 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 3, 2, 1] term [2020-10-22 02:18:21,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,279 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 2, 1] term [2020-10-22 02:18:21,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,280 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 2, 1] term [2020-10-22 02:18:21,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,283 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,286 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,298 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:18:21,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,316 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:18:21,324 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,332 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:18:21,338 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:18:21,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:18:21,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,366 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:18:21,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,379 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:18:21,385 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,395 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:18:21,401 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:18:21,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:18:21,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:21,428 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,443 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:18:21,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:18:21,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,451 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:18:21,457 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-22 02:18:21,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,459 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:18:21,464 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,470 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:18:21,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,478 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,478 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,481 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,486 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,493 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,493 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,497 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,504 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:18:21,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:18:21,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:21,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:21,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:18:21,529 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:18:21,571 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6866#(and (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) 1) (= (mod ~x$w_buff0_used~0 256) 0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$w_buff1~0))] [2020-10-22 02:18:21,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:18:21,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:18:21,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:18:21,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:18:21,573 INFO L87 Difference]: Start difference. First operand 478 states and 1435 transitions. Second operand 8 states. [2020-10-22 02:18:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:18:21,793 INFO L93 Difference]: Finished difference Result 498 states and 1482 transitions. [2020-10-22 02:18:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:18:21,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-10-22 02:18:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:18:21,798 INFO L225 Difference]: With dead ends: 498 [2020-10-22 02:18:21,798 INFO L226 Difference]: Without dead ends: 498 [2020-10-22 02:18:21,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:18:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2020-10-22 02:18:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 398. [2020-10-22 02:18:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-22 02:18:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1175 transitions. [2020-10-22 02:18:21,811 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1175 transitions. Word has length 11 [2020-10-22 02:18:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:18:21,811 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1175 transitions. [2020-10-22 02:18:21,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:18:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1175 transitions. [2020-10-22 02:18:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:18:21,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:18:21,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:18:21,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:18:21,813 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:18:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:18:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1732231817, now seen corresponding path program 1 times [2020-10-22 02:18:21,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:18:21,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748604784] [2020-10-22 02:18:21,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:18:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:18:21,893 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 02:18:21,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748604784] [2020-10-22 02:18:21,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:18:21,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:18:21,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1928672507] [2020-10-22 02:18:21,894 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:18:21,896 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:18:21,900 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 18 transitions. [2020-10-22 02:18:21,900 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:18:21,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:21,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:18:21,977 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8167#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-22 02:18:21,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:18:21,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:18:21,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:18:21,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:18:21,978 INFO L87 Difference]: Start difference. First operand 398 states and 1175 transitions. Second operand 5 states. [2020-10-22 02:18:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:18:22,049 INFO L93 Difference]: Finished difference Result 283 states and 739 transitions. [2020-10-22 02:18:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:18:22,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-22 02:18:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:18:22,051 INFO L225 Difference]: With dead ends: 283 [2020-10-22 02:18:22,052 INFO L226 Difference]: Without dead ends: 183 [2020-10-22 02:18:22,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:18:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-10-22 02:18:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2020-10-22 02:18:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-22 02:18:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 416 transitions. [2020-10-22 02:18:22,057 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 416 transitions. Word has length 12 [2020-10-22 02:18:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:18:22,058 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 416 transitions. [2020-10-22 02:18:22,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:18:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 416 transitions. [2020-10-22 02:18:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 02:18:22,059 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:18:22,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:18:22,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:18:22,059 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:18:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:18:22,060 INFO L82 PathProgramCache]: Analyzing trace with hash -518995131, now seen corresponding path program 1 times [2020-10-22 02:18:22,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:18:22,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809585687] [2020-10-22 02:18:22,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:18:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:18:22,238 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 02:18:22,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809585687] [2020-10-22 02:18:22,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:18:22,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:18:22,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875654085] [2020-10-22 02:18:22,239 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:18:22,244 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:18:22,256 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 37 transitions. [2020-10-22 02:18:22,256 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:18:22,662 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:18:22,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:18:22,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:18:22,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:18:22,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:18:22,663 INFO L87 Difference]: Start difference. First operand 183 states and 416 transitions. Second operand 6 states. [2020-10-22 02:18:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:18:22,871 INFO L93 Difference]: Finished difference Result 336 states and 734 transitions. [2020-10-22 02:18:22,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:18:22,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-22 02:18:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:18:22,875 INFO L225 Difference]: With dead ends: 336 [2020-10-22 02:18:22,875 INFO L226 Difference]: Without dead ends: 247 [2020-10-22 02:18:22,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:18:22,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-10-22 02:18:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 209. [2020-10-22 02:18:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-22 02:18:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 458 transitions. [2020-10-22 02:18:22,886 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 458 transitions. Word has length 17 [2020-10-22 02:18:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:18:22,887 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 458 transitions. [2020-10-22 02:18:22,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:18:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 458 transitions. [2020-10-22 02:18:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 02:18:22,888 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:18:22,888 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:18:22,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:18:22,888 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:18:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:18:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash -97777393, now seen corresponding path program 2 times [2020-10-22 02:18:22,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:18:22,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914625055] [2020-10-22 02:18:22,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:18:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:18:23,059 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 02:18:23,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914625055] [2020-10-22 02:18:23,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:18:23,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:18:23,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1658789018] [2020-10-22 02:18:23,060 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:18:23,065 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:18:23,075 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 33 transitions. [2020-10-22 02:18:23,075 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:18:23,271 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9593#(and (= ~__unbuffered_p0_EAX~0 1) (<= ~__unbuffered_cnt~0 0))] [2020-10-22 02:18:23,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 02:18:23,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:18:23,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 02:18:23,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:18:23,273 INFO L87 Difference]: Start difference. First operand 209 states and 458 transitions. Second operand 9 states. [2020-10-22 02:18:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:18:23,586 INFO L93 Difference]: Finished difference Result 303 states and 670 transitions. [2020-10-22 02:18:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-22 02:18:23,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-10-22 02:18:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:18:23,589 INFO L225 Difference]: With dead ends: 303 [2020-10-22 02:18:23,589 INFO L226 Difference]: Without dead ends: 224 [2020-10-22 02:18:23,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-10-22 02:18:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-10-22 02:18:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2020-10-22 02:18:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-10-22 02:18:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 482 transitions. [2020-10-22 02:18:23,597 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 482 transitions. Word has length 17 [2020-10-22 02:18:23,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:18:23,597 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 482 transitions. [2020-10-22 02:18:23,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 02:18:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 482 transitions. [2020-10-22 02:18:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 02:18:23,598 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:18:23,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:18:23,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:18:23,599 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:18:23,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:18:23,599 INFO L82 PathProgramCache]: Analyzing trace with hash 267473541, now seen corresponding path program 3 times [2020-10-22 02:18:23,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:18:23,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097419057] [2020-10-22 02:18:23,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:18:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:18:23,810 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 02:18:23,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097419057] [2020-10-22 02:18:23,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:18:23,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:18:23,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [789795159] [2020-10-22 02:18:23,812 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:18:23,815 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:18:23,825 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 33 transitions. [2020-10-22 02:18:23,825 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:18:23,942 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10345#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:18:23,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:18:23,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:18:23,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:18:23,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:18:23,944 INFO L87 Difference]: Start difference. First operand 219 states and 482 transitions. Second operand 7 states. [2020-10-22 02:18:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:18:24,008 INFO L93 Difference]: Finished difference Result 201 states and 442 transitions. [2020-10-22 02:18:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:18:24,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-22 02:18:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:18:24,010 INFO L225 Difference]: With dead ends: 201 [2020-10-22 02:18:24,010 INFO L226 Difference]: Without dead ends: 175 [2020-10-22 02:18:24,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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 02:18:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-10-22 02:18:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2020-10-22 02:18:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-10-22 02:18:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 391 transitions. [2020-10-22 02:18:24,015 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 391 transitions. Word has length 17 [2020-10-22 02:18:24,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:18:24,015 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 391 transitions. [2020-10-22 02:18:24,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:18:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 391 transitions. [2020-10-22 02:18:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:18:24,016 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:18:24,016 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 02:18:24,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:18:24,017 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:18:24,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:18:24,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1398326151, now seen corresponding path program 1 times [2020-10-22 02:18:24,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:18:24,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757030691] [2020-10-22 02:18:24,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:18:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:18:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:18:24,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757030691] [2020-10-22 02:18:24,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:18:24,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:18:24,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [943027703] [2020-10-22 02:18:24,105 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:18:24,110 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:18:24,126 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 42 transitions. [2020-10-22 02:18:24,126 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:18:24,280 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:18:24,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:18:24,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:18:24,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:18:24,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:18:24,281 INFO L87 Difference]: Start difference. First operand 175 states and 391 transitions. Second operand 4 states. [2020-10-22 02:18:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:18:24,307 INFO L93 Difference]: Finished difference Result 227 states and 495 transitions. [2020-10-22 02:18:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:18:24,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-22 02:18:24,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:18:24,309 INFO L225 Difference]: With dead ends: 227 [2020-10-22 02:18:24,309 INFO L226 Difference]: Without dead ends: 103 [2020-10-22 02:18:24,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:18:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-22 02:18:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2020-10-22 02:18:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-22 02:18:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 200 transitions. [2020-10-22 02:18:24,313 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 200 transitions. Word has length 20 [2020-10-22 02:18:24,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:18:24,313 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 200 transitions. [2020-10-22 02:18:24,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:18:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 200 transitions. [2020-10-22 02:18:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:18:24,314 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:18:24,314 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 02:18:24,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:18:24,314 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:18:24,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:18:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1162494873, now seen corresponding path program 2 times [2020-10-22 02:18:24,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:18:24,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011052920] [2020-10-22 02:18:24,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:18:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:18:24,446 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 02:18:24,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011052920] [2020-10-22 02:18:24,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:18:24,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:18:24,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459357031] [2020-10-22 02:18:24,447 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:18:24,452 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:18:24,467 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 41 transitions. [2020-10-22 02:18:24,468 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:18:24,775 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:18:24,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:18:24,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:18:24,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:18:24,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:18:24,777 INFO L87 Difference]: Start difference. First operand 101 states and 200 transitions. Second operand 5 states. [2020-10-22 02:18:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:18:24,934 INFO L93 Difference]: Finished difference Result 121 states and 231 transitions. [2020-10-22 02:18:24,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:18:24,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-10-22 02:18:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:18:24,935 INFO L225 Difference]: With dead ends: 121 [2020-10-22 02:18:24,935 INFO L226 Difference]: Without dead ends: 107 [2020-10-22 02:18:24,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:18:24,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-22 02:18:24,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2020-10-22 02:18:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-22 02:18:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 193 transitions. [2020-10-22 02:18:24,939 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 193 transitions. Word has length 20 [2020-10-22 02:18:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:18:24,940 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 193 transitions. [2020-10-22 02:18:24,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:18:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 193 transitions. [2020-10-22 02:18:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:18:24,941 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:18:24,941 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 02:18:24,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:18:24,941 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:18:24,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:18:24,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1527745807, now seen corresponding path program 3 times [2020-10-22 02:18:24,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:18:24,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557804193] [2020-10-22 02:18:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:18:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:18:25,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:18:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:18:25,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:18:25,260 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:18:25,260 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:18:25,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 02:18:25,262 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:18:25,285 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1694] [1694] L4-->L870: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In954048872 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In954048872 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In954048872 256) 0)) (.cse10 (= (mod ~x$r_buff1_thd0~0_In954048872 256) 0))) (let ((.cse0 (or .cse9 .cse10)) (.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse3 (or .cse7 .cse8)) (.cse5 (not .cse8)) (.cse6 (not .cse7))) (and (or (and (= ~x$w_buff1_used~0_In954048872 ~x$w_buff1_used~0_Out954048872) .cse0) (and .cse1 (= ~x$w_buff1_used~0_Out954048872 0) .cse2)) (= ~x$r_buff1_thd0~0_Out954048872 ~x$r_buff1_thd0~0_In954048872) (= ~x$r_buff0_thd0~0_Out954048872 ~x$r_buff0_thd0~0_In954048872) (let ((.cse4 (select |#memory_int_In954048872| |~#x~0.base_In954048872|))) (or (and .cse3 (or (and (= (store |#memory_int_In954048872| |~#x~0.base_In954048872| (store .cse4 |~#x~0.offset_In954048872| (select .cse4 |~#x~0.offset_In954048872|))) |#memory_int_Out954048872|) .cse0) (and (= (store |#memory_int_In954048872| |~#x~0.base_In954048872| (store .cse4 |~#x~0.offset_In954048872| ~x$w_buff1~0_In954048872)) |#memory_int_Out954048872|) .cse1 .cse2))) (and (= (store |#memory_int_In954048872| |~#x~0.base_In954048872| (store .cse4 |~#x~0.offset_In954048872| ~x$w_buff0~0_In954048872)) |#memory_int_Out954048872|) .cse5 .cse6))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In954048872 0)) (or (and (= ~x$w_buff0_used~0_In954048872 ~x$w_buff0_used~0_Out954048872) .cse3) (and .cse5 (= ~x$w_buff0_used~0_Out954048872 0) .cse6))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In954048872, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In954048872, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In954048872, ~#x~0.offset=|~#x~0.offset_In954048872|, ~x$w_buff1~0=~x$w_buff1~0_In954048872, #memory_int=|#memory_int_In954048872|, ~#x~0.base=|~#x~0.base_In954048872|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In954048872, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In954048872, ~x$w_buff0_used~0=~x$w_buff0_used~0_In954048872} OutVars{~x$w_buff0~0=~x$w_buff0~0_In954048872, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out954048872, ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out954048872|, ~#x~0.offset=|~#x~0.offset_In954048872|, ~x$w_buff1~0=~x$w_buff1~0_In954048872, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out954048872, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out954048872|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out954048872, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out954048872|, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out954048872|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out954048872, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out954048872|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In954048872, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out954048872|, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out954048872|, #memory_int=|#memory_int_Out954048872|, ~#x~0.base=|~#x~0.base_In954048872|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite82, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, #memory_int, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite79, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-22 02:18:25,301 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 02:18:25,301 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,301 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 02:18:25,301 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,302 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 02:18:25,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,302 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 02:18:25,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,302 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 02:18:25,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,303 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 02:18:25,303 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,303 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 02:18:25,303 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,304 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 02:18:25,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,304 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 02:18:25,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,304 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 02:18:25,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,304 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 02:18:25,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,305 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 02:18:25,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,305 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 02:18:25,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,306 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 02:18:25,306 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,306 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 02:18:25,306 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,310 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 02:18:25,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,311 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 02:18:25,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,312 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 02:18:25,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,312 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 02:18:25,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,312 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 02:18:25,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,313 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 02:18:25,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,313 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 02:18:25,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,313 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 02:18:25,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,313 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 02:18:25,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,314 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 02:18:25,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,314 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 02:18:25,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,314 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 02:18:25,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,315 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 02:18:25,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,315 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 02:18:25,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,315 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 02:18:25,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,316 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 02:18:25,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,316 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 02:18:25,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,317 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 02:18:25,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,317 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 02:18:25,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,317 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 02:18:25,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,318 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 02:18:25,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,318 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 02:18:25,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,318 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 02:18:25,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,318 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 02:18:25,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,319 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 02:18:25,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,319 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 02:18:25,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,319 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 02:18:25,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,320 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 02:18:25,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,320 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 02:18:25,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,320 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 02:18:25,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,320 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 02:18:25,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,321 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 02:18:25,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,321 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 02:18:25,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,321 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 02:18:25,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:18:25,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:18:25 BasicIcfg [2020-10-22 02:18:25,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:18:25,442 INFO L168 Benchmark]: Toolchain (without parser) took 29550.93 ms. Allocated memory was 140.5 MB in the beginning and 526.4 MB in the end (delta: 385.9 MB). Free memory was 101.4 MB in the beginning and 373.5 MB in the end (delta: -272.1 MB). Peak memory consumption was 113.8 MB. Max. memory is 7.1 GB. [2020-10-22 02:18:25,443 INFO L168 Benchmark]: CDTParser took 2.92 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-22 02:18:25,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.28 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 100.6 MB in the beginning and 151.4 MB in the end (delta: -50.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2020-10-22 02:18:25,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.38 ms. Allocated memory is still 203.9 MB. Free memory was 151.4 MB in the beginning and 148.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-22 02:18:25,447 INFO L168 Benchmark]: Boogie Preprocessor took 49.57 ms. Allocated memory is still 203.9 MB. Free memory was 148.7 MB in the beginning and 145.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-22 02:18:25,448 INFO L168 Benchmark]: RCFGBuilder took 3600.40 ms. Allocated memory was 203.9 MB in the beginning and 296.7 MB in the end (delta: 92.8 MB). Free memory was 145.2 MB in the beginning and 226.1 MB in the end (delta: -80.9 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. [2020-10-22 02:18:25,449 INFO L168 Benchmark]: TraceAbstraction took 25076.40 ms. Allocated memory was 296.7 MB in the beginning and 526.4 MB in the end (delta: 229.6 MB). Free memory was 226.1 MB in the beginning and 373.5 MB in the end (delta: -147.4 MB). Peak memory consumption was 82.2 MB. Max. memory is 7.1 GB. [2020-10-22 02:18:25,454 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.92 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.28 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 100.6 MB in the beginning and 151.4 MB in the end (delta: -50.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.38 ms. Allocated memory is still 203.9 MB. Free memory was 151.4 MB in the beginning and 148.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.57 ms. Allocated memory is still 203.9 MB. Free memory was 148.7 MB in the beginning and 145.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3600.40 ms. Allocated memory was 203.9 MB in the beginning and 296.7 MB in the end (delta: 92.8 MB). Free memory was 145.2 MB in the beginning and 226.1 MB in the end (delta: -80.9 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25076.40 ms. Allocated memory was 296.7 MB in the beginning and 526.4 MB in the end (delta: 229.6 MB). Free memory was 226.1 MB in the beginning and 373.5 MB in the end (delta: -147.4 MB). Peak memory consumption was 82.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 896 VarBasedMoverChecksPositive, 41 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 64 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 17.4s, 125 PlacesBefore, 34 PlacesAfterwards, 118 TransitionsBefore, 24 TransitionsAfterwards, 1658 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 107 TotalNumberOfCompositions, 4691 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2381; [L855] FCALL, FORK 0 pthread_create(&t2381, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L856] 0 pthread_t t2382; [L857] FCALL, FORK 0 pthread_create(&t2382, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L858] 0 pthread_t t2383; [L859] FCALL, FORK 0 pthread_create(&t2383, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1 [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L816] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L816] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0) [L816] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L817] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L817] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1) [L817] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L818] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L818] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used) [L818] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L819] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L821] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L829] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=4, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L833] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L836] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L774] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L776] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=2, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=2, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] 2 x = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=2, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 x$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(x) [L875] 0 x$mem_tmp = x [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 \read(x) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L877] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L877] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L877] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L878] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L878] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L879] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L879] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L879] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L879] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L881] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L881] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L881] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L884] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L884] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L885] EXPR 0 \read(x) [L885] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L886] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L886] EXPR 0 \read(x) [L886] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L886] 0 x = x$flush_delayed ? x$mem_tmp : x [L887] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe025_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=3, weak$$choice1=1, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.5s, HoareTripleCheckerStatistics: 240 SDtfs, 283 SDslu, 453 SDs, 0 SdLazy, 461 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 305 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 20831 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...