/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:52:13,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:52:13,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:52:13,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:52:13,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:52:13,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:52:13,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:52:13,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:52:13,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:52:13,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:52:13,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:52:13,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:52:13,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:52:13,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:52:13,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:52:13,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:52:13,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:52:13,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:52:13,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:52:13,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:52:13,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:52:13,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:52:13,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:52:13,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:52:13,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:52:13,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:52:13,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:52:13,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:52:13,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:52:13,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:52:13,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:52:13,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:52:13,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:52:13,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:52:13,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:52:13,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:52:13,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:52:13,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:52:13,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:52:13,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:52:13,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:52:13,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 17:52:13,756 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:52:13,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:52:13,757 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:52:13,757 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:52:13,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:52:13,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:52:13,758 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:52:13,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:52:13,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:52:13,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:52:13,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:52:13,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:52:13,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:52:13,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:52:13,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:52:13,758 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:52:13,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:52:13,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:52:13,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:52:13,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:52:13,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:52:13,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:52:13,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:52:13,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:52:13,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:52:13,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:52:13,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:52:13,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:52:13,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:52:13,760 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:52:13,760 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:52:13,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:52:13,760 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2022-03-15 17:52:14,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:52:14,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:52:14,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:52:14,059 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:52:14,060 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:52:14,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2022-03-15 17:52:14,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaf44a967/f1c3fde57b144474bb4a5b676d981a9c/FLAGc13bd132e [2022-03-15 17:52:14,558 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:52:14,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2022-03-15 17:52:14,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaf44a967/f1c3fde57b144474bb4a5b676d981a9c/FLAGc13bd132e [2022-03-15 17:52:14,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaf44a967/f1c3fde57b144474bb4a5b676d981a9c [2022-03-15 17:52:14,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:52:14,582 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:52:14,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:52:14,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:52:14,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:52:14,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:52:14" (1/1) ... [2022-03-15 17:52:14,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac4f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:14, skipping insertion in model container [2022-03-15 17:52:14,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:52:14" (1/1) ... [2022-03-15 17:52:14,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:52:14,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:52:14,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i[949,962] [2022-03-15 17:52:14,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:52:14,998 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:52:15,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i[949,962] [2022-03-15 17:52:15,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:52:15,100 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:52:15,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:15 WrapperNode [2022-03-15 17:52:15,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:52:15,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:52:15,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:52:15,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:52:15,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:15" (1/1) ... [2022-03-15 17:52:15,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:15" (1/1) ... [2022-03-15 17:52:15,177 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 293 [2022-03-15 17:52:15,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:52:15,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:52:15,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:52:15,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:52:15,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:15" (1/1) ... [2022-03-15 17:52:15,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:15" (1/1) ... [2022-03-15 17:52:15,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:15" (1/1) ... [2022-03-15 17:52:15,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:15" (1/1) ... [2022-03-15 17:52:15,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:15" (1/1) ... [2022-03-15 17:52:15,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:15" (1/1) ... [2022-03-15 17:52:15,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:15" (1/1) ... [2022-03-15 17:52:15,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:52:15,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:52:15,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:52:15,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:52:15,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:15" (1/1) ... [2022-03-15 17:52:15,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:52:15,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:52:15,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 17:52:15,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 17:52:15,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:52:15,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 17:52:15,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:52:15,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:52:15,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:52:15,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-15 17:52:15,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-15 17:52:15,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-15 17:52:15,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-15 17:52:15,322 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-15 17:52:15,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-15 17:52:15,322 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-03-15 17:52:15,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-03-15 17:52:15,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:52:15,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 17:52:15,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:52:15,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:52:15,324 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 17:52:15,443 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:52:15,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:52:15,879 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:52:16,207 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:52:16,207 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 17:52:16,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:52:16 BoogieIcfgContainer [2022-03-15 17:52:16,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:52:16,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:52:16,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:52:16,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:52:16,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:52:14" (1/3) ... [2022-03-15 17:52:16,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502747e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:52:16, skipping insertion in model container [2022-03-15 17:52:16,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:15" (2/3) ... [2022-03-15 17:52:16,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502747e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:52:16, skipping insertion in model container [2022-03-15 17:52:16,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:52:16" (3/3) ... [2022-03-15 17:52:16,216 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2022-03-15 17:52:16,220 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:52:16,220 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:52:16,220 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:52:16,220 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:52:16,267 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,268 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,268 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,268 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,268 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,268 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,268 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,268 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,269 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,269 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,269 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,269 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,270 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,270 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,270 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,298 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,298 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,298 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,299 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,299 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,299 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,299 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,300 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,300 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,300 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,300 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,301 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,301 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,301 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,306 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,306 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,306 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,306 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,307 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,307 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,307 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,307 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,307 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,307 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,307 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,307 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,308 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,309 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,309 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,309 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,309 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,309 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,309 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,309 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,310 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,310 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,311 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,311 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,312 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,312 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,313 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,315 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,318 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,319 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,319 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,319 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,319 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,319 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,319 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,319 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,319 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,320 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,320 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,320 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,321 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,321 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,321 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,321 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,321 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,321 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,321 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,322 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,322 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,322 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,322 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,324 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,324 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,325 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,325 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,325 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,325 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,325 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,325 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,325 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,326 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,326 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,326 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,327 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,327 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,327 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,327 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,327 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,327 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,328 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,328 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,329 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,329 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,329 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,329 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,329 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,329 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,329 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,329 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,330 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,330 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,330 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,330 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,330 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,330 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,330 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,330 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,331 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,331 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,331 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,331 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,331 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,332 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:16,333 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 17:52:16,372 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:52:16,383 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 17:52:16,383 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-15 17:52:16,391 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:52:16,397 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 300 flow [2022-03-15 17:52:16,402 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 300 flow [2022-03-15 17:52:16,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2022-03-15 17:52:16,460 INFO L129 PetriNetUnfolder]: 2/136 cut-off events. [2022-03-15 17:52:16,460 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 17:52:16,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-03-15 17:52:16,468 INFO L116 LiptonReduction]: Number of co-enabled transitions 3504 [2022-03-15 17:52:20,256 INFO L131 LiptonReduction]: Checked pairs total: 10199 [2022-03-15 17:52:20,256 INFO L133 LiptonReduction]: Total number of compositions: 116 [2022-03-15 17:52:20,262 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 37 transitions, 94 flow [2022-03-15 17:52:20,542 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6072 states, 6069 states have (on average 4.189817103311913) internal successors, (25428), 6071 states have internal predecessors, (25428), 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) [2022-03-15 17:52:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 6072 states, 6069 states have (on average 4.189817103311913) internal successors, (25428), 6071 states have internal predecessors, (25428), 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) [2022-03-15 17:52:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-03-15 17:52:20,579 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:20,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-03-15 17:52:20,579 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:20,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:20,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1234077053, now seen corresponding path program 1 times [2022-03-15 17:52:20,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:20,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933210467] [2022-03-15 17:52:20,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:20,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:20,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:20,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933210467] [2022-03-15 17:52:20,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933210467] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:20,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:20,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:52:20,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [221844676] [2022-03-15 17:52:20,808 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:20,810 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:20,816 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2022-03-15 17:52:20,816 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:20,818 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:20,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:52:20,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:20,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:52:20,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:52:20,851 INFO L87 Difference]: Start difference. First operand has 6072 states, 6069 states have (on average 4.189817103311913) internal successors, (25428), 6071 states have internal predecessors, (25428), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-03-15 17:52:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:20,997 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-03-15 17:52:20,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:52:20,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-03-15 17:52:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:21,038 INFO L225 Difference]: With dead ends: 4962 [2022-03-15 17:52:21,038 INFO L226 Difference]: Without dead ends: 4062 [2022-03-15 17:52:21,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:52:21,041 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:21,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 8 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-03-15 17:52:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2022-03-15 17:52:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4061 states have (on average 3.9706968726914553) internal successors, (16125), 4061 states have internal predecessors, (16125), 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) [2022-03-15 17:52:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2022-03-15 17:52:21,292 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 5 [2022-03-15 17:52:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:21,293 INFO L470 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2022-03-15 17:52:21,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-03-15 17:52:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2022-03-15 17:52:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 17:52:21,296 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:21,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:21,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:52:21,297 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash -121813220, now seen corresponding path program 1 times [2022-03-15 17:52:21,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:21,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041371379] [2022-03-15 17:52:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:21,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:21,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:21,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041371379] [2022-03-15 17:52:21,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041371379] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:21,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:21,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:52:21,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1760099458] [2022-03-15 17:52:21,511 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:21,512 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:21,514 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2022-03-15 17:52:21,515 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:21,515 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:21,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:52:21,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:21,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:52:21,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:52:21,516 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-03-15 17:52:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:21,729 INFO L93 Difference]: Finished difference Result 4312 states and 16600 transitions. [2022-03-15 17:52:21,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:21,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-03-15 17:52:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:21,750 INFO L225 Difference]: With dead ends: 4312 [2022-03-15 17:52:21,750 INFO L226 Difference]: Without dead ends: 3562 [2022-03-15 17:52:21,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:21,751 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:21,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 20 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:52:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2022-03-15 17:52:21,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3562. [2022-03-15 17:52:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3562 states, 3561 states have (on average 3.9104184217916313) internal successors, (13925), 3561 states have internal predecessors, (13925), 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) [2022-03-15 17:52:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3562 states and 13925 transitions. [2022-03-15 17:52:21,862 INFO L78 Accepts]: Start accepts. Automaton has 3562 states and 13925 transitions. Word has length 12 [2022-03-15 17:52:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:21,863 INFO L470 AbstractCegarLoop]: Abstraction has 3562 states and 13925 transitions. [2022-03-15 17:52:21,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-03-15 17:52:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 13925 transitions. [2022-03-15 17:52:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 17:52:21,917 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:21,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:21,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:52:21,918 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:21,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1095414039, now seen corresponding path program 1 times [2022-03-15 17:52:21,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:21,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863256759] [2022-03-15 17:52:21,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:21,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:22,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:22,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863256759] [2022-03-15 17:52:22,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863256759] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:22,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:22,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:52:22,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1700662070] [2022-03-15 17:52:22,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:22,052 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:22,055 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 22 transitions. [2022-03-15 17:52:22,055 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:22,405 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:22,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:52:22,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:22,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:52:22,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:22,406 INFO L87 Difference]: Start difference. First operand 3562 states and 13925 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-03-15 17:52:22,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:22,555 INFO L93 Difference]: Finished difference Result 3982 states and 15176 transitions. [2022-03-15 17:52:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:22,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 14 [2022-03-15 17:52:22,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:22,577 INFO L225 Difference]: With dead ends: 3982 [2022-03-15 17:52:22,577 INFO L226 Difference]: Without dead ends: 3482 [2022-03-15 17:52:22,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:52:22,579 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:22,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 18 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2022-03-15 17:52:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 3482. [2022-03-15 17:52:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3482 states, 3481 states have (on average 3.895719620798621) internal successors, (13561), 3481 states have internal predecessors, (13561), 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) [2022-03-15 17:52:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 13561 transitions. [2022-03-15 17:52:22,755 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 13561 transitions. Word has length 14 [2022-03-15 17:52:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:22,756 INFO L470 AbstractCegarLoop]: Abstraction has 3482 states and 13561 transitions. [2022-03-15 17:52:22,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-03-15 17:52:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 13561 transitions. [2022-03-15 17:52:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 17:52:22,775 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:22,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:22,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 17:52:22,776 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:22,776 INFO L85 PathProgramCache]: Analyzing trace with hash 391859937, now seen corresponding path program 1 times [2022-03-15 17:52:22,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:22,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406413834] [2022-03-15 17:52:22,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:22,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:23,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:23,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406413834] [2022-03-15 17:52:23,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406413834] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:23,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:23,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:52:23,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [834843236] [2022-03-15 17:52:23,023 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:23,025 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:23,029 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 43 transitions. [2022-03-15 17:52:23,029 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:23,769 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [47787#(and (or (= ~x~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (= ~x$w_buff0_used~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (not (= (mod ~x$w_buff0_used~0 256) 0)) (= 0 ~x$r_buff0_thd0~0)))] [2022-03-15 17:52:23,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:52:23,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:23,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:52:23,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:52:23,771 INFO L87 Difference]: Start difference. First operand 3482 states and 13561 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) [2022-03-15 17:52:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:24,013 INFO L93 Difference]: Finished difference Result 4974 states and 19155 transitions. [2022-03-15 17:52:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:24,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 15 [2022-03-15 17:52:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:24,037 INFO L225 Difference]: With dead ends: 4974 [2022-03-15 17:52:24,037 INFO L226 Difference]: Without dead ends: 4518 [2022-03-15 17:52:24,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:52:24,038 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 75 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:24,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 32 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:52:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2022-03-15 17:52:24,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 3666. [2022-03-15 17:52:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3665 states have (on average 3.8889495225102317) internal successors, (14253), 3665 states have internal predecessors, (14253), 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) [2022-03-15 17:52:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 14253 transitions. [2022-03-15 17:52:24,144 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 14253 transitions. Word has length 15 [2022-03-15 17:52:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:24,145 INFO L470 AbstractCegarLoop]: Abstraction has 3666 states and 14253 transitions. [2022-03-15 17:52:24,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) [2022-03-15 17:52:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 14253 transitions. [2022-03-15 17:52:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:52:24,148 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:24,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:24,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:52:24,148 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1497016224, now seen corresponding path program 1 times [2022-03-15 17:52:24,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:24,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412572098] [2022-03-15 17:52:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:24,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:24,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:24,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412572098] [2022-03-15 17:52:24,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412572098] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:24,219 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:24,220 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:52:24,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [917553278] [2022-03-15 17:52:24,220 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:24,221 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:24,226 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 72 transitions. [2022-03-15 17:52:24,227 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:24,611 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:24,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:52:24,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:24,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:52:24,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:24,612 INFO L87 Difference]: Start difference. First operand 3666 states and 14253 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2022-03-15 17:52:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:24,761 INFO L93 Difference]: Finished difference Result 4526 states and 17300 transitions. [2022-03-15 17:52:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:52:24,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 16 [2022-03-15 17:52:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:24,778 INFO L225 Difference]: With dead ends: 4526 [2022-03-15 17:52:24,778 INFO L226 Difference]: Without dead ends: 4144 [2022-03-15 17:52:24,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:52:24,779 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:24,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 23 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2022-03-15 17:52:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 4008. [2022-03-15 17:52:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4008 states, 4007 states have (on average 3.8762166209134015) internal successors, (15532), 4007 states have internal predecessors, (15532), 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) [2022-03-15 17:52:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 15532 transitions. [2022-03-15 17:52:24,940 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 15532 transitions. Word has length 16 [2022-03-15 17:52:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:24,941 INFO L470 AbstractCegarLoop]: Abstraction has 4008 states and 15532 transitions. [2022-03-15 17:52:24,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2022-03-15 17:52:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 15532 transitions. [2022-03-15 17:52:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 17:52:24,945 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:24,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:24,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:52:24,946 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 283943816, now seen corresponding path program 1 times [2022-03-15 17:52:24,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:24,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921379786] [2022-03-15 17:52:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:24,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:25,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:25,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921379786] [2022-03-15 17:52:25,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921379786] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:25,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:25,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:52:25,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [598812762] [2022-03-15 17:52:25,110 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:25,113 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:25,121 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 97 transitions. [2022-03-15 17:52:25,121 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:27,872 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [72659#(and (= (mod ~x$w_buff0_used~0 256) 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= (mod ~x$r_buff1_thd0~0 256) 0) (= (mod ~x$r_buff1_thd1~0 256) 0) (= ~x~0 1)), 72658#(and (= (mod ~x$w_buff0_used~0 256) 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= (mod ~x$r_buff1_thd0~0 256) 0) (= ~x~0 1)), 72661#(and (= ~x$r_buff1_thd0~0 0) (= (mod ~x$r_buff1_thd1~0 256) 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 72662#(and (= ~x$r_buff1_thd0~0 0) (= (mod ~x$r_buff1_thd1~0 256) 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 72660#(and (= (mod ~x$w_buff0_used~0 256) 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= (mod ~x$r_buff1_thd0~0 256) 0) (= (mod ~x$r_buff1_thd1~0 256) 0))] [2022-03-15 17:52:27,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 17:52:27,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:27,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 17:52:27,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-03-15 17:52:27,873 INFO L87 Difference]: Start difference. First operand 4008 states and 15532 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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) [2022-03-15 17:52:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:28,134 INFO L93 Difference]: Finished difference Result 4328 states and 16522 transitions. [2022-03-15 17:52:28,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:28,135 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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 17 [2022-03-15 17:52:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:28,148 INFO L225 Difference]: With dead ends: 4328 [2022-03-15 17:52:28,148 INFO L226 Difference]: Without dead ends: 4100 [2022-03-15 17:52:28,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-03-15 17:52:28,149 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 72 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:28,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 61 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:52:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2022-03-15 17:52:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 4100. [2022-03-15 17:52:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4100 states, 4099 states have (on average 3.8624054647474995) internal successors, (15832), 4099 states have internal predecessors, (15832), 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) [2022-03-15 17:52:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 15832 transitions. [2022-03-15 17:52:28,236 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 15832 transitions. Word has length 17 [2022-03-15 17:52:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:28,237 INFO L470 AbstractCegarLoop]: Abstraction has 4100 states and 15832 transitions. [2022-03-15 17:52:28,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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) [2022-03-15 17:52:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 15832 transitions. [2022-03-15 17:52:28,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 17:52:28,241 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:28,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:28,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 17:52:28,242 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1920460546, now seen corresponding path program 1 times [2022-03-15 17:52:28,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:28,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828691316] [2022-03-15 17:52:28,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:28,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:28,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:28,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828691316] [2022-03-15 17:52:28,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828691316] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:28,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:28,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:52:28,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [119937639] [2022-03-15 17:52:28,293 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:28,295 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:28,302 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 85 transitions. [2022-03-15 17:52:28,302 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:29,043 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [85199#(not (= 4 ~__unbuffered_cnt~0))] [2022-03-15 17:52:29,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:52:29,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:29,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:52:29,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:29,044 INFO L87 Difference]: Start difference. First operand 4100 states and 15832 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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) [2022-03-15 17:52:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:29,185 INFO L93 Difference]: Finished difference Result 2822 states and 9745 transitions. [2022-03-15 17:52:29,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:29,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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 17 [2022-03-15 17:52:29,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:29,190 INFO L225 Difference]: With dead ends: 2822 [2022-03-15 17:52:29,190 INFO L226 Difference]: Without dead ends: 1850 [2022-03-15 17:52:29,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:52:29,191 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 62 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:29,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 28 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:29,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2022-03-15 17:52:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1702. [2022-03-15 17:52:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1701 states have (on average 3.098177542621987) internal successors, (5270), 1701 states have internal predecessors, (5270), 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) [2022-03-15 17:52:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 5270 transitions. [2022-03-15 17:52:29,227 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 5270 transitions. Word has length 17 [2022-03-15 17:52:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:29,228 INFO L470 AbstractCegarLoop]: Abstraction has 1702 states and 5270 transitions. [2022-03-15 17:52:29,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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) [2022-03-15 17:52:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 5270 transitions. [2022-03-15 17:52:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 17:52:29,230 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:29,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:29,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:52:29,231 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:29,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:29,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1041609155, now seen corresponding path program 1 times [2022-03-15 17:52:29,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:29,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323361656] [2022-03-15 17:52:29,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:29,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:29,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323361656] [2022-03-15 17:52:29,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323361656] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:29,292 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:29,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:52:29,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [148752592] [2022-03-15 17:52:29,292 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:29,294 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:29,303 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 93 transitions. [2022-03-15 17:52:29,303 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:29,842 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:29,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:52:29,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:29,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:52:29,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:29,843 INFO L87 Difference]: Start difference. First operand 1702 states and 5270 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-03-15 17:52:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:29,989 INFO L93 Difference]: Finished difference Result 2419 states and 7307 transitions. [2022-03-15 17:52:29,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:29,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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 21 [2022-03-15 17:52:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:29,994 INFO L225 Difference]: With dead ends: 2419 [2022-03-15 17:52:29,994 INFO L226 Difference]: Without dead ends: 1774 [2022-03-15 17:52:29,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:52:29,995 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:29,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 28 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2022-03-15 17:52:30,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1702. [2022-03-15 17:52:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1701 states have (on average 3.0170487948265725) internal successors, (5132), 1701 states have internal predecessors, (5132), 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) [2022-03-15 17:52:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 5132 transitions. [2022-03-15 17:52:30,034 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 5132 transitions. Word has length 21 [2022-03-15 17:52:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:30,034 INFO L470 AbstractCegarLoop]: Abstraction has 1702 states and 5132 transitions. [2022-03-15 17:52:30,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-03-15 17:52:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 5132 transitions. [2022-03-15 17:52:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 17:52:30,038 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:30,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:30,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:52:30,038 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 856021868, now seen corresponding path program 1 times [2022-03-15 17:52:30,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:30,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130047555] [2022-03-15 17:52:30,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:30,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:30,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130047555] [2022-03-15 17:52:30,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130047555] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:30,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:30,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:52:30,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1933386022] [2022-03-15 17:52:30,104 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:30,107 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:30,131 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 79 transitions. [2022-03-15 17:52:30,131 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:30,621 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [97268#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:52:30,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:52:30,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:30,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:52:30,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:52:30,622 INFO L87 Difference]: Start difference. First operand 1702 states and 5132 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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) [2022-03-15 17:52:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:30,748 INFO L93 Difference]: Finished difference Result 1423 states and 4266 transitions. [2022-03-15 17:52:30,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:30,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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 21 [2022-03-15 17:52:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:30,752 INFO L225 Difference]: With dead ends: 1423 [2022-03-15 17:52:30,752 INFO L226 Difference]: Without dead ends: 1268 [2022-03-15 17:52:30,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:52:30,753 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 117 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:30,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 43 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2022-03-15 17:52:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1154. [2022-03-15 17:52:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 3.0485689505637468) internal successors, (3515), 1153 states have internal predecessors, (3515), 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) [2022-03-15 17:52:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 3515 transitions. [2022-03-15 17:52:30,776 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 3515 transitions. Word has length 21 [2022-03-15 17:52:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:30,778 INFO L470 AbstractCegarLoop]: Abstraction has 1154 states and 3515 transitions. [2022-03-15 17:52:30,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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) [2022-03-15 17:52:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 3515 transitions. [2022-03-15 17:52:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 17:52:30,780 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:30,780 INFO L514 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] [2022-03-15 17:52:30,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 17:52:30,780 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash -394706856, now seen corresponding path program 1 times [2022-03-15 17:52:30,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:30,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213037061] [2022-03-15 17:52:30,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:30,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:30,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213037061] [2022-03-15 17:52:30,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213037061] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:30,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:30,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 17:52:30,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1657001305] [2022-03-15 17:52:30,868 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:30,871 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:30,889 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 150 transitions. [2022-03-15 17:52:30,889 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:31,801 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [101009#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:52:31,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:52:31,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:31,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:52:31,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:52:31,802 INFO L87 Difference]: Start difference. First operand 1154 states and 3515 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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) [2022-03-15 17:52:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:31,978 INFO L93 Difference]: Finished difference Result 1106 states and 3418 transitions. [2022-03-15 17:52:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:52:31,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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 25 [2022-03-15 17:52:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:31,980 INFO L225 Difference]: With dead ends: 1106 [2022-03-15 17:52:31,980 INFO L226 Difference]: Without dead ends: 538 [2022-03-15 17:52:31,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:52:31,980 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 106 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:31,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 32 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:52:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-03-15 17:52:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 518. [2022-03-15 17:52:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 2.9032882011605414) internal successors, (1501), 517 states have internal predecessors, (1501), 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) [2022-03-15 17:52:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1501 transitions. [2022-03-15 17:52:31,989 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1501 transitions. Word has length 25 [2022-03-15 17:52:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:31,989 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 1501 transitions. [2022-03-15 17:52:31,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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) [2022-03-15 17:52:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1501 transitions. [2022-03-15 17:52:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 17:52:31,990 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:31,990 INFO L514 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] [2022-03-15 17:52:31,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 17:52:31,991 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:31,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1602787709, now seen corresponding path program 1 times [2022-03-15 17:52:31,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:31,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702546038] [2022-03-15 17:52:31,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:31,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:32,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:32,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702546038] [2022-03-15 17:52:32,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702546038] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:32,244 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:32,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 17:52:32,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1363927210] [2022-03-15 17:52:32,244 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:32,248 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:32,283 INFO L252 McrAutomatonBuilder]: Finished intersection with 101 states and 187 transitions. [2022-03-15 17:52:32,283 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:35,763 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [103164#(and (or (not (= 2 ~x$w_buff0~0)) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (not (= (mod ~x$w_buff0_used~0 256) 0)) (= 0 ~x$r_buff0_thd0~0))), 103163#(and (or (<= 0 ~x$w_buff0_used~0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (or (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (<= 0 ~x$w_buff0_used~0)) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (or (<= ~x$w_buff0_used~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (<= ~x$w_buff0_used~0 0)))] [2022-03-15 17:52:35,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 17:52:35,765 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:35,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 17:52:35,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:52:35,765 INFO L87 Difference]: Start difference. First operand 518 states and 1501 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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) [2022-03-15 17:52:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:36,044 INFO L93 Difference]: Finished difference Result 763 states and 2209 transitions. [2022-03-15 17:52:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:52:36,045 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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 29 [2022-03-15 17:52:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:36,046 INFO L225 Difference]: With dead ends: 763 [2022-03-15 17:52:36,046 INFO L226 Difference]: Without dead ends: 556 [2022-03-15 17:52:36,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-15 17:52:36,047 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 72 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:36,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 62 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 17:52:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-03-15 17:52:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 404. [2022-03-15 17:52:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 2.8411910669975184) internal successors, (1145), 403 states have internal predecessors, (1145), 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) [2022-03-15 17:52:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1145 transitions. [2022-03-15 17:52:36,054 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1145 transitions. Word has length 29 [2022-03-15 17:52:36,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:36,054 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 1145 transitions. [2022-03-15 17:52:36,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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) [2022-03-15 17:52:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1145 transitions. [2022-03-15 17:52:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 17:52:36,057 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:36,057 INFO L514 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] [2022-03-15 17:52:36,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 17:52:36,057 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:52:36,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash 301940915, now seen corresponding path program 2 times [2022-03-15 17:52:36,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:36,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544827561] [2022-03-15 17:52:36,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:36,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:52:36,120 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 17:52:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:52:36,216 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 17:52:36,216 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 17:52:36,216 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-03-15 17:52:36,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-03-15 17:52:36,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-03-15 17:52:36,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-03-15 17:52:36,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-03-15 17:52:36,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-03-15 17:52:36,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-03-15 17:52:36,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 17:52:36,220 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:36,223 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:52:36,223 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:52:36,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:52:36 BasicIcfg [2022-03-15 17:52:36,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:52:36,323 INFO L158 Benchmark]: Toolchain (without parser) took 21741.55ms. Allocated memory was 206.6MB in the beginning and 1.0GB in the end (delta: 831.5MB). Free memory was 154.2MB in the beginning and 783.8MB in the end (delta: -629.6MB). Peak memory consumption was 202.5MB. Max. memory is 8.0GB. [2022-03-15 17:52:36,323 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 206.6MB. Free memory is still 172.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:52:36,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.24ms. Allocated memory is still 206.6MB. Free memory was 153.9MB in the beginning and 169.7MB in the end (delta: -15.9MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-03-15 17:52:36,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.64ms. Allocated memory is still 206.6MB. Free memory was 169.7MB in the beginning and 166.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-15 17:52:36,324 INFO L158 Benchmark]: Boogie Preprocessor took 38.57ms. Allocated memory is still 206.6MB. Free memory was 166.1MB in the beginning and 164.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 17:52:36,324 INFO L158 Benchmark]: RCFGBuilder took 978.23ms. Allocated memory is still 206.6MB. Free memory was 164.0MB in the beginning and 75.9MB in the end (delta: 88.1MB). Peak memory consumption was 88.1MB. Max. memory is 8.0GB. [2022-03-15 17:52:36,325 INFO L158 Benchmark]: TraceAbstraction took 20111.49ms. Allocated memory was 206.6MB in the beginning and 1.0GB in the end (delta: 831.5MB). Free memory was 75.4MB in the beginning and 783.8MB in the end (delta: -708.4MB). Peak memory consumption was 124.1MB. Max. memory is 8.0GB. [2022-03-15 17:52:36,326 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.10ms. Allocated memory is still 206.6MB. Free memory is still 172.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 515.24ms. Allocated memory is still 206.6MB. Free memory was 153.9MB in the beginning and 169.7MB in the end (delta: -15.9MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.64ms. Allocated memory is still 206.6MB. Free memory was 169.7MB in the beginning and 166.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.57ms. Allocated memory is still 206.6MB. Free memory was 166.1MB in the beginning and 164.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 978.23ms. Allocated memory is still 206.6MB. Free memory was 164.0MB in the beginning and 75.9MB in the end (delta: 88.1MB). Peak memory consumption was 88.1MB. Max. memory is 8.0GB. * TraceAbstraction took 20111.49ms. Allocated memory was 206.6MB in the beginning and 1.0GB in the end (delta: 831.5MB). Free memory was 75.4MB in the beginning and 783.8MB in the end (delta: -708.4MB). Peak memory consumption was 124.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 151 PlacesBefore, 49 PlacesAfterwards, 140 TransitionsBefore, 37 TransitionsAfterwards, 3504 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 10199 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4103, positive: 3854, positive conditional: 0, positive unconditional: 3854, negative: 249, negative conditional: 0, negative unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1822, positive: 1783, positive conditional: 0, positive unconditional: 1783, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4103, positive: 2071, positive conditional: 0, positive unconditional: 2071, negative: 210, negative conditional: 0, negative unconditional: 210, unknown: 1822, unknown conditional: 0, unknown unconditional: 1822] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t993, ((void *)0), P0, ((void *)0))=-3, t993={5: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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t994, ((void *)0), P1, ((void *)0))=-2, t993={5:0}, t994={6: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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t995, ((void *)0), P2, ((void *)0))=-1, t993={5:0}, t994={6:0}, t995={7: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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t996, ((void *)0), P3, ((void *)0))=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={3: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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L824] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L833] 4 __unbuffered_p3_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L754] 1 b = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L757] 1 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L790] 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) [L790] 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) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 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 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 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 [L760] 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) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] 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) [L760] 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) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 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 [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 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 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] 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) [L871] 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) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 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 [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 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 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 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) [L882] 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) [L883] 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)) [L883] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L883] 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)) [L883] 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)) [L884] 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)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L884] 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)) [L884] 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)) [L885] 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)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L885] 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)) [L885] 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)) [L886] 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)) [L886] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L886] 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)) [L886] 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)) [L887] 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)) [L887] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L887] 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)) [L887] 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)) [L888] 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)) [L888] EXPR 0 !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) [L888] 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)) [L888] 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)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice0=49, weak$$choice2=0, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 687 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 687 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1295 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1929 IncrementalHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 93 mSDtfsCounter, 1929 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 293 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6072occurred in iteration=0, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1494 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 1438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-15 17:52:36,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...