/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-98196c323137eee61a7c1131837b356358d783d4-98196c3 [2021-06-16 15:49:56,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-16 15:49:56,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-16 15:49:56,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-16 15:49:56,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-16 15:49:56,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-16 15:49:56,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-16 15:49:56,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-16 15:49:56,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-16 15:49:56,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-16 15:49:56,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-16 15:49:56,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-16 15:49:56,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-16 15:49:56,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-16 15:49:56,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-16 15:49:56,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-16 15:49:56,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-16 15:49:56,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-16 15:49:56,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-16 15:49:56,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-16 15:49:56,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-16 15:49:56,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-16 15:49:56,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-16 15:49:56,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-16 15:49:56,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-16 15:49:56,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-16 15:49:56,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-16 15:49:56,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-16 15:49:56,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-16 15:49:56,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-16 15:49:56,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-16 15:49:56,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-16 15:49:56,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-16 15:49:56,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-16 15:49:56,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-16 15:49:56,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-16 15:49:56,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-16 15:49:56,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-16 15:49:56,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-16 15:49:56,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-16 15:49:56,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-16 15:49:56,760 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf [2021-06-16 15:49:56,788 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-16 15:49:56,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-16 15:49:56,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-16 15:49:56,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-16 15:49:56,791 INFO L138 SettingsManager]: * Use SBE=true [2021-06-16 15:49:56,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-16 15:49:56,792 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-16 15:49:56,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-16 15:49:56,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-16 15:49:56,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-16 15:49:56,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-16 15:49:56,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-16 15:49:56,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-16 15:49:56,793 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-16 15:49:56,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-16 15:49:56,794 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-16 15:49:56,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-16 15:49:56,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-16 15:49:56,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-16 15:49:56,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-16 15:49:56,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-16 15:49:56,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-16 15:49:56,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-16 15:49:56,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-16 15:49:56,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-16 15:49:56,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-16 15:49:56,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-16 15:49:56,796 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-16 15:49:56,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-16 15:49:56,796 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-06-16 15:49:56,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-16 15:49:57,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-16 15:49:57,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-16 15:49:57,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-16 15:49:57,116 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-16 15:49:57,117 INFO L275 PluginConnector]: CDTParser initialized [2021-06-16 15:49:57,117 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2021-06-16 15:49:57,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fafe4a54/6102e58b9e7d409c809fceb39477d6e2/FLAGbb109ad0f [2021-06-16 15:49:57,766 INFO L306 CDTParser]: Found 1 translation units. [2021-06-16 15:49:57,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2021-06-16 15:49:57,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fafe4a54/6102e58b9e7d409c809fceb39477d6e2/FLAGbb109ad0f [2021-06-16 15:49:58,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fafe4a54/6102e58b9e7d409c809fceb39477d6e2 [2021-06-16 15:49:58,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-16 15:49:58,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-16 15:49:58,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-16 15:49:58,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-16 15:49:58,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-16 15:49:58,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.06 03:49:58" (1/1) ... [2021-06-16 15:49:58,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ecc4de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58, skipping insertion in model container [2021-06-16 15:49:58,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.06 03:49:58" (1/1) ... [2021-06-16 15:49:58,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-16 15:49:58,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-16 15:49:58,427 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i[949,962] [2021-06-16 15:49:58,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-16 15:49:58,637 INFO L203 MainTranslator]: Completed pre-run [2021-06-16 15:49:58,652 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i[949,962] [2021-06-16 15:49:58,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-16 15:49:58,782 INFO L208 MainTranslator]: Completed translation [2021-06-16 15:49:58,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58 WrapperNode [2021-06-16 15:49:58,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-16 15:49:58,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-16 15:49:58,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-16 15:49:58,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-16 15:49:58,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58" (1/1) ... [2021-06-16 15:49:58,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58" (1/1) ... [2021-06-16 15:49:58,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-16 15:49:58,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-16 15:49:58,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-16 15:49:58,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-16 15:49:58,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58" (1/1) ... [2021-06-16 15:49:58,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58" (1/1) ... [2021-06-16 15:49:58,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58" (1/1) ... [2021-06-16 15:49:58,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58" (1/1) ... [2021-06-16 15:49:58,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58" (1/1) ... [2021-06-16 15:49:58,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58" (1/1) ... [2021-06-16 15:49:58,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58" (1/1) ... [2021-06-16 15:49:58,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-16 15:49:58,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-16 15:49:58,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-16 15:49:58,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-16 15:49:58,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58" (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 [2021-06-16 15:49:59,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-16 15:49:59,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-16 15:49:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-16 15:49:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-16 15:49:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-16 15:49:59,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-16 15:49:59,005 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-16 15:49:59,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-16 15:49:59,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-16 15:49:59,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-16 15:49:59,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-16 15:49:59,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-16 15:49:59,008 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-16 15:50:00,569 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-16 15:50:00,570 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-16 15:50:00,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 03:50:00 BoogieIcfgContainer [2021-06-16 15:50:00,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-16 15:50:00,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-16 15:50:00,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-16 15:50:00,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-16 15:50:00,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.06 03:49:58" (1/3) ... [2021-06-16 15:50:00,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b98f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 03:50:00, skipping insertion in model container [2021-06-16 15:50:00,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:49:58" (2/3) ... [2021-06-16 15:50:00,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b98f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 03:50:00, skipping insertion in model container [2021-06-16 15:50:00,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 03:50:00" (3/3) ... [2021-06-16 15:50:00,600 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2021-06-16 15:50:00,606 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-16 15:50:00,606 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-16 15:50:00,606 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-16 15:50:00,607 INFO L470 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-16 15:50:00,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,640 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,640 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,641 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,641 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,646 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,646 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,646 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,647 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,647 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,648 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,648 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,648 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,654 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,654 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,654 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,660 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,660 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:00,661 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-16 15:50:00,679 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-16 15:50:00,703 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:50:00,703 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:50:00,703 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:50:00,703 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:50:00,703 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:50:00,704 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:50:00,704 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:50:00,705 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1======== [2021-06-16 15:50:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 1891 states, 1649 states have (on average 2.0879320800485144) internal successors, (3443), 1890 states have internal predecessors, (3443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:01,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-16 15:50:01,332 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3) [2021-06-16 15:50:01,334 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-16 15:50:01,335 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:50:01,335 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:50:01,335 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:50:01,335 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:50:01,336 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:50:01,336 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:50:01,336 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:50:01,336 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork0======== [2021-06-16 15:50:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 1891 states, 1649 states have (on average 2.0879320800485144) internal successors, (3443), 1890 states have internal predecessors, (3443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-06-16 15:50:01,769 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:01,769 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:50:01,770 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:01,774 INFO L82 PathProgramCache]: Analyzing trace with hash 100820283, now seen corresponding path program 1 times [2021-06-16 15:50:01,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:01,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828769792] [2021-06-16 15:50:01,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:01,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:01,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:01,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:01,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:02,001 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:02,001 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828769792] [2021-06-16 15:50:02,002 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828769792] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:02,002 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:02,002 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-16 15:50:02,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925878787] [2021-06-16 15:50:02,005 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 15:50:02,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:02,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 15:50:02,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 15:50:02,021 INFO L87 Difference]: Start difference. First operand has 1891 states, 1649 states have (on average 2.0879320800485144) internal successors, (3443), 1890 states have internal predecessors, (3443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:02,097 INFO L93 Difference]: Finished difference Result 1627 states and 2784 transitions. [2021-06-16 15:50:02,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 15:50:02,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-06-16 15:50:02,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:02,104 INFO L225 Difference]: With dead ends: 1627 [2021-06-16 15:50:02,105 INFO L226 Difference]: Without dead ends: 0 [2021-06-16 15:50:02,106 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 15:50:02,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-16 15:50:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-16 15:50:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-16 15:50:02,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2021-06-16 15:50:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:02,126 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-16 15:50:02,126 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-16 15:50:02,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-16 15:50:02,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-16 15:50:02,127 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (2/3) [2021-06-16 15:50:02,129 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-16 15:50:02,133 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:50:02,133 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:50:02,133 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:50:02,133 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:50:02,133 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:50:02,133 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:50:02,133 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:50:02,134 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-16 15:50:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 1891 states, 1649 states have (on average 2.0879320800485144) internal successors, (3443), 1890 states have internal predecessors, (3443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-06-16 15:50:02,595 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:02,595 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:50:02,596 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:02,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash 453548779, now seen corresponding path program 1 times [2021-06-16 15:50:02,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:02,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937991954] [2021-06-16 15:50:02,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:02,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:02,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:02,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:02,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:02,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:02,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:02,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:02,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:50:02,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:02,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-16 15:50:02,846 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-06-16 15:50:02,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-16 15:50:02,866 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:50:02,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:50:02,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:02,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:02,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:02,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:02,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:02,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:02,912 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:02,912 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937991954] [2021-06-16 15:50:02,912 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937991954] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:02,913 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:02,913 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-16 15:50:02,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172085886] [2021-06-16 15:50:02,914 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-16 15:50:02,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:02,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-16 15:50:02,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-16 15:50:02,920 INFO L87 Difference]: Start difference. First operand has 1891 states, 1649 states have (on average 2.0879320800485144) internal successors, (3443), 1890 states have internal predecessors, (3443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:03,270 INFO L93 Difference]: Finished difference Result 2407 states and 4347 transitions. [2021-06-16 15:50:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-16 15:50:03,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-06-16 15:50:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:03,287 INFO L225 Difference]: With dead ends: 2407 [2021-06-16 15:50:03,287 INFO L226 Difference]: Without dead ends: 688 [2021-06-16 15:50:03,291 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 238.5ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-06-16 15:50:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-06-16 15:50:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2021-06-16 15:50:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 679 states have (on average 1.8836524300441826) internal successors, (1279), 687 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1279 transitions. [2021-06-16 15:50:03,357 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1279 transitions. Word has length 56 [2021-06-16 15:50:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:03,358 INFO L482 AbstractCegarLoop]: Abstraction has 688 states and 1279 transitions. [2021-06-16 15:50:03,358 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1279 transitions. [2021-06-16 15:50:03,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-16 15:50:03,363 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:03,363 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:50:03,363 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-16 15:50:03,363 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash -251345340, now seen corresponding path program 1 times [2021-06-16 15:50:03,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:03,367 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942605640] [2021-06-16 15:50:03,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:03,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:03,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:03,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:03,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:03,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:03,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:03,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:03,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:50:03,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:03,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-16 15:50:03,611 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-06-16 15:50:03,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-16 15:50:03,628 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:50:03,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:50:03,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:03,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:03,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:03,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:03,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:03,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:03,678 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:03,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942605640] [2021-06-16 15:50:03,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942605640] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:03,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:03,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-16 15:50:03,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204969496] [2021-06-16 15:50:03,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-16 15:50:03,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:03,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-16 15:50:03,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-16 15:50:03,681 INFO L87 Difference]: Start difference. First operand 688 states and 1279 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:04,040 INFO L93 Difference]: Finished difference Result 741 states and 1374 transitions. [2021-06-16 15:50:04,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-16 15:50:04,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-06-16 15:50:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:04,044 INFO L225 Difference]: With dead ends: 741 [2021-06-16 15:50:04,044 INFO L226 Difference]: Without dead ends: 621 [2021-06-16 15:50:04,045 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 273.0ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-06-16 15:50:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-06-16 15:50:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2021-06-16 15:50:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 613 states have (on average 1.8238172920065252) internal successors, (1118), 620 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1118 transitions. [2021-06-16 15:50:04,058 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1118 transitions. Word has length 59 [2021-06-16 15:50:04,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:04,058 INFO L482 AbstractCegarLoop]: Abstraction has 621 states and 1118 transitions. [2021-06-16 15:50:04,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:04,058 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1118 transitions. [2021-06-16 15:50:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-16 15:50:04,060 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:04,060 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:50:04,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-16 15:50:04,060 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:04,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:04,060 INFO L82 PathProgramCache]: Analyzing trace with hash -824493783, now seen corresponding path program 1 times [2021-06-16 15:50:04,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:04,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036666995] [2021-06-16 15:50:04,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:04,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:04,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:04,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:04,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:50:04,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-16 15:50:04,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-16 15:50:04,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:50:04,238 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-16 15:50:04,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-16 15:50:04,248 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:50:04,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:50:04,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:04,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:04,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:04,303 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:04,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036666995] [2021-06-16 15:50:04,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036666995] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:04,304 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:04,304 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-16 15:50:04,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303104722] [2021-06-16 15:50:04,304 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-16 15:50:04,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:04,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-16 15:50:04,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:50:04,305 INFO L87 Difference]: Start difference. First operand 621 states and 1118 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:04,656 INFO L93 Difference]: Finished difference Result 797 states and 1512 transitions. [2021-06-16 15:50:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-16 15:50:04,657 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-16 15:50:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:04,660 INFO L225 Difference]: With dead ends: 797 [2021-06-16 15:50:04,661 INFO L226 Difference]: Without dead ends: 645 [2021-06-16 15:50:04,661 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 269.0ms TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2021-06-16 15:50:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2021-06-16 15:50:04,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 609. [2021-06-16 15:50:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.821963394342762) internal successors, (1095), 608 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1095 transitions. [2021-06-16 15:50:04,676 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1095 transitions. Word has length 60 [2021-06-16 15:50:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:04,677 INFO L482 AbstractCegarLoop]: Abstraction has 609 states and 1095 transitions. [2021-06-16 15:50:04,677 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1095 transitions. [2021-06-16 15:50:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-16 15:50:04,678 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:04,679 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:50:04,679 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-16 15:50:04,679 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1402904626, now seen corresponding path program 1 times [2021-06-16 15:50:04,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:04,680 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690782915] [2021-06-16 15:50:04,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:04,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:04,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:04,831 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:50:04,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:50:04,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:04,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:04,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:04,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:04,870 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:04,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690782915] [2021-06-16 15:50:04,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690782915] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:04,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:04,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:50:04,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484824219] [2021-06-16 15:50:04,871 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:50:04,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:04,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:50:04,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:50:04,872 INFO L87 Difference]: Start difference. First operand 609 states and 1095 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:04,990 INFO L93 Difference]: Finished difference Result 929 states and 1752 transitions. [2021-06-16 15:50:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:50:04,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-16 15:50:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:04,993 INFO L225 Difference]: With dead ends: 929 [2021-06-16 15:50:04,993 INFO L226 Difference]: Without dead ends: 481 [2021-06-16 15:50:04,993 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 99.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:50:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-06-16 15:50:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 401. [2021-06-16 15:50:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 395 states have (on average 1.8025316455696203) internal successors, (712), 400 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 712 transitions. [2021-06-16 15:50:05,005 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 712 transitions. Word has length 60 [2021-06-16 15:50:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:05,005 INFO L482 AbstractCegarLoop]: Abstraction has 401 states and 712 transitions. [2021-06-16 15:50:05,005 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 712 transitions. [2021-06-16 15:50:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-16 15:50:05,006 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:05,007 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:50:05,007 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-16 15:50:05,007 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:05,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:05,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1155822473, now seen corresponding path program 1 times [2021-06-16 15:50:05,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:05,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543646243] [2021-06-16 15:50:05,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:05,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:05,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:05,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:05,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:05,076 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-16 15:50:05,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-16 15:50:05,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:05,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:05,102 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-16 15:50:05,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:05,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:05,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:05,113 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:05,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543646243] [2021-06-16 15:50:05,113 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543646243] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:05,113 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:05,113 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:50:05,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824472457] [2021-06-16 15:50:05,114 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:50:05,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:05,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:50:05,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:50:05,115 INFO L87 Difference]: Start difference. First operand 401 states and 712 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:05,211 INFO L93 Difference]: Finished difference Result 391 states and 638 transitions. [2021-06-16 15:50:05,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:50:05,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-16 15:50:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:05,213 INFO L225 Difference]: With dead ends: 391 [2021-06-16 15:50:05,213 INFO L226 Difference]: Without dead ends: 268 [2021-06-16 15:50:05,213 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 92.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:50:05,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-06-16 15:50:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2021-06-16 15:50:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 262 states have (on average 1.7290076335877862) internal successors, (453), 267 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 453 transitions. [2021-06-16 15:50:05,220 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 453 transitions. Word has length 62 [2021-06-16 15:50:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:05,220 INFO L482 AbstractCegarLoop]: Abstraction has 268 states and 453 transitions. [2021-06-16 15:50:05,220 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 453 transitions. [2021-06-16 15:50:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-16 15:50:05,221 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:05,221 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:50:05,221 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-16 15:50:05,221 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:05,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:05,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1820444031, now seen corresponding path program 1 times [2021-06-16 15:50:05,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:05,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129335909] [2021-06-16 15:50:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:05,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:05,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:05,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:05,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:05,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:05,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:05,288 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-16 15:50:05,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-16 15:50:05,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:05,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:05,311 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-16 15:50:05,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:05,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:05,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:05,322 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:05,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129335909] [2021-06-16 15:50:05,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129335909] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:05,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:05,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-16 15:50:05,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506460297] [2021-06-16 15:50:05,323 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-16 15:50:05,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:05,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-16 15:50:05,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-16 15:50:05,323 INFO L87 Difference]: Start difference. First operand 268 states and 453 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:05,424 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2021-06-16 15:50:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-16 15:50:05,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-16 15:50:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:05,426 INFO L225 Difference]: With dead ends: 176 [2021-06-16 15:50:05,426 INFO L226 Difference]: Without dead ends: 107 [2021-06-16 15:50:05,427 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 98.1ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-16 15:50:05,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-06-16 15:50:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2021-06-16 15:50:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 105 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2021-06-16 15:50:05,429 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 63 [2021-06-16 15:50:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:05,430 INFO L482 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2021-06-16 15:50:05,430 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:50:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2021-06-16 15:50:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-16 15:50:05,430 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:05,430 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:50:05,431 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-16 15:50:05,431 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:05,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2055551632, now seen corresponding path program 1 times [2021-06-16 15:50:05,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:05,431 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177223532] [2021-06-16 15:50:05,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 15:50:05,462 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 15:50:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 15:50:05,507 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 15:50:05,537 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-16 15:50:05,538 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-16 15:50:05,538 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-16 15:50:05,538 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-16 15:50:05,539 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-16 15:50:05,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.06 03:50:05 BasicIcfg [2021-06-16 15:50:05,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-16 15:50:05,613 INFO L168 Benchmark]: Toolchain (without parser) took 7455.45 ms. Allocated memory was 202.4 MB in the beginning and 338.7 MB in the end (delta: 136.3 MB). Free memory was 164.9 MB in the beginning and 129.3 MB in the end (delta: 35.6 MB). Peak memory consumption was 173.5 MB. Max. memory is 8.0 GB. [2021-06-16 15:50:05,613 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 202.4 MB. Free memory is still 183.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-16 15:50:05,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.23 ms. Allocated memory is still 202.4 MB. Free memory was 164.7 MB in the beginning and 161.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-06-16 15:50:05,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.80 ms. Allocated memory is still 202.4 MB. Free memory was 161.2 MB in the beginning and 158.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-16 15:50:05,614 INFO L168 Benchmark]: Boogie Preprocessor took 53.49 ms. Allocated memory is still 202.4 MB. Free memory was 158.6 MB in the beginning and 156.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-16 15:50:05,614 INFO L168 Benchmark]: RCFGBuilder took 1656.96 ms. Allocated memory is still 202.4 MB. Free memory was 156.5 MB in the beginning and 71.4 MB in the end (delta: 85.1 MB). Peak memory consumption was 91.4 MB. Max. memory is 8.0 GB. [2021-06-16 15:50:05,614 INFO L168 Benchmark]: TraceAbstraction took 5038.01 ms. Allocated memory was 202.4 MB in the beginning and 338.7 MB in the end (delta: 136.3 MB). Free memory was 70.9 MB in the beginning and 129.3 MB in the end (delta: -58.5 MB). Peak memory consumption was 78.4 MB. Max. memory is 8.0 GB. [2021-06-16 15:50:05,616 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 202.4 MB. Free memory is still 183.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 626.23 ms. Allocated memory is still 202.4 MB. Free memory was 164.7 MB in the beginning and 161.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 75.80 ms. Allocated memory is still 202.4 MB. Free memory was 161.2 MB in the beginning and 158.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 53.49 ms. Allocated memory is still 202.4 MB. Free memory was 158.6 MB in the beginning and 156.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1656.96 ms. Allocated memory is still 202.4 MB. Free memory was 156.5 MB in the beginning and 71.4 MB in the end (delta: 85.1 MB). Peak memory consumption was 91.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5038.01 ms. Allocated memory was 202.4 MB in the beginning and 338.7 MB in the end (delta: 136.3 MB). Free memory was 70.9 MB in the beginning and 129.3 MB in the end (delta: -58.5 MB). Peak memory consumption was 78.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4425, positive: 3884, positive conditional: 3884, positive unconditional: 0, negative: 541, negative conditional: 541, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4109, positive: 3884, positive conditional: 0, positive unconditional: 3884, negative: 225, negative conditional: 0, negative unconditional: 225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 568, positive: 543, positive conditional: 0, positive unconditional: 543, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 568, positive: 542, positive conditional: 0, positive unconditional: 542, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 381, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 380, negative conditional: 0, negative unconditional: 380, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4109, positive: 3341, positive conditional: 0, positive unconditional: 3341, negative: 200, negative conditional: 0, negative unconditional: 200, unknown: 568, unknown conditional: 0, unknown unconditional: 568] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 543, Positive conditional cache size: 0, Positive unconditional cache size: 543, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Independence queries for same thread: 316 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4425, positive: 3884, positive conditional: 3884, positive unconditional: 0, negative: 541, negative conditional: 541, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4109, positive: 3884, positive conditional: 0, positive unconditional: 3884, negative: 225, negative conditional: 0, negative unconditional: 225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 568, positive: 543, positive conditional: 0, positive unconditional: 543, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 568, positive: 542, positive conditional: 0, positive unconditional: 542, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 336, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 334, negative conditional: 0, negative unconditional: 334, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4109, positive: 3341, positive conditional: 0, positive unconditional: 3341, negative: 200, negative conditional: 0, negative unconditional: 200, unknown: 568, unknown conditional: 0, unknown unconditional: 568] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 543, Positive conditional cache size: 0, Positive unconditional cache size: 543, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Independence queries for same thread: 316 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4425, positive: 3884, positive conditional: 3884, positive unconditional: 0, negative: 541, negative conditional: 541, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4109, positive: 3884, positive conditional: 0, positive unconditional: 3884, negative: 225, negative conditional: 0, negative unconditional: 225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 568, positive: 543, positive conditional: 0, positive unconditional: 543, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 568, positive: 542, positive conditional: 0, positive unconditional: 542, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 326, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 325, negative conditional: 0, negative unconditional: 325, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4109, positive: 3341, positive conditional: 0, positive unconditional: 3341, negative: 200, negative conditional: 0, negative unconditional: 200, unknown: 568, unknown conditional: 0, unknown unconditional: 568] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 543, Positive conditional cache size: 0, Positive unconditional cache size: 543, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Independence queries for same thread: 316 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] 0 pthread_t t2479; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2480; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 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) [L768] 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) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 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 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 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 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 631.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 24.8ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 602.1ms, PartialOrderReductionTime: 589.3ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1891occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 791.8ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 5.2ms, AutomataDifference: 100.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 427.6ms, PartialOrderReductionTime: 426.1ms, HoareTripleCheckerStatistics: 75 SDtfs, 27 SDslu, 50 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1891occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 9.1ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 6.2ms SsaConstructionTime, 36.5ms SatisfiabilityAnalysisTime, 114.3ms InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 85 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3405.4ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 14.6ms, AutomataDifference: 1417.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 455.9ms, PartialOrderReductionTime: 451.4ms, HoareTripleCheckerStatistics: 570 SDtfs, 1126 SDslu, 1970 SDs, 0 SdLazy, 374 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 472.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1071.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1891occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 113.3ms AutomataMinimizationTime, 6 MinimizatonAttempts, 117 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 33.5ms SsaConstructionTime, 312.4ms SatisfiabilityAnalysisTime, 866.5ms InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 1877 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...