/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/weaver/popl20-bad-threaded-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:08:09,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:08:09,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:08:09,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:08:09,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:08:09,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:08:09,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:08:09,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:08:09,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:08:09,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:08:09,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:08:09,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:08:09,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:08:09,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:08:09,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:08:09,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:08:09,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:08:09,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:08:09,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:08:09,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:08:09,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:08:09,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:08:09,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:08:09,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:08:09,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:08:09,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:08:09,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:08:09,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:08:09,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:08:09,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:08:09,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:08:09,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:08:09,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:08:09,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:08:09,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:08:09,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:08:09,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:08:09,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:08:09,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:08:09,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:08:09,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:08:09,681 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 19:08:09,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:08:09,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:08:09,701 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:08:09,701 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:08:09,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:08:09,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:08:09,701 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:08:09,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:08:09,702 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:08:09,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:08:09,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:08:09,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:08:09,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:08:09,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:08:09,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:08:09,703 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:08:09,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:08:09,703 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:08:09,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:08:09,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:08:09,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:08:09,704 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:08:09,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:08:09,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:08:09,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:08:09,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:08:09,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:08:09,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:08:09,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:08:09,704 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:08:09,705 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:08:09,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:08:09,705 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 19:08:09,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:08:09,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:08:09,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:08:09,880 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:08:09,881 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:08:09,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2022-03-15 19:08:09,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aba14f1f/91bdb500626747c1b3b677d3c3e4c92e/FLAG75cdb2202 [2022-03-15 19:08:10,302 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:08:10,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2022-03-15 19:08:10,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aba14f1f/91bdb500626747c1b3b677d3c3e4c92e/FLAG75cdb2202 [2022-03-15 19:08:10,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aba14f1f/91bdb500626747c1b3b677d3c3e4c92e [2022-03-15 19:08:10,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:08:10,325 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:08:10,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:08:10,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:08:10,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:08:10,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:08:10" (1/1) ... [2022-03-15 19:08:10,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eaeef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10, skipping insertion in model container [2022-03-15 19:08:10,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:08:10" (1/1) ... [2022-03-15 19:08:10,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:08:10,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:08:10,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2476,2489] [2022-03-15 19:08:10,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:08:10,565 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:08:10,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2476,2489] [2022-03-15 19:08:10,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:08:10,585 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:08:10,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10 WrapperNode [2022-03-15 19:08:10,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:08:10,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:08:10,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:08:10,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:08:10,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10" (1/1) ... [2022-03-15 19:08:10,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10" (1/1) ... [2022-03-15 19:08:10,606 INFO L137 Inliner]: procedures = 21, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2022-03-15 19:08:10,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:08:10,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:08:10,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:08:10,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:08:10,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10" (1/1) ... [2022-03-15 19:08:10,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10" (1/1) ... [2022-03-15 19:08:10,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10" (1/1) ... [2022-03-15 19:08:10,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10" (1/1) ... [2022-03-15 19:08:10,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10" (1/1) ... [2022-03-15 19:08:10,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10" (1/1) ... [2022-03-15 19:08:10,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10" (1/1) ... [2022-03-15 19:08:10,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:08:10,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:08:10,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:08:10,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:08:10,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10" (1/1) ... [2022-03-15 19:08:10,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:08:10,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:10,667 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 19:08:10,671 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 19:08:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:08:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:08:10,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:08:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:08:10,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:08:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:08:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:08:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:08:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:08:10,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:08:10,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:08:10,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:08:10,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:08:10,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:08:10,715 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 19:08:10,764 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:08:10,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:08:10,896 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:08:10,923 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:08:10,923 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 19:08:10,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:08:10 BoogieIcfgContainer [2022-03-15 19:08:10,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:08:10,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:08:10,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:08:10,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:08:10,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:08:10" (1/3) ... [2022-03-15 19:08:10,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ce7965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:08:10, skipping insertion in model container [2022-03-15 19:08:10,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:08:10" (2/3) ... [2022-03-15 19:08:10,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ce7965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:08:10, skipping insertion in model container [2022-03-15 19:08:10,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:08:10" (3/3) ... [2022-03-15 19:08:10,930 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2022-03-15 19:08:10,933 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:08:10,933 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:08:10,933 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:08:10,933 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:08:10,958 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,959 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,959 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,960 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,960 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,960 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,960 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,960 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,963 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,963 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,964 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,964 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,964 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,965 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,965 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,965 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,967 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,967 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,969 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,970 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,971 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,971 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,971 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,971 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,971 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:08:10,976 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 19:08:11,002 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:08:11,008 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 19:08:11,008 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 19:08:11,016 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:08:11,027 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 88 transitions, 192 flow [2022-03-15 19:08:11,031 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 88 transitions, 192 flow [2022-03-15 19:08:11,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 88 transitions, 192 flow [2022-03-15 19:08:11,075 INFO L129 PetriNetUnfolder]: 6/86 cut-off events. [2022-03-15 19:08:11,075 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 19:08:11,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 86 events. 6/86 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-03-15 19:08:11,078 INFO L116 LiptonReduction]: Number of co-enabled transitions 396 [2022-03-15 19:08:12,541 INFO L131 LiptonReduction]: Checked pairs total: 686 [2022-03-15 19:08:12,542 INFO L133 LiptonReduction]: Total number of compositions: 77 [2022-03-15 19:08:12,549 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 20 transitions, 56 flow [2022-03-15 19:08:12,576 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 52 states, 51 states have (on average 2.2745098039215685) internal successors, (116), 51 states have internal predecessors, (116), 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 19:08:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 51 states have (on average 2.2745098039215685) internal successors, (116), 51 states have internal predecessors, (116), 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 19:08:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 19:08:12,587 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:12,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:12,589 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:08:12,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:12,592 INFO L85 PathProgramCache]: Analyzing trace with hash 994354069, now seen corresponding path program 1 times [2022-03-15 19:08:12,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:12,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503886828] [2022-03-15 19:08:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:12,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:12,913 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 19:08:12,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:12,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503886828] [2022-03-15 19:08:12,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503886828] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:08:12,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:08:12,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:08:12,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [531600675] [2022-03-15 19:08:12,916 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:12,920 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:12,935 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 57 transitions. [2022-03-15 19:08:12,936 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:13,189 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [200#(not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))] [2022-03-15 19:08:13,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:08:13,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:13,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:08:13,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:08:13,209 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 2.2745098039215685) internal successors, (116), 51 states have internal predecessors, (116), 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 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 19:08:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:13,280 INFO L93 Difference]: Finished difference Result 72 states and 164 transitions. [2022-03-15 19:08:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:08:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 13 [2022-03-15 19:08:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:13,287 INFO L225 Difference]: With dead ends: 72 [2022-03-15 19:08:13,287 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 19:08:13,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:08:13,290 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:13,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:08:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 19:08:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2022-03-15 19:08:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.2950819672131146) internal successors, (140), 61 states have internal predecessors, (140), 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 19:08:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 140 transitions. [2022-03-15 19:08:13,317 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 140 transitions. Word has length 13 [2022-03-15 19:08:13,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:13,318 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 140 transitions. [2022-03-15 19:08:13,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 19:08:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 140 transitions. [2022-03-15 19:08:13,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:08:13,319 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:13,319 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:13,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:08:13,319 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:08:13,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1817336714, now seen corresponding path program 1 times [2022-03-15 19:08:13,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:13,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557843290] [2022-03-15 19:08:13,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:13,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:13,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:13,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557843290] [2022-03-15 19:08:13,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557843290] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:13,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177148058] [2022-03-15 19:08:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:13,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:13,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:13,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:13,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 19:08:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:13,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 19:08:13,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:13,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:13,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177148058] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:13,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:08:13,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2022-03-15 19:08:13,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2013083380] [2022-03-15 19:08:13,745 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:13,746 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:13,749 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 76 transitions. [2022-03-15 19:08:13,749 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:14,174 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [497#(or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))), 495#(not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)), 498#(or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)), 496#(< 0 (mod (+ 4294967295 ~t~0) 4294967296))] [2022-03-15 19:08:14,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:08:14,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:14,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:08:14,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:08:14,176 INFO L87 Difference]: Start difference. First operand 62 states and 140 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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 19:08:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:14,523 INFO L93 Difference]: Finished difference Result 84 states and 178 transitions. [2022-03-15 19:08:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:08:14,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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 19:08:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:14,524 INFO L225 Difference]: With dead ends: 84 [2022-03-15 19:08:14,524 INFO L226 Difference]: Without dead ends: 84 [2022-03-15 19:08:14,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:08:14,525 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 74 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:14,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 2 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:08:14,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-03-15 19:08:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2022-03-15 19:08:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.2467532467532467) internal successors, (173), 77 states have internal predecessors, (173), 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 19:08:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 173 transitions. [2022-03-15 19:08:14,531 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 173 transitions. Word has length 15 [2022-03-15 19:08:14,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:14,531 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 173 transitions. [2022-03-15 19:08:14,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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 19:08:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 173 transitions. [2022-03-15 19:08:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:08:14,534 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:14,534 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:14,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:08:14,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:14,766 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:08:14,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -131043638, now seen corresponding path program 2 times [2022-03-15 19:08:14,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:14,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514009065] [2022-03-15 19:08:14,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:14,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:15,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:15,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514009065] [2022-03-15 19:08:15,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514009065] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:15,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053609906] [2022-03-15 19:08:15,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:08:15,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:15,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:15,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 19:08:15,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:08:15,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:15,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:08:15,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:15,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:15,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053609906] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:15,722 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:15,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-03-15 19:08:15,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [950669940] [2022-03-15 19:08:15,722 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:15,723 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:15,725 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 41 transitions. [2022-03-15 19:08:15,725 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:16,127 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [874#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~m~0 0))), 873#(and (or (< 0 (mod ~t~0 4294967296)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (< 0 (mod ~s~0 4294967296))) (= ~m~0 0))] [2022-03-15 19:08:16,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:08:16,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:16,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:08:16,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:08:16,128 INFO L87 Difference]: Start difference. First operand 78 states and 173 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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 19:08:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:17,041 INFO L93 Difference]: Finished difference Result 149 states and 335 transitions. [2022-03-15 19:08:17,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:08:17,042 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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 15 [2022-03-15 19:08:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:17,043 INFO L225 Difference]: With dead ends: 149 [2022-03-15 19:08:17,043 INFO L226 Difference]: Without dead ends: 114 [2022-03-15 19:08:17,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:08:17,044 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 59 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:17,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 5 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:08:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-03-15 19:08:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2022-03-15 19:08:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.269662921348315) internal successors, (202), 89 states have internal predecessors, (202), 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 19:08:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 202 transitions. [2022-03-15 19:08:17,054 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 202 transitions. Word has length 15 [2022-03-15 19:08:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:17,054 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 202 transitions. [2022-03-15 19:08:17,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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 19:08:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 202 transitions. [2022-03-15 19:08:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:08:17,055 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:17,055 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 19:08:17,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:08:17,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-15 19:08:17,271 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:08:17,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash -670065561, now seen corresponding path program 1 times [2022-03-15 19:08:17,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:17,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241685556] [2022-03-15 19:08:17,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:17,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:17,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:17,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241685556] [2022-03-15 19:08:17,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241685556] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:17,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664228492] [2022-03-15 19:08:17,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:17,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:17,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:17,354 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:17,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 19:08:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:17,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:08:17,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:17,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:17,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664228492] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:17,560 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:17,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 9 [2022-03-15 19:08:17,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [305151345] [2022-03-15 19:08:17,561 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:17,562 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:17,565 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 65 transitions. [2022-03-15 19:08:17,565 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:17,728 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:08:17,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:08:17,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:17,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:08:17,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:08:17,729 INFO L87 Difference]: Start difference. First operand 90 states and 202 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 19:08:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:17,806 INFO L93 Difference]: Finished difference Result 176 states and 405 transitions. [2022-03-15 19:08:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:08:17,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 19:08:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:17,807 INFO L225 Difference]: With dead ends: 176 [2022-03-15 19:08:17,808 INFO L226 Difference]: Without dead ends: 176 [2022-03-15 19:08:17,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:08:17,809 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:17,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 8 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:08:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-03-15 19:08:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 100. [2022-03-15 19:08:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.313131313131313) internal successors, (229), 99 states have internal predecessors, (229), 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 19:08:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 229 transitions. [2022-03-15 19:08:17,815 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 229 transitions. Word has length 17 [2022-03-15 19:08:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:17,815 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 229 transitions. [2022-03-15 19:08:17,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 19:08:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 229 transitions. [2022-03-15 19:08:17,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:08:17,816 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:17,816 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 19:08:17,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 19:08:18,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:18,037 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:08:18,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:18,038 INFO L85 PathProgramCache]: Analyzing trace with hash 215464439, now seen corresponding path program 2 times [2022-03-15 19:08:18,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:18,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773768523] [2022-03-15 19:08:18,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:18,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:18,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:18,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773768523] [2022-03-15 19:08:18,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773768523] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:18,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464131276] [2022-03-15 19:08:18,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:08:18,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:18,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:18,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:18,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 19:08:18,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:08:18,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:18,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:08:18,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:18,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:19,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464131276] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:19,751 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:19,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 21 [2022-03-15 19:08:19,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [279754738] [2022-03-15 19:08:19,751 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:19,752 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:19,755 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 66 transitions. [2022-03-15 19:08:19,755 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:21,051 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1840#(and (or (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (+ 2 ~T~0 ~S~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296)) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0))) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (<= (+ ~T~0 ~S~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 1) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (+ ~T~0 ~S~0 4294967297 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0))) (or (<= (+ ~T~0 ~S~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 1) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0)) (<= (+ ~T~0 ~S~0 1) (+ ~t~0 ~s~0 ~m~0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (<= (+ ~T~0 ~S~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 1) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) (div ~m~0 4294967296)) (div (+ ~T~0 ~S~0) 4294967296))))] [2022-03-15 19:08:21,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:08:21,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:21,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:08:21,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:08:21,052 INFO L87 Difference]: Start difference. First operand 100 states and 229 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 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 19:08:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:21,485 INFO L93 Difference]: Finished difference Result 181 states and 415 transitions. [2022-03-15 19:08:21,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:08:21,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 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 19:08:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:21,486 INFO L225 Difference]: With dead ends: 181 [2022-03-15 19:08:21,486 INFO L226 Difference]: Without dead ends: 146 [2022-03-15 19:08:21,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:08:21,487 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:21,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 1 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:08:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-03-15 19:08:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2022-03-15 19:08:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.347107438016529) internal successors, (284), 121 states have internal predecessors, (284), 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 19:08:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 284 transitions. [2022-03-15 19:08:21,493 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 284 transitions. Word has length 17 [2022-03-15 19:08:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:21,493 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 284 transitions. [2022-03-15 19:08:21,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 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 19:08:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 284 transitions. [2022-03-15 19:08:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:08:21,494 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:21,494 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:21,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 19:08:21,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:21,707 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:08:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:21,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1236328759, now seen corresponding path program 3 times [2022-03-15 19:08:21,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:21,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253543290] [2022-03-15 19:08:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:21,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:21,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:21,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253543290] [2022-03-15 19:08:21,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253543290] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:21,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144819187] [2022-03-15 19:08:21,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:08:21,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:21,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:21,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:21,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 19:08:22,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:08:22,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:22,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:08:22,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:22,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:22,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144819187] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:22,841 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:22,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2022-03-15 19:08:22,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [260107717] [2022-03-15 19:08:22,841 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:22,843 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:22,845 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 47 transitions. [2022-03-15 19:08:22,845 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:23,238 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2397#(and (or (< 0 (mod ~t~0 4294967296)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0)))] [2022-03-15 19:08:23,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:08:23,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:08:23,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:08:23,240 INFO L87 Difference]: Start difference. First operand 122 states and 284 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 19:08:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:23,410 INFO L93 Difference]: Finished difference Result 169 states and 390 transitions. [2022-03-15 19:08:23,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:08:23,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 19:08:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:23,411 INFO L225 Difference]: With dead ends: 169 [2022-03-15 19:08:23,411 INFO L226 Difference]: Without dead ends: 144 [2022-03-15 19:08:23,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:08:23,412 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:23,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 1 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:08:23,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-15 19:08:23,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 122. [2022-03-15 19:08:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.347107438016529) internal successors, (284), 121 states have internal predecessors, (284), 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 19:08:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 284 transitions. [2022-03-15 19:08:23,419 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 284 transitions. Word has length 17 [2022-03-15 19:08:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:23,419 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 284 transitions. [2022-03-15 19:08:23,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 19:08:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 284 transitions. [2022-03-15 19:08:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:08:23,420 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:23,420 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:23,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 19:08:23,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:23,635 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:08:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1031775048, now seen corresponding path program 3 times [2022-03-15 19:08:23,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:23,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752934641] [2022-03-15 19:08:23,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:23,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:24,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:24,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752934641] [2022-03-15 19:08:24,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752934641] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:24,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199833295] [2022-03-15 19:08:24,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:08:24,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:24,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:24,488 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:24,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 19:08:24,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:08:24,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:24,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:08:24,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:24,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:26,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199833295] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:26,226 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:26,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 19:08:26,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1376276428] [2022-03-15 19:08:26,226 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:26,228 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:26,238 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 90 transitions. [2022-03-15 19:08:26,238 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:29,233 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [2949#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 2948#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 2952#(and (or (= (+ (* (- 1) thread2Thread1of1ForFork0_~cond~1) 1) 0) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (<= ~t~0 (* (div ~t~0 4294967296) 4294967296))) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (= (* (- 1) thread2Thread1of1ForFork0_~cond~1) 0)) (or (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 1)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 ~m~0)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= 0 ~m~0) (<= (+ ~T~0 ~S~0) (+ (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296) ~t~0 ~m~0 1)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (<= 0 (+ ~m~0 1)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (< 0 (mod ~s~0 4294967296))) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0)))), 2951#(and (or (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)))), 2953#(and (or (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 ~m~0)) (not (< 0 (mod ~t~0 4294967296)))) (or (<= 0 (+ ~m~0 1)) (not (< 0 (mod ~t~0 4294967296)))) (or (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 1)) (not (< 0 (mod ~t~0 4294967296)))) (or (<= 0 ~m~0) (<= (+ ~T~0 ~S~0) (+ (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296) ~t~0 ~m~0 1)) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~s~0 4294967296))) (not (<= ~t~0 (* (div ~t~0 4294967296) 4294967296))) (= (* (- 1) thread2Thread1of1ForFork0_~cond~1) 0)) (or (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (= (+ (* (- 1) thread2Thread1of1ForFork0_~cond~1) 1) 0) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~s~0 4294967296))) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0)))), 2950#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)))] [2022-03-15 19:08:29,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:08:29,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:29,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:08:29,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:08:29,234 INFO L87 Difference]: Start difference. First operand 122 states and 284 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 19:08:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:33,786 INFO L93 Difference]: Finished difference Result 265 states and 572 transitions. [2022-03-15 19:08:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:08:33,786 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 19 [2022-03-15 19:08:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:33,787 INFO L225 Difference]: With dead ends: 265 [2022-03-15 19:08:33,787 INFO L226 Difference]: Without dead ends: 212 [2022-03-15 19:08:33,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 32 SyntacticMatches, 16 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=582, Invalid=2958, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:08:33,789 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 143 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:33,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 0 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:08:33,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-03-15 19:08:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 140. [2022-03-15 19:08:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.352517985611511) internal successors, (327), 139 states have internal predecessors, (327), 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 19:08:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 327 transitions. [2022-03-15 19:08:33,795 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 327 transitions. Word has length 19 [2022-03-15 19:08:33,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:33,795 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 327 transitions. [2022-03-15 19:08:33,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 19:08:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 327 transitions. [2022-03-15 19:08:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:08:33,796 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:33,796 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:33,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 19:08:34,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:34,007 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:08:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:34,008 INFO L85 PathProgramCache]: Analyzing trace with hash 171527142, now seen corresponding path program 4 times [2022-03-15 19:08:34,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:34,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663497422] [2022-03-15 19:08:34,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:34,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:35,783 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:35,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663497422] [2022-03-15 19:08:35,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663497422] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:35,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967637829] [2022-03-15 19:08:35,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:08:35,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:35,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:35,800 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:35,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 19:08:35,896 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:08:35,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:35,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:08:35,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:37,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:40,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967637829] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:40,198 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:40,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-03-15 19:08:40,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [572299864] [2022-03-15 19:08:40,198 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:40,200 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:40,204 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 71 transitions. [2022-03-15 19:08:40,204 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:59,805 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [3700#(and (or (<= (+ ~t~0 (* (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ (* (div ~t~0 4294967296) 4294967296) 4294967295 (* 4294967296 (div (+ (* ~S~0 4294967296) (* (- 18446744073709551616) (div ~t~0 4294967296)) (- 18446744065119617025) (* ~T~0 4294967296) (* ~m~0 (- 4294967296))) 18446744073709551616)))) (<= (+ ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0 1)) (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* (div (+ (* (div (+ (* ~S~0 4294967296) (* (- 18446744073709551616) (div ~t~0 4294967296)) (* ~T~0 4294967296) (* ~m~0 (- 4294967296)) 8589934591) 18446744073709551616) 4294967296) (* (- 1) ~S~0) 4294967295 ~t~0 ~s~0 ~m~0 (* (- 1) ~T~0)) 4294967296) 4294967296) 1) ~s~0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))) (or (not (< 0 (mod ~s~0 4294967296))) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1)) (not (<= (+ (div (+ ~m~0 1) 4294967296) 1) 0))) (or (not (< 0 (mod ~s~0 4294967296))) (not (<= ~t~0 (* (div ~t~0 4294967296) 4294967296))) (= (* (- 1) thread2Thread1of1ForFork0_~cond~1) 0)) (or (<= (+ ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0 1)) (<= (+ (* (div (+ (* (- 1) ~S~0) 4294967295 ~t~0 ~s~0 ~m~0 (* (- 1) ~T~0) (* 4294967296 (div (+ (* ~S~0 4294967296) (* (- 18446744073709551616) (div ~t~0 4294967296)) (- 18446744065119617025) (* ~T~0 4294967296) (* ~m~0 (- 4294967296))) 18446744073709551616))) 4294967296) 4294967296) 1) ~s~0) (not (< 0 (mod ~s~0 4294967296))) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))) (or (= (+ (* (- 1) thread2Thread1of1ForFork0_~cond~1) 1) 0) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~s~0 4294967296))) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296))) (<= (+ ~T~0 ~S~0) (+ (* (div ~t~0 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) (* (- 1) ~t~0) ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* (- 1) ~m~0)) 4294967296) 4294967296) 8589934590)) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1)))), 3698#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0))), 3697#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 3699#(and (or (= (+ (* (- 1) thread2Thread1of1ForFork0_~cond~1) 1) 0) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= (+ ~t~0 (* (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ (* (div ~t~0 4294967296) 4294967296) 4294967295 (* 4294967296 (div (+ (* ~S~0 4294967296) (* (- 18446744073709551616) (div ~t~0 4294967296)) (- 18446744065119617025) (* ~T~0 4294967296) (* ~m~0 (- 4294967296))) 18446744073709551616)))) (<= (+ ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0 1)) (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* (div (+ (* (div (+ (* ~S~0 4294967296) (* (- 18446744073709551616) (div ~t~0 4294967296)) (* ~T~0 4294967296) (* ~m~0 (- 4294967296)) 8589934591) 18446744073709551616) 4294967296) (* (- 1) ~S~0) 4294967295 ~t~0 ~s~0 ~m~0 (* (- 1) ~T~0)) 4294967296) 4294967296) 1) ~s~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))) (or (not (<= ~t~0 (* (div ~t~0 4294967296) 4294967296))) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (= (* (- 1) thread2Thread1of1ForFork0_~cond~1) 0)) (or (<= (+ ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0 1)) (<= (+ (* (div (+ (* (- 1) ~S~0) 4294967295 ~t~0 ~s~0 ~m~0 (* (- 1) ~T~0) (* 4294967296 (div (+ (* ~S~0 4294967296) (* (- 18446744073709551616) (div ~t~0 4294967296)) (- 18446744065119617025) (* ~T~0 4294967296) (* ~m~0 (- 4294967296))) 18446744073709551616))) 4294967296) 4294967296) 1) ~s~0) (not (< 0 (mod ~s~0 4294967296))) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))) (or (not (< 0 (mod ~s~0 4294967296))) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1)) (not (<= (+ (div (+ ~m~0 1) 4294967296) 1) 0))) (or (not (< 0 (mod ~s~0 4294967296))) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296))) (<= (+ ~T~0 ~S~0) (+ (* (div ~t~0 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) (* (- 1) ~t~0) ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* (- 1) ~m~0)) 4294967296) 4294967296) 8589934590)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))))] [2022-03-15 19:08:59,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:08:59,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:59,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:08:59,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1047, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:08:59,806 INFO L87 Difference]: Start difference. First operand 140 states and 327 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:04,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:09:06,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 19:09:15,119 WARN L228 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 134 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 19:09:17,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 19:09:19,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:09:20,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:09:22,937 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:09:46,303 WARN L228 SmtUtils]: Spent 22.99s on a formula simplification. DAG size of input: 157 DAG size of output: 150 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 19:10:23,082 WARN L228 SmtUtils]: Spent 30.16s on a formula simplification. DAG size of input: 153 DAG size of output: 136 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 19:10:25,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:10:28,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:10:30,515 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:10:32,600 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:10:34,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:10:37,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:10:39,882 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:10:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:44,937 INFO L93 Difference]: Finished difference Result 256 states and 581 transitions. [2022-03-15 19:10:44,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:10:44,938 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:10:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:44,939 INFO L225 Difference]: With dead ends: 256 [2022-03-15 19:10:44,939 INFO L226 Difference]: Without dead ends: 226 [2022-03-15 19:10:44,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 26 SyntacticMatches, 11 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 81.5s TimeCoverageRelationStatistics Valid=508, Invalid=2572, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:10:44,940 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 41 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:44,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 871 Invalid, 11 Unknown, 0 Unchecked, 35.6s Time] [2022-03-15 19:10:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-03-15 19:10:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 146. [2022-03-15 19:10:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.3586206896551722) internal successors, (342), 145 states have internal predecessors, (342), 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 19:10:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 342 transitions. [2022-03-15 19:10:44,945 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 342 transitions. Word has length 19 [2022-03-15 19:10:44,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:44,945 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 342 transitions. [2022-03-15 19:10:44,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:10:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 342 transitions. [2022-03-15 19:10:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:10:44,946 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:44,946 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:44,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 19:10:45,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:45,146 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:10:45,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:45,147 INFO L85 PathProgramCache]: Analyzing trace with hash -472747208, now seen corresponding path program 5 times [2022-03-15 19:10:45,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:45,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484251976] [2022-03-15 19:10:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:45,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:45,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484251976] [2022-03-15 19:10:45,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484251976] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:45,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274752225] [2022-03-15 19:10:45,592 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:10:45,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:45,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:45,604 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:10:45,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:10:45,705 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:10:45,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:10:45,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:10:45,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:46,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:47,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274752225] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:47,665 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:47,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 19:10:47,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1410897712] [2022-03-15 19:10:47,665 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:47,667 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:47,670 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 82 transitions. [2022-03-15 19:10:47,670 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:49,499 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [4430#(or (<= (+ (* (div (+ (* (div ~s~0 4294967296) (- 4294967296)) ~s~0 (* 4294967296 (div (+ (* (div ~t~0 4294967296) 4294967296) (* (- 1) ~s~0) (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296)) 1) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~T~0 ~S~0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))), 4427#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0))), 4428#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~s~0 ~m~0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~s~0 ~m~0)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), 4429#(and (or (<= (+ (* (div (+ (* (div ~s~0 4294967296) (- 4294967296)) ~s~0 (* 4294967296 (div (+ (* (div ~t~0 4294967296) 4294967296) (* (- 1) ~s~0) (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296)) 1) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~T~0 ~S~0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (= thread1Thread1of1ForFork1_~cond~0 0)) (or (= (+ (* (- 1) thread1Thread1of1ForFork1_~cond~0) 1) 0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)))), 4426#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 4431#(or (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)) (<= (+ (* (div (+ (* 4294967296 (div (+ (* (- 1) ~s~0) (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 4294967296) 4294967296)) (* (div ~s~0 4294967296) (- 4294967296)) ~s~0 1) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~T~0 ~S~0)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)))] [2022-03-15 19:10:49,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:10:49,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:10:49,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:10:49,500 INFO L87 Difference]: Start difference. First operand 146 states and 342 transitions. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 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 19:10:57,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:11:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:01,359 INFO L93 Difference]: Finished difference Result 262 states and 614 transitions. [2022-03-15 19:11:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:11:01,359 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 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 19 [2022-03-15 19:11:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:01,360 INFO L225 Difference]: With dead ends: 262 [2022-03-15 19:11:01,360 INFO L226 Difference]: Without dead ends: 206 [2022-03-15 19:11:01,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=644, Invalid=2896, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:11:01,361 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 75 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:01,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 580 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 19:11:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-03-15 19:11:01,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 154. [2022-03-15 19:11:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.4052287581699345) internal successors, (368), 153 states have internal predecessors, (368), 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 19:11:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 368 transitions. [2022-03-15 19:11:01,366 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 368 transitions. Word has length 19 [2022-03-15 19:11:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:01,366 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 368 transitions. [2022-03-15 19:11:01,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 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 19:11:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 368 transitions. [2022-03-15 19:11:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:11:01,366 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:01,366 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:01,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 19:11:01,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-03-15 19:11:01,588 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:11:01,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash 354640472, now seen corresponding path program 6 times [2022-03-15 19:11:01,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:01,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199162708] [2022-03-15 19:11:01,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:01,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:01,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:01,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199162708] [2022-03-15 19:11:01,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199162708] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:01,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966979768] [2022-03-15 19:11:01,980 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:11:01,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:01,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:01,982 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:11:01,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:11:02,099 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:11:02,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:02,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:11:02,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:02,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:04,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966979768] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:04,168 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:04,168 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-03-15 19:11:04,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [561538759] [2022-03-15 19:11:04,168 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:04,169 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:04,173 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 72 transitions. [2022-03-15 19:11:04,173 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:05,556 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5191#(and (or (<= 0 ~m~0) (<= (+ (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 4294967296) ~t~0) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))))) (or (<= (+ ~T~0 ~S~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296)) 1) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0)) (or (<= (+ (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 4294967296) ~t~0) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (+ 2 ~T~0 ~S~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0))))] [2022-03-15 19:11:05,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:11:05,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:05,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:11:05,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:11:05,557 INFO L87 Difference]: Start difference. First operand 154 states and 368 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 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 19:11:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:06,044 INFO L93 Difference]: Finished difference Result 235 states and 559 transitions. [2022-03-15 19:11:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:11:06,045 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 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 19 [2022-03-15 19:11:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:06,046 INFO L225 Difference]: With dead ends: 235 [2022-03-15 19:11:06,046 INFO L226 Difference]: Without dead ends: 210 [2022-03-15 19:11:06,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:11:06,047 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:06,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:11:06,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-03-15 19:11:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 160. [2022-03-15 19:11:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.4213836477987423) internal successors, (385), 159 states have internal predecessors, (385), 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 19:11:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 385 transitions. [2022-03-15 19:11:06,051 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 385 transitions. Word has length 19 [2022-03-15 19:11:06,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:06,051 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 385 transitions. [2022-03-15 19:11:06,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 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 19:11:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 385 transitions. [2022-03-15 19:11:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:11:06,052 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:06,052 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:06,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 19:11:06,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 19:11:06,259 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:11:06,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash 191842360, now seen corresponding path program 7 times [2022-03-15 19:11:06,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:06,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138764026] [2022-03-15 19:11:06,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:07,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:07,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138764026] [2022-03-15 19:11:07,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138764026] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:07,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421918558] [2022-03-15 19:11:07,066 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:11:07,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:07,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:07,067 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:11:07,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:11:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:07,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:11:07,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:07,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:09,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421918558] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:09,558 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:09,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-03-15 19:11:09,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [958915013] [2022-03-15 19:11:09,558 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:09,559 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:09,563 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 72 transitions. [2022-03-15 19:11:09,563 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:11,603 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [5893#(and (or (<= (+ ~T~0 ~S~0 1) (+ ~t~0 ~s~0 ~m~0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (<= (div ~m~0 4294967296) 0) (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) (div ~m~0 4294967296)) (div (+ ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) (div ~m~0 4294967296)) (div (+ ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)))), 5892#(and (or (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (+ (div ~t~0 4294967296) (div ~s~0 4294967296) (div ~m~0 4294967296)) (div (+ ~T~0 ~S~0) 4294967296))) (or (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 ~m~0)) (<= (div ~m~0 4294967296) 0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 ~m~0)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0))) (or (<= (div ~m~0 4294967296) 0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (div ~t~0 4294967296) (div ~s~0 4294967296) (div ~m~0 4294967296)) (div (+ ~T~0 ~S~0) 4294967296))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (< 0 (+ (div ~m~0 4294967296) 1)))), 5890#(and (or (not (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)))), 5891#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)))] [2022-03-15 19:11:11,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:11:11,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:11,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:11:11,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:11:11,604 INFO L87 Difference]: Start difference. First operand 160 states and 385 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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 19:11:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:17,534 INFO L93 Difference]: Finished difference Result 302 states and 728 transitions. [2022-03-15 19:11:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:11:17,535 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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 19 [2022-03-15 19:11:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:17,536 INFO L225 Difference]: With dead ends: 302 [2022-03-15 19:11:17,536 INFO L226 Difference]: Without dead ends: 262 [2022-03-15 19:11:17,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=471, Invalid=2079, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:11:17,537 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:17,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:11:17,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-03-15 19:11:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 180. [2022-03-15 19:11:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.452513966480447) internal successors, (439), 179 states have internal predecessors, (439), 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 19:11:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 439 transitions. [2022-03-15 19:11:17,541 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 439 transitions. Word has length 19 [2022-03-15 19:11:17,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:17,541 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 439 transitions. [2022-03-15 19:11:17,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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 19:11:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 439 transitions. [2022-03-15 19:11:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:11:17,542 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:17,542 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:17,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:11:17,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 19:11:17,746 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:11:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:17,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1333046471, now seen corresponding path program 8 times [2022-03-15 19:11:17,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:17,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853336501] [2022-03-15 19:11:17,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:17,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:18,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:18,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853336501] [2022-03-15 19:11:18,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853336501] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:18,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774284218] [2022-03-15 19:11:18,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:11:18,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:18,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:18,772 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:11:18,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:11:18,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:11:18,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:18,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:11:18,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:19,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:23,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774284218] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:23,467 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:23,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 19:11:23,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [138815786] [2022-03-15 19:11:23,468 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:23,469 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:23,476 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 114 transitions. [2022-03-15 19:11:23,476 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:14,289 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [6748#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 6751#(and (or (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) 1) (div (+ ~T~0 ~S~0) 4294967296)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) 1) (div (+ ~T~0 ~S~0) 4294967296)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) (div ~m~0 4294967296)) (div (+ ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)) (<= (+ ~T~0 ~S~0) (+ 3 ~s~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296)))) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) 1) (div (+ ~T~0 ~S~0) 4294967296)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) 1) (div (+ ~T~0 ~S~0) 4294967296)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (+ ~T~0 ~S~0) (+ ~s~0 ~m~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (not (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) 1) (div (+ ~T~0 ~S~0) 4294967296))) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)) (<= (+ ~T~0 ~S~0) (+ 3 ~s~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296))))), 6754#(and (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 1)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296)) 1) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (not (< 0 (mod ~s~0 4294967296))) (<= 1 ~m~0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1)) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0 1) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~T~0 ~S~0) (+ 2 ~t~0 ~s~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296)))) (or (<= (+ ~T~0 ~S~0) (+ 2 ~t~0 ~s~0)) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= ~s~0 (+ (* (div (+ (* (- 1) ~S~0) ~t~0 ~s~0 ~m~0 (* (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296) (* (- 1) ~T~0)) 4294967296) 4294967296) 4294967294))) (or (<= 2 ~m~0) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296)) 1) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= 2 ~m~0) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0 1) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 1)) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (<= (mod ~s~0 4294967296) 0) (<= 0 (+ ~m~0 1)) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (<= 0 ~m~0) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296))))), 6750#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (+ (div ~t~0 4294967296) (div ~s~0 4294967296) 1) (div (+ ~T~0 ~S~0) 4294967296)) (<= (+ ~T~0 ~S~0) (+ (* (div ~t~0 4294967296) 4294967296) ~s~0 ~m~0))) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (+ (div ~t~0 4294967296) (div ~s~0 4294967296) 1) (div (+ ~T~0 ~S~0) 4294967296))) (or (<= (+ ~T~0 ~S~0) (+ (* (div ~t~0 4294967296) 4294967296) 3 ~s~0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (+ ~T~0 ~S~0) (+ (* (div ~t~0 4294967296) 4294967296) 3 ~s~0)) (not (<= (+ (div ~t~0 4294967296) (div ~s~0 4294967296) 1) (div (+ ~T~0 ~S~0) 4294967296))) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (div ~t~0 4294967296) (div ~s~0 4294967296) 1) (div (+ ~T~0 ~S~0) 4294967296)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (+ (div ~t~0 4294967296) (div ~s~0 4294967296) 1) (div (+ ~T~0 ~S~0) 4294967296)) (<= (+ (div ~t~0 4294967296) (div ~s~0 4294967296) (div ~m~0 4294967296)) (div (+ ~T~0 ~S~0) 4294967296)))), 6755#(and (or (<= (mod ~t~0 4294967296) 0) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= 0 ~m~0) (<= (mod ~t~0 4294967296) 0) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) 2 ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod (+ 4294967295 ~s~0) 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296)) 1) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= (mod ~t~0 4294967296) 0) (<= (+ ~T~0 ~S~0) (+ 2 ~t~0 ~s~0)) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296)) 1) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0 1) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= 1 ~m~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (<= 2 ~m~0) (<= (mod ~t~0 4294967296) 0) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0 1) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= 0 ~m~0) (not (< 0 (mod ~s~0 4294967296))) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod (+ 4294967295 ~s~0) 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296)) 1) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= ~s~0 (+ (* (div (+ (- 2) ~s~0) 4294967296) 4294967296) 2))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* (div ~t~0 4294967296) 4294967296) 2 ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296))) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod (+ 4294967295 ~s~0) 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296)) 1) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= 2 ~m~0) (<= (mod ~t~0 4294967296) 0) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) 2 ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod (+ 4294967295 ~s~0) 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296)) 1) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0 1) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 1)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 1)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296)) 1) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (not (< 0 (mod ~s~0 4294967296))) (<= ~s~0 (+ (* (div (+ (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296) (* (- 1) ~S~0) ~t~0 ~s~0 ~m~0 (* (- 1) ~T~0)) 4294967296) 4294967296) 4294967295)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod (+ 4294967295 ~s~0) 4294967296)))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* (div ~t~0 4294967296) 4294967296) 2 ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296))) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod (+ 4294967295 ~s~0) 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296)) 1) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= 0 (+ ~m~0 1)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296)) 1) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= 1 ~m~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (<= (mod ~t~0 4294967296) 0) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~T~0 ~S~0) (+ 2 ~t~0 ~s~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (< 0 (mod ~s~0 4294967296))) (<= (mod (+ 4294967295 ~s~0) 4294967296) 0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296)) 1) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= 0 (+ 2 ~m~0))) (or (<= (mod ~t~0 4294967296) 0) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0)))), 6749#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0))), 6753#(and (or (<= 2 ~m~0) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= (mod ~s~0 4294967296) 0) (<= 0 (+ ~m~0 1)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0 1) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0 1) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 1)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~T~0 ~S~0) (+ 2 ~t~0 ~s~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= ~s~0 (+ (* (div (+ (* (- 1) ~S~0) ~t~0 ~s~0 ~m~0 (* (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296) (* (- 1) ~T~0)) 4294967296) 4294967296) 4294967294))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296)) 1) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= 0 ~m~0) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 1)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296)) 1) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= 2 ~m~0) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (< 0 (mod ~s~0 4294967296))) (<= 1 ~m~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1)) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= (+ ~T~0 ~S~0) (+ 2 ~t~0 ~s~0)) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 6756#(and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 1)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296)) 1) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296)) 1) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (not (< 0 (mod ~s~0 4294967296))) (<= ~s~0 (+ (* (div (+ (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296) (* (- 1) ~S~0) ~t~0 ~s~0 ~m~0 (* (- 1) ~T~0)) 4294967296) 4294967296) 4294967295)) (not (< 0 (mod (+ 4294967295 ~s~0) 4294967296)))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* (div ~t~0 4294967296) 4294967296) 2 ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296))) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (not (< 0 (mod (+ 4294967295 ~s~0) 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296)) 1) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) 2 ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (not (< 0 (mod (+ 4294967295 ~s~0) 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296)) 1) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~T~0 ~S~0) (+ 2 ~t~0 ~s~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) 2 ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (not (< 0 (mod (+ 4294967295 ~s~0) 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296)) 1) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0 1) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 1)) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0 1) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= 1 ~m~0) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (<= (+ ~T~0 ~S~0) (+ 2 ~t~0 ~s~0)) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296)))) (or (<= 2 ~m~0) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296)))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296)) 1) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= 1 ~m~0) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (or (<= 0 ~m~0) (not (< 0 (mod ~s~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~s~0) 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296)) 1) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= ~s~0 (+ (* (div (+ (- 2) ~s~0) 4294967296) 4294967296) 2))) (or (<= 2 ~m~0) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (mod (+ 4294967295 ~s~0) 4294967296) 0) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296)) 1) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= 0 (+ 2 ~m~0))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0 1) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* (div ~t~0 4294967296) 4294967296) 2 ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296))) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (not (< 0 (mod (+ 4294967295 ~s~0) 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 4294967293) 4294967296)) 1) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= 0 ~m~0) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (< 0 (mod ~s~0 4294967296)) (not (< 0 (mod ~t~0 4294967296)))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (<= 0 (+ ~m~0 1)) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~m~0 (* 4294967296 (div (+ (* (- 1) ~t~0) 4294967294 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)))), 6752#(and (or (<= 2 ~m~0) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))) (or (<= 2 ~m~0) (<= ~s~0 (+ 4294967294 (* (div ~s~0 4294967296) 4294967296)))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= (+ ~T~0 ~S~0) (+ 2 ~t~0 ~s~0)) (<= ~s~0 (+ 4294967294 (* (div ~s~0 4294967296) 4294967296)))) (or (<= 0 ~m~0) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)))) (or (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~T~0 ~S~0) (+ 2 ~t~0 ~s~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)))) (or (<= ~s~0 (+ 4294967294 (* (div ~s~0 4294967296) 4294967296))) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296))) (<= ~s~0 (+ (* (div (+ (* (div (+ (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) 1) 4294967296) 4294967296) (* (- 1) ~S~0) ~t~0 ~s~0 ~m~0 (* (- 1) ~T~0)) 4294967296) 4294967296) 4294967293))) (or (<= (+ ~T~0 ~S~0) (+ 2 ~t~0 ~s~0)) (<= (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~t~0 ~m~0) (+ (* (div ~t~0 4294967296) 4294967296) ~T~0 ~S~0)) (<= (+ ~m~0 (* (div (+ (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ 1 (* (div (+ (- 1) (* (- 1) ~t~0) ~T~0 ~S~0) 4294967296) 4294967296)))))] [2022-03-15 19:12:14,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:12:14,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:12:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1139, Unknown=7, NotChecked=0, Total=1332 [2022-03-15 19:12:14,293 INFO L87 Difference]: Start difference. First operand 180 states and 439 transitions. Second operand has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 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 19:12:32,339 WARN L228 SmtUtils]: Spent 7.19s on a formula simplification. DAG size of input: 149 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 19:12:41,083 WARN L228 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 162 DAG size of output: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 19:12:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:47,200 INFO L93 Difference]: Finished difference Result 289 states and 698 transitions. [2022-03-15 19:12:47,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 19:12:47,200 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 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 19:12:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:47,201 INFO L225 Difference]: With dead ends: 289 [2022-03-15 19:12:47,201 INFO L226 Difference]: Without dead ends: 284 [2022-03-15 19:12:47,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 38 SyntacticMatches, 19 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 56.9s TimeCoverageRelationStatistics Valid=478, Invalid=3294, Unknown=10, NotChecked=0, Total=3782 [2022-03-15 19:12:47,202 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 81 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:47,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 1 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 19:12:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-03-15 19:12:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 204. [2022-03-15 19:12:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.477832512315271) internal successors, (503), 203 states have internal predecessors, (503), 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 19:12:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 503 transitions. [2022-03-15 19:12:47,207 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 503 transitions. Word has length 21 [2022-03-15 19:12:47,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:47,207 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 503 transitions. [2022-03-15 19:12:47,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 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 19:12:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 503 transitions. [2022-03-15 19:12:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:12:47,208 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:47,208 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:47,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-15 19:12:47,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 19:12:47,408 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:12:47,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:47,409 INFO L85 PathProgramCache]: Analyzing trace with hash -129744281, now seen corresponding path program 9 times [2022-03-15 19:12:47,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:47,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727044884] [2022-03-15 19:12:47,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:47,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:47,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:47,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727044884] [2022-03-15 19:12:47,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727044884] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:47,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072708973] [2022-03-15 19:12:47,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:12:47,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:47,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:47,487 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:47,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:12:47,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:12:47,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:47,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:12:47,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:47,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:47,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072708973] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:47,895 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:47,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 13 [2022-03-15 19:12:47,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1531579395] [2022-03-15 19:12:47,895 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:47,897 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:47,903 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 95 transitions. [2022-03-15 19:12:47,903 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:48,300 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7637#(or (<= (div (+ (* (- 1) ~s~0) 4294967294) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967296)) 4294967296) 1)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))] [2022-03-15 19:12:48,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:12:48,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:12:48,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:12:48,301 INFO L87 Difference]: Start difference. First operand 204 states and 503 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 19:12:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:48,503 INFO L93 Difference]: Finished difference Result 444 states and 1051 transitions. [2022-03-15 19:12:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:12:48,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 19:12:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:48,505 INFO L225 Difference]: With dead ends: 444 [2022-03-15 19:12:48,505 INFO L226 Difference]: Without dead ends: 444 [2022-03-15 19:12:48,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 9 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:12:48,505 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 69 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:48,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 14 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:12:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-03-15 19:12:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 220. [2022-03-15 19:12:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.5616438356164384) internal successors, (561), 219 states have internal predecessors, (561), 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 19:12:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 561 transitions. [2022-03-15 19:12:48,511 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 561 transitions. Word has length 21 [2022-03-15 19:12:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:48,513 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 561 transitions. [2022-03-15 19:12:48,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 19:12:48,513 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 561 transitions. [2022-03-15 19:12:48,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:12:48,514 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:48,514 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:48,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:48,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:12:48,715 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:12:48,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash -774018631, now seen corresponding path program 10 times [2022-03-15 19:12:48,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:48,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14035847] [2022-03-15 19:12:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:48,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:49,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:49,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14035847] [2022-03-15 19:12:49,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14035847] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:49,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834242725] [2022-03-15 19:12:49,328 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:12:49,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:49,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:49,329 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:49,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:12:49,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:12:49,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:49,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:12:49,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:50,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:51,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834242725] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:51,589 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:51,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-03-15 19:12:51,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [867943329] [2022-03-15 19:12:51,589 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:51,590 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:51,596 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 106 transitions. [2022-03-15 19:12:51,596 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:55,612 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [8696#(and (or (not (< 0 (mod ~s~0 4294967296))) (<= (div (+ (* (- 1) ~s~0) 1) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967297)) 4294967296) 1)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= ~s~0 (+ (* 4294967296 (div (+ (* (- 1) ~S~0) ~t~0 ~s~0 (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) (* (- 1) ~T~0)) 4294967296)) 4294967295)) (not (< 0 (mod ~s~0 4294967296))) (<= (div (+ (* (- 1) ~s~0) 1) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967297)) 4294967296) 1))) (or (<= 0 ~m~0) (not (< 0 (mod ~s~0 4294967296))) (<= (div (+ (* (- 1) ~s~0) 1) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967297)) 4294967296) 1)))), 8695#(and (or (<= 0 ~m~0) (not (< 0 (mod ~s~0 4294967296))) (<= (div (+ (* (- 1) ~s~0) 1) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967297)) 4294967296) 1)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (< 0 (mod ~s~0 4294967296))) (<= (div (+ (* (- 1) ~s~0) 1) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967297)) 4294967296) 1)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= ~s~0 (+ (* 4294967296 (div (+ (* (- 1) ~S~0) ~t~0 ~s~0 (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) (* (- 1) ~T~0)) 4294967296)) 4294967295)) (not (< 0 (mod ~s~0 4294967296))) (<= (div (+ (* (- 1) ~s~0) 1) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967297)) 4294967296) 1)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 8691#(and (or (<= (+ ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296)) 4294967293) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~s~0)) (<= (+ 4294967295 (* (div ~s~0 4294967296) 4294967296)) ~s~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (+ 4294967295 (* (div ~s~0 4294967296) 4294967296)) ~s~0) (<= (div ~m~0 4294967296) 0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (<= (+ ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~s~0 ~m~0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (<= (+ 4294967295 (* (div ~s~0 4294967296) 4294967296)) ~s~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 8694#(and (or (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)) (<= ~s~0 (+ 4294967294 (* 4294967296 (div (+ (* (- 1) ~S~0) (* (div (+ (- 1) ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296) ~t~0 ~s~0 (* (div (+ (- 1) ~t~0) 4294967296) (- 4294967296)) (* (- 1) ~T~0) 1) 4294967296)))) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)) (<= ~m~0 2)) (or (<= (+ (* 4294967296 (div (+ (* (- 1) ~s~0) (* (- 1) ~t~0) ~T~0 ~S~0 (* (- 1) ~m~0) (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 4294967296) 4294967296)) 2 ~s~0) (+ ~T~0 ~S~0)) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)))), 8692#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)) (<= ~s~0 (+ 4294967294 (* (div (+ (* (- 1) ~S~0) 2 (* (div (+ (- 1) ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296) ~s~0 (* (- 1) ~T~0)) 4294967296) 4294967296)))) (or (not (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= (* (- 1) thread1Thread1of1ForFork1_~cond~0) 0)) (or (<= (+ 2 ~s~0 (* (div (+ (* (- 1) ~s~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296)) (+ ~T~0 ~S~0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))) (or (= (+ (* (- 1) thread1Thread1of1ForFork1_~cond~0) 1) 0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)) (<= ~m~0 2)) (or (not (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)))), 8689#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 8690#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0))), 8693#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ 2 ~s~0 (* 4294967296 (div (+ (* (div ~t~0 4294967296) 4294967296) (* (- 1) ~s~0) (* (- 1) ~t~0) 4294967295 ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296))) (+ ~T~0 ~S~0)) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)) (<= ~m~0 2)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~s~0 (+ 4294967294 (* (div (+ (* (- 1) ~S~0) 2 (* (div (+ (- 1) ~T~0 ~S~0 (* (- 1) ~m~0)) 4294967296) 4294967296) ~t~0 ~s~0 (* (div ~t~0 4294967296) (- 4294967296)) (* (- 1) ~T~0)) 4294967296) 4294967296))) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))))] [2022-03-15 19:12:55,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:12:55,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:55,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:12:55,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1267, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:12:55,614 INFO L87 Difference]: Start difference. First operand 220 states and 561 transitions. Second operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 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 19:12:59,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:13:04,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:13:06,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:13:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:08,223 INFO L93 Difference]: Finished difference Result 324 states and 785 transitions. [2022-03-15 19:13:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:13:08,224 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 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 19:13:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:08,225 INFO L225 Difference]: With dead ends: 324 [2022-03-15 19:13:08,225 INFO L226 Difference]: Without dead ends: 314 [2022-03-15 19:13:08,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 34 SyntacticMatches, 18 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=496, Invalid=3164, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:13:08,226 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 46 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:08,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1122 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-03-15 19:13:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-03-15 19:13:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 224. [2022-03-15 19:13:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 2.5515695067264574) internal successors, (569), 223 states have internal predecessors, (569), 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 19:13:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 569 transitions. [2022-03-15 19:13:08,231 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 569 transitions. Word has length 21 [2022-03-15 19:13:08,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:08,231 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 569 transitions. [2022-03-15 19:13:08,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 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 19:13:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 569 transitions. [2022-03-15 19:13:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:13:08,232 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:08,232 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:08,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:08,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:13:08,433 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:13:08,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash 53369049, now seen corresponding path program 11 times [2022-03-15 19:13:08,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:08,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125217217] [2022-03-15 19:13:08,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:08,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:08,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:08,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125217217] [2022-03-15 19:13:08,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125217217] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:08,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821337071] [2022-03-15 19:13:08,868 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:13:08,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:08,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:08,871 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:08,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:13:08,973 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:13:08,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:08,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:13:08,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:09,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:11,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821337071] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:11,433 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:11,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 33 [2022-03-15 19:13:11,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1599716914] [2022-03-15 19:13:11,433 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:11,435 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:11,439 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 96 transitions. [2022-03-15 19:13:11,439 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:12,995 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [9669#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= 1 thread1Thread1of1ForFork1_~cond~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0))), 9673#(or (<= (mod ~s~0 4294967296) 0) (<= (+ (div (+ (* (- 1) ~s~0) (* (- 1) ~t~0) ~T~0 ~S~0 (- 4294967296)) (- 4294967296)) (div (+ (- 1) (* (- 1) ~S~0) ~t~0 ~m~0 (* (- 1) ~T~0)) (- 4294967296))) (+ 3 (div (+ ~s~0 (- 4294967297)) 4294967296) (div (* (- 1) ~m~0) 4294967296))) (<= (div (+ (* (- 1) ~s~0) 1) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967297)) 4294967296) 1))), 9672#(or (not (< 0 (mod ~s~0 4294967296))) (<= (+ (div (+ (* (- 1) ~s~0) (* (- 1) ~t~0) ~T~0 ~S~0 (- 4294967296)) (- 4294967296)) (div (+ (- 1) (* (- 1) ~S~0) ~t~0 ~m~0 (* (- 1) ~T~0)) (- 4294967296))) (+ 3 (div (+ ~s~0 (- 4294967297)) 4294967296) (div (* (- 1) ~m~0) 4294967296))) (<= (div (+ (* (- 1) ~s~0) 1) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967297)) 4294967296) 1)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 9670#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 9671#(and (or (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)))), 9668#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))))] [2022-03-15 19:13:12,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:13:12,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:12,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:13:12,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1370, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:13:12,996 INFO L87 Difference]: Start difference. First operand 224 states and 569 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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 19:13:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:15,947 INFO L93 Difference]: Finished difference Result 311 states and 771 transitions. [2022-03-15 19:13:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:13:15,948 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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 21 [2022-03-15 19:13:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:15,949 INFO L225 Difference]: With dead ends: 311 [2022-03-15 19:13:15,949 INFO L226 Difference]: Without dead ends: 306 [2022-03-15 19:13:15,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=591, Invalid=3315, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 19:13:15,950 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:15,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:13:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-03-15 19:13:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 238. [2022-03-15 19:13:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.590717299578059) internal successors, (614), 237 states have internal predecessors, (614), 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 19:13:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 614 transitions. [2022-03-15 19:13:15,957 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 614 transitions. Word has length 21 [2022-03-15 19:13:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:15,957 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 614 transitions. [2022-03-15 19:13:15,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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 19:13:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 614 transitions. [2022-03-15 19:13:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:13:15,958 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:15,958 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:15,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:16,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:16,173 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:13:16,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:16,174 INFO L85 PathProgramCache]: Analyzing trace with hash -109429063, now seen corresponding path program 12 times [2022-03-15 19:13:16,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:16,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050953218] [2022-03-15 19:13:16,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:16,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:16,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050953218] [2022-03-15 19:13:16,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050953218] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:16,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823406392] [2022-03-15 19:13:16,629 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:13:16,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:16,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:16,630 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:16,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:13:16,750 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:13:16,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:16,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:13:16,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:17,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:19,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823406392] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:19,283 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:19,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2022-03-15 19:13:19,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1323086666] [2022-03-15 19:13:19,283 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:19,285 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:19,290 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 96 transitions. [2022-03-15 19:13:19,290 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:21,166 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [10653#(and (or (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 ~m~0)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (or (<= (+ ~t~0 ~s~0) (+ ~T~0 ~S~0)) (not (< 0 (mod ~s~0 4294967296))) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))) (or (not (< 0 (mod ~s~0 4294967296))) (<= ~m~0 0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))) (or (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0)))), 10654#(and (or (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 ~m~0)) (not (< 0 (mod ~s~0 4294967296)))) (or (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 ~m~0)) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~s~0 4294967296))) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (not (< 0 (mod ~s~0 4294967296))) (<= ~m~0 0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))) (or (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= (+ ~t~0 ~s~0) (+ ~T~0 ~S~0)) (not (< 0 (mod ~s~0 4294967296))) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1)))), 10652#(and (or (<= (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0)) (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) (div ~m~0 4294967296)) (div (+ ~T~0 ~S~0) 4294967296))) (<= (+ ~T~0 ~S~0 1) (+ ~t~0 ~s~0 ~m~0)) (or (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) (div ~m~0 4294967296) 1) (div (+ ~T~0 ~S~0) 4294967296)) (< (+ (* 4294967296 (div (+ ~T~0 ~S~0) 4294967296)) ~m~0) (+ ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (div ~m~0 4294967296) 0) (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) (div ~m~0 4294967296)) (div (+ ~T~0 ~S~0) 4294967296))))] [2022-03-15 19:13:21,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:13:21,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:21,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:13:21,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:13:21,167 INFO L87 Difference]: Start difference. First operand 238 states and 614 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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 19:13:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:21,933 INFO L93 Difference]: Finished difference Result 360 states and 888 transitions. [2022-03-15 19:13:21,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:13:21,933 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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 19:13:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:21,934 INFO L225 Difference]: With dead ends: 360 [2022-03-15 19:13:21,935 INFO L226 Difference]: Without dead ends: 326 [2022-03-15 19:13:21,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 21 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=227, Invalid=1105, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:13:21,936 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:21,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:13:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-03-15 19:13:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 242. [2022-03-15 19:13:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.5892116182572615) internal successors, (624), 241 states have internal predecessors, (624), 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 19:13:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 624 transitions. [2022-03-15 19:13:21,941 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 624 transitions. Word has length 21 [2022-03-15 19:13:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:21,942 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 624 transitions. [2022-03-15 19:13:21,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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 19:13:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 624 transitions. [2022-03-15 19:13:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:13:21,942 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:21,942 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:21,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 19:13:22,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:13:22,158 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:13:22,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:22,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1488263077, now seen corresponding path program 13 times [2022-03-15 19:13:22,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:22,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16767898] [2022-03-15 19:13:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:22,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:22,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16767898] [2022-03-15 19:13:22,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16767898] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:22,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636101585] [2022-03-15 19:13:22,400 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:13:22,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:22,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:22,401 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:22,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:13:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:22,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:13:22,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:23,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:23,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636101585] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:23,874 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:23,874 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 33 [2022-03-15 19:13:23,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [7311247] [2022-03-15 19:13:23,874 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:23,876 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:23,879 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 77 transitions. [2022-03-15 19:13:23,880 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:24,749 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [11668#(and (or (not (< 0 (mod ~s~0 4294967296))) (<= (div (+ (* (- 1) ~s~0) 1) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967297)) 4294967296) 1)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 ~m~0)) (not (< 0 (mod ~s~0 4294967296))) (<= (div (+ (* (- 1) ~s~0) 1) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967297)) 4294967296) 1)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 11669#(and (or (not (< 0 (mod ~s~0 4294967296))) (<= (div (+ (* (- 1) ~s~0) 1) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967297)) 4294967296) 1)) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0 ~m~0)) (not (< 0 (mod ~s~0 4294967296))) (<= (div (+ (* (- 1) ~s~0) 1) (- 4294967296)) (+ (div (+ ~s~0 (- 4294967297)) 4294967296) 1))))] [2022-03-15 19:13:24,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:13:24,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:24,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:13:24,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:13:24,750 INFO L87 Difference]: Start difference. First operand 242 states and 624 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 19:13:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:25,192 INFO L93 Difference]: Finished difference Result 281 states and 733 transitions. [2022-03-15 19:13:25,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:13:25,193 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 19:13:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:25,193 INFO L225 Difference]: With dead ends: 281 [2022-03-15 19:13:25,193 INFO L226 Difference]: Without dead ends: 0 [2022-03-15 19:13:25,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 26 SyntacticMatches, 15 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:13:25,194 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:25,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:13:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-15 19:13:25,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-15 19:13:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:13:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-15 19:13:25,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-03-15 19:13:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:25,194 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-15 19:13:25,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 19:13:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-15 19:13:25,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-15 19:13:25,196 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 19:13:25,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 19:13:25,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 19:13:25,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 19:13:25,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 19:13:25,408 INFO L732 BasicCegarLoop]: Path program histogram: [13, 3, 1] [2022-03-15 19:13:25,409 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:13:25,409 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:13:25,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:13:25 BasicIcfg [2022-03-15 19:13:25,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:13:25,412 INFO L158 Benchmark]: Toolchain (without parser) took 315085.36ms. Allocated memory was 166.7MB in the beginning and 457.2MB in the end (delta: 290.5MB). Free memory was 108.5MB in the beginning and 339.1MB in the end (delta: -230.6MB). Peak memory consumption was 60.7MB. Max. memory is 8.0GB. [2022-03-15 19:13:25,413 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 166.7MB. Free memory was 124.6MB in the beginning and 124.5MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:13:25,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.87ms. Allocated memory was 166.7MB in the beginning and 263.2MB in the end (delta: 96.5MB). Free memory was 108.2MB in the beginning and 234.6MB in the end (delta: -126.4MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-03-15 19:13:25,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.54ms. Allocated memory is still 263.2MB. Free memory was 234.6MB in the beginning and 233.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:13:25,414 INFO L158 Benchmark]: Boogie Preprocessor took 13.77ms. Allocated memory is still 263.2MB. Free memory was 233.1MB in the beginning and 231.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:13:25,417 INFO L158 Benchmark]: RCFGBuilder took 304.39ms. Allocated memory is still 263.2MB. Free memory was 231.5MB in the beginning and 217.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-15 19:13:25,419 INFO L158 Benchmark]: TraceAbstraction took 314484.25ms. Allocated memory was 263.2MB in the beginning and 457.2MB in the end (delta: 194.0MB). Free memory was 216.8MB in the beginning and 339.1MB in the end (delta: -122.2MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. [2022-03-15 19:13:25,420 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.14ms. Allocated memory is still 166.7MB. Free memory was 124.6MB in the beginning and 124.5MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.87ms. Allocated memory was 166.7MB in the beginning and 263.2MB in the end (delta: 96.5MB). Free memory was 108.2MB in the beginning and 234.6MB in the end (delta: -126.4MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.54ms. Allocated memory is still 263.2MB. Free memory was 234.6MB in the beginning and 233.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.77ms. Allocated memory is still 263.2MB. Free memory was 233.1MB in the beginning and 231.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 304.39ms. Allocated memory is still 263.2MB. Free memory was 231.5MB in the beginning and 217.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 314484.25ms. Allocated memory was 263.2MB in the beginning and 457.2MB in the end (delta: 194.0MB). Free memory was 216.8MB in the beginning and 339.1MB in the end (delta: -122.2MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 89 PlacesBefore, 25 PlacesAfterwards, 88 TransitionsBefore, 20 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 12 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 77 TotalNumberOfCompositions, 686 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 495, positive: 468, positive conditional: 0, positive unconditional: 468, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 206, positive: 200, positive conditional: 0, positive unconditional: 200, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 495, positive: 268, positive conditional: 0, positive unconditional: 268, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 206, unknown conditional: 0, unknown unconditional: 206] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - 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 - PositiveResult [Line: 95]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 100 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 314.4s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 179.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 1266 SdHoareTripleChecker+Valid, 57.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1266 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 55.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3204 mSDsCounter, 486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8230 IncrementalHoareTripleChecker+Invalid, 8730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 486 mSolverCounterUnsat, 14 mSDtfsCounter, 8230 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1410 GetRequests, 581 SyntacticMatches, 179 SemanticMatches, 650 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11066 ImplicationChecksByTransitivity, 181.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=16, InterpolantAutomatonStates: 349, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 36.5s InterpolantComputationTime, 617 NumberOfCodeBlocks, 617 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 870 ConstructedInterpolants, 0 QuantifiedInterpolants, 37028 SizeOfPredicates, 148 NumberOfNonLiveVariables, 2097 ConjunctsInSsa, 458 ConjunctsInUnsatCore, 49 InterpolantComputations, 2 PerfectInterpolantSequences, 7/273 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-03-15 19:13:25,438 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...