/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/parallel-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 18:53:12,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 18:53:12,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 18:53:12,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 18:53:12,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 18:53:12,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 18:53:12,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 18:53:12,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 18:53:12,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 18:53:12,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 18:53:12,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 18:53:12,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 18:53:12,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 18:53:12,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 18:53:12,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 18:53:12,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 18:53:12,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 18:53:12,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 18:53:12,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 18:53:12,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 18:53:12,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 18:53:12,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 18:53:12,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 18:53:12,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 18:53:12,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 18:53:12,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 18:53:12,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 18:53:12,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 18:53:12,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 18:53:12,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 18:53:12,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 18:53:12,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 18:53:12,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 18:53:12,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 18:53:12,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 18:53:12,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 18:53:12,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 18:53:12,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 18:53:12,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 18:53:12,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 18:53:12,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 18:53:12,628 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 18:53:12,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 18:53:12,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 18:53:12,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 18:53:12,653 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 18:53:12,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 18:53:12,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 18:53:12,654 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 18:53:12,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 18:53:12,654 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 18:53:12,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 18:53:12,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 18:53:12,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 18:53:12,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 18:53:12,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 18:53:12,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 18:53:12,655 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 18:53:12,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 18:53:12,655 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 18:53:12,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 18:53:12,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 18:53:12,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 18:53:12,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 18:53:12,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 18:53:12,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:53:12,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 18:53:12,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 18:53:12,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 18:53:12,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 18:53:12,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 18:53:12,656 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 18:53:12,656 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 18:53:12,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 18:53:12,656 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 18:53:12,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 18:53:12,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 18:53:12,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 18:53:12,870 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 18:53:12,870 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 18:53:12,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2022-03-15 18:53:12,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34256ace/2a8ae2642633472ab133c5a3f2cbc649/FLAGa2fa70a41 [2022-03-15 18:53:13,237 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 18:53:13,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2022-03-15 18:53:13,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34256ace/2a8ae2642633472ab133c5a3f2cbc649/FLAGa2fa70a41 [2022-03-15 18:53:13,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34256ace/2a8ae2642633472ab133c5a3f2cbc649 [2022-03-15 18:53:13,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 18:53:13,674 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 18:53:13,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 18:53:13,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 18:53:13,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 18:53:13,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:53:13" (1/1) ... [2022-03-15 18:53:13,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e70159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13, skipping insertion in model container [2022-03-15 18:53:13,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:53:13" (1/1) ... [2022-03-15 18:53:13,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 18:53:13,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 18:53:13,838 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/parallel-min-max-1.wvr.c[3057,3070] [2022-03-15 18:53:13,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:53:13,849 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 18:53:13,864 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/parallel-min-max-1.wvr.c[3057,3070] [2022-03-15 18:53:13,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:53:13,883 INFO L208 MainTranslator]: Completed translation [2022-03-15 18:53:13,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13 WrapperNode [2022-03-15 18:53:13,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 18:53:13,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 18:53:13,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 18:53:13,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 18:53:13,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13" (1/1) ... [2022-03-15 18:53:13,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13" (1/1) ... [2022-03-15 18:53:13,926 INFO L137 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2022-03-15 18:53:13,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 18:53:13,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 18:53:13,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 18:53:13,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 18:53:13,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13" (1/1) ... [2022-03-15 18:53:13,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13" (1/1) ... [2022-03-15 18:53:13,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13" (1/1) ... [2022-03-15 18:53:13,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13" (1/1) ... [2022-03-15 18:53:13,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13" (1/1) ... [2022-03-15 18:53:13,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13" (1/1) ... [2022-03-15 18:53:13,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13" (1/1) ... [2022-03-15 18:53:13,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 18:53:13,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 18:53:13,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 18:53:13,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 18:53:13,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13" (1/1) ... [2022-03-15 18:53:13,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:53:13,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:13,995 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 18:53:14,013 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 18:53:14,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 18:53:14,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 18:53:14,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 18:53:14,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 18:53:14,029 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 18:53:14,030 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 18:53:14,030 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 18:53:14,030 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 18:53:14,030 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 18:53:14,031 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 18:53:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 18:53:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 18:53:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 18:53:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 18:53:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 18:53:14,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 18:53:14,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 18:53:14,033 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 18:53:14,113 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 18:53:14,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 18:53:14,374 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 18:53:14,414 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 18:53:14,414 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 18:53:14,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:53:14 BoogieIcfgContainer [2022-03-15 18:53:14,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 18:53:14,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 18:53:14,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 18:53:14,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 18:53:14,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 06:53:13" (1/3) ... [2022-03-15 18:53:14,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284d57d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:53:14, skipping insertion in model container [2022-03-15 18:53:14,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:13" (2/3) ... [2022-03-15 18:53:14,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284d57d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:53:14, skipping insertion in model container [2022-03-15 18:53:14,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:53:14" (3/3) ... [2022-03-15 18:53:14,421 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2022-03-15 18:53:14,425 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 18:53:14,425 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 18:53:14,425 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 18:53:14,425 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 18:53:14,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,460 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,460 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,460 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,460 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,460 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,460 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,461 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,462 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,463 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,463 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,463 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,463 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,464 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,464 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,464 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,464 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,464 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,464 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,464 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,465 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,465 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,465 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,465 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,465 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,465 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,465 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,465 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,465 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,465 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,466 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,466 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,466 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,466 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,466 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,466 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,467 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,467 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,467 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,468 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,468 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,468 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,468 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,471 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,471 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,471 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,471 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,471 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,471 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,472 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,472 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,472 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,472 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,472 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,473 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,473 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,473 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,473 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,473 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,473 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,473 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:14,477 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 18:53:14,505 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 18:53:14,509 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 18:53:14,510 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 18:53:14,519 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 18:53:14,525 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 176 transitions, 376 flow [2022-03-15 18:53:14,527 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 176 transitions, 376 flow [2022-03-15 18:53:14,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 174 places, 176 transitions, 376 flow [2022-03-15 18:53:14,570 INFO L129 PetriNetUnfolder]: 12/173 cut-off events. [2022-03-15 18:53:14,570 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 18:53:14,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 173 events. 12/173 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 142. Up to 2 conditions per place. [2022-03-15 18:53:14,575 INFO L116 LiptonReduction]: Number of co-enabled transitions 1134 [2022-03-15 18:53:19,201 INFO L131 LiptonReduction]: Checked pairs total: 1824 [2022-03-15 18:53:19,201 INFO L133 LiptonReduction]: Total number of compositions: 172 [2022-03-15 18:53:19,212 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 28 transitions, 80 flow [2022-03-15 18:53:19,243 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 129 states, 128 states have (on average 2.78125) internal successors, (356), 128 states have internal predecessors, (356), 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 18:53:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 128 states have (on average 2.78125) internal successors, (356), 128 states have internal predecessors, (356), 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 18:53:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 18:53:19,253 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:19,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:19,253 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:19,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:19,257 INFO L85 PathProgramCache]: Analyzing trace with hash -935065826, now seen corresponding path program 1 times [2022-03-15 18:53:19,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:19,273 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394043819] [2022-03-15 18:53:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:19,424 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 18:53:19,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:19,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394043819] [2022-03-15 18:53:19,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394043819] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:19,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:19,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:53:19,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [498768026] [2022-03-15 18:53:19,427 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:19,433 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:19,461 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 142 transitions. [2022-03-15 18:53:19,461 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:19,815 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [439#(< thread1Thread1of1ForFork0_~i~0 ~N~0)] [2022-03-15 18:53:19,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 18:53:19,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 18:53:19,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 18:53:19,845 INFO L87 Difference]: Start difference. First operand has 129 states, 128 states have (on average 2.78125) internal successors, (356), 128 states have internal predecessors, (356), 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 8.0) internal successors, (40), 4 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 18:53:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:19,920 INFO L93 Difference]: Finished difference Result 155 states and 432 transitions. [2022-03-15 18:53:19,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 18:53:19,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 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 18:53:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:19,928 INFO L225 Difference]: With dead ends: 155 [2022-03-15 18:53:19,929 INFO L226 Difference]: Without dead ends: 155 [2022-03-15 18:53:19,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 18:53:19,931 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:19,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:53:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-03-15 18:53:19,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-03-15 18:53:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.8051948051948052) internal successors, (432), 154 states have internal predecessors, (432), 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 18:53:19,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 432 transitions. [2022-03-15 18:53:19,962 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 432 transitions. Word has length 21 [2022-03-15 18:53:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:19,963 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 432 transitions. [2022-03-15 18:53:19,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 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 18:53:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 432 transitions. [2022-03-15 18:53:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:53:19,964 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:19,964 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:19,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 18:53:19,965 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:19,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:19,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1073114573, now seen corresponding path program 1 times [2022-03-15 18:53:19,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:19,971 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237934940] [2022-03-15 18:53:19,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:19,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:20,044 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:20,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237934940] [2022-03-15 18:53:20,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237934940] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:20,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:20,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:53:20,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [95410195] [2022-03-15 18:53:20,045 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:20,048 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:20,060 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 109 transitions. [2022-03-15 18:53:20,060 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:20,369 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [909#(< thread2Thread1of1ForFork1_~i~1 ~N~0)] [2022-03-15 18:53:20,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 18:53:20,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:20,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 18:53:20,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 18:53:20,371 INFO L87 Difference]: Start difference. First operand 155 states and 432 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 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 18:53:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:20,429 INFO L93 Difference]: Finished difference Result 189 states and 532 transitions. [2022-03-15 18:53:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 18:53:20,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 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 22 [2022-03-15 18:53:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:20,433 INFO L225 Difference]: With dead ends: 189 [2022-03-15 18:53:20,434 INFO L226 Difference]: Without dead ends: 189 [2022-03-15 18:53:20,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 18:53:20,435 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:20,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:53:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-03-15 18:53:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-03-15 18:53:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.8297872340425534) internal successors, (532), 188 states have internal predecessors, (532), 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 18:53:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 532 transitions. [2022-03-15 18:53:20,466 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 532 transitions. Word has length 22 [2022-03-15 18:53:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:20,466 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 532 transitions. [2022-03-15 18:53:20,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 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 18:53:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 532 transitions. [2022-03-15 18:53:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 18:53:20,468 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:20,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:20,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 18:53:20,468 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash -868044926, now seen corresponding path program 1 times [2022-03-15 18:53:20,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:20,470 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406778063] [2022-03-15 18:53:20,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:20,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:53:20,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:20,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406778063] [2022-03-15 18:53:20,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406778063] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:20,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:20,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 18:53:20,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1244446696] [2022-03-15 18:53:20,526 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:20,529 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:20,538 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 93 transitions. [2022-03-15 18:53:20,538 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:20,725 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:53:20,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 18:53:20,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:20,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 18:53:20,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:53:20,728 INFO L87 Difference]: Start difference. First operand 189 states and 532 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:20,768 INFO L93 Difference]: Finished difference Result 190 states and 533 transitions. [2022-03-15 18:53:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:53:20,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 18:53:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:20,770 INFO L225 Difference]: With dead ends: 190 [2022-03-15 18:53:20,770 INFO L226 Difference]: Without dead ends: 190 [2022-03-15 18:53:20,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:53:20,771 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:20,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:53:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-03-15 18:53:20,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-03-15 18:53:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.82010582010582) internal successors, (533), 189 states have internal predecessors, (533), 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 18:53:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 533 transitions. [2022-03-15 18:53:20,780 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 533 transitions. Word has length 23 [2022-03-15 18:53:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:20,781 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 533 transitions. [2022-03-15 18:53:20,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 533 transitions. [2022-03-15 18:53:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:53:20,782 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:20,782 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:20,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 18:53:20,783 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:20,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:20,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1644130522, now seen corresponding path program 1 times [2022-03-15 18:53:20,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:20,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245939193] [2022-03-15 18:53:20,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:53:20,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:20,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245939193] [2022-03-15 18:53:20,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245939193] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:20,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41601193] [2022-03-15 18:53:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:20,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:20,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:20,992 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 18:53:20,995 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 18:53:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:21,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 18:53:21,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:21,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 18:53:21,199 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 18:53:21,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:53:21,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 18:53:21,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 18:53:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:21,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:21,740 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_108 (Array Int Int))) (<= c_~min~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_108) c_~A~0.base) c_~A~0.offset))) (= (mod c_~b1~0 256) 0)) is different from false [2022-03-15 18:53:21,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_108 (Array Int Int))) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_108) c_~A~0.base) c_~A~0.offset))) is different from false [2022-03-15 18:53:21,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_107 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_107))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-03-15 18:53:21,901 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:21,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 33 [2022-03-15 18:53:21,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 214 [2022-03-15 18:53:21,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2022-03-15 18:53:21,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-03-15 18:53:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 18:53:21,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41601193] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:21,943 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:21,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 28 [2022-03-15 18:53:21,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2088266202] [2022-03-15 18:53:21,943 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:21,946 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:21,973 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 94 transitions. [2022-03-15 18:53:21,973 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:22,517 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:53:22,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:53:22,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:22,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:53:22,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=564, Unknown=9, NotChecked=156, Total=870 [2022-03-15 18:53:22,518 INFO L87 Difference]: Start difference. First operand 190 states and 533 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:22,958 INFO L93 Difference]: Finished difference Result 639 states and 1756 transitions. [2022-03-15 18:53:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 18:53:22,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 18:53:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:22,961 INFO L225 Difference]: With dead ends: 639 [2022-03-15 18:53:22,961 INFO L226 Difference]: Without dead ends: 358 [2022-03-15 18:53:22,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=319, Invalid=1166, Unknown=9, NotChecked=228, Total=1722 [2022-03-15 18:53:22,963 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:22,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:53:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-03-15 18:53:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 202. [2022-03-15 18:53:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 2.756218905472637) internal successors, (554), 201 states have internal predecessors, (554), 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 18:53:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 554 transitions. [2022-03-15 18:53:22,973 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 554 transitions. Word has length 24 [2022-03-15 18:53:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:22,973 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 554 transitions. [2022-03-15 18:53:22,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 554 transitions. [2022-03-15 18:53:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:53:22,975 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:22,975 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:23,016 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 18:53:23,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:23,188 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:23,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash 862469080, now seen corresponding path program 2 times [2022-03-15 18:53:23,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:23,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407806094] [2022-03-15 18:53:23,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:23,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:23,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:23,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407806094] [2022-03-15 18:53:23,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407806094] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:23,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453820149] [2022-03-15 18:53:23,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:53:23,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:23,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:23,420 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 18:53:23,483 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 18:53:23,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:53:23,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:23,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 18:53:23,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:23,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 18:53:23,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 18:53:23,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:53:23,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 18:53:23,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:53:23,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 18:53:23,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 18:53:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:24,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:24,224 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~b1~0 (* 256 (div c_~b1~0 256))) (forall ((v_ArrVal_157 (Array Int Int))) (<= c_~min~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_157) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-03-15 18:53:24,236 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~b1~0 (* 256 (div c_~b1~0 256))) (forall ((v_ArrVal_157 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (<= c_~min~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_157) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-03-15 18:53:24,380 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_157 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_157) c_~A~0.base) c_~A~0.offset))) is different from false [2022-03-15 18:53:24,390 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_155))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_157) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-03-15 18:53:24,396 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:24,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 36 [2022-03-15 18:53:24,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1078 treesize of output 950 [2022-03-15 18:53:24,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 693 treesize of output 651 [2022-03-15 18:53:24,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 651 treesize of output 595 [2022-03-15 18:53:24,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 595 treesize of output 567 [2022-03-15 18:53:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 18:53:26,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453820149] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:26,047 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:26,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 30 [2022-03-15 18:53:26,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1603637003] [2022-03-15 18:53:26,047 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:26,050 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:26,085 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 131 transitions. [2022-03-15 18:53:26,086 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:27,152 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:53:27,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 18:53:27,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:27,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 18:53:27,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=611, Unknown=10, NotChecked=220, Total=992 [2022-03-15 18:53:27,153 INFO L87 Difference]: Start difference. First operand 202 states and 554 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 18:53:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:27,408 INFO L93 Difference]: Finished difference Result 347 states and 941 transitions. [2022-03-15 18:53:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:53:27,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 24 [2022-03-15 18:53:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:27,410 INFO L225 Difference]: With dead ends: 347 [2022-03-15 18:53:27,410 INFO L226 Difference]: Without dead ends: 246 [2022-03-15 18:53:27,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 48 SyntacticMatches, 16 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=267, Invalid=999, Unknown=10, NotChecked=284, Total=1560 [2022-03-15 18:53:27,411 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:27,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:53:27,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-03-15 18:53:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 188. [2022-03-15 18:53:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 2.716577540106952) internal successors, (508), 187 states have internal predecessors, (508), 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 18:53:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 508 transitions. [2022-03-15 18:53:27,416 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 508 transitions. Word has length 24 [2022-03-15 18:53:27,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:27,417 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 508 transitions. [2022-03-15 18:53:27,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 18:53:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 508 transitions. [2022-03-15 18:53:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:53:27,418 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:27,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:27,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 18:53:27,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:27,624 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:27,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1354106264, now seen corresponding path program 3 times [2022-03-15 18:53:27,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:27,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268677269] [2022-03-15 18:53:27,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:27,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:53:27,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:27,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268677269] [2022-03-15 18:53:27,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268677269] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:27,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759632672] [2022-03-15 18:53:27,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:53:27,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:27,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:27,761 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 18:53:27,790 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 18:53:27,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 18:53:27,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:27,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 18:53:27,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:53:27,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:53:27,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759632672] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:27,913 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:53:27,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-03-15 18:53:27,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1495511393] [2022-03-15 18:53:27,913 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:27,916 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:27,926 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 89 transitions. [2022-03-15 18:53:27,926 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:28,199 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [4270#(or (= (mod ~b1~0 256) 0) (= (mod ~b2~0 256) 0))] [2022-03-15 18:53:28,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:53:28,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:28,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:53:28,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-15 18:53:28,200 INFO L87 Difference]: Start difference. First operand 188 states and 508 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 18:53:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:28,311 INFO L93 Difference]: Finished difference Result 227 states and 598 transitions. [2022-03-15 18:53:28,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 18:53:28,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 24 [2022-03-15 18:53:28,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:28,313 INFO L225 Difference]: With dead ends: 227 [2022-03-15 18:53:28,313 INFO L226 Difference]: Without dead ends: 140 [2022-03-15 18:53:28,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-03-15 18:53:28,313 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:28,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:53:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-03-15 18:53:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-03-15 18:53:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.741007194244604) internal successors, (381), 139 states have internal predecessors, (381), 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 18:53:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 381 transitions. [2022-03-15 18:53:28,318 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 381 transitions. Word has length 24 [2022-03-15 18:53:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:28,319 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 381 transitions. [2022-03-15 18:53:28,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 18:53:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 381 transitions. [2022-03-15 18:53:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:53:28,319 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:28,319 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:28,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 18:53:28,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:28,537 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1119661222, now seen corresponding path program 4 times [2022-03-15 18:53:28,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:28,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771910359] [2022-03-15 18:53:28,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:28,618 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:28,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771910359] [2022-03-15 18:53:28,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771910359] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:28,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484851437] [2022-03-15 18:53:28,618 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:53:28,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:28,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:28,619 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 18:53:28,624 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 18:53:28,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:53:28,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:28,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 18:53:28,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:28,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 18:53:28,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 18:53:28,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 18:53:28,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:53:28,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-03-15 18:53:28,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 18:53:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:28,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:29,080 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~min~0 c_~max~0) (forall ((v_ArrVal_250 (Array Int Int))) (not (< c_~min~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))))) (forall ((v_ArrVal_250 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (or (<= .cse0 c_~max~0) (< c_~min~0 .cse0))))) is different from false [2022-03-15 18:53:29,091 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~min~0 c_~max~0) (forall ((v_ArrVal_250 (Array Int Int))) (not (< c_~min~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_250 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) c_~A~0.offset))) (or (<= .cse0 c_~max~0) (< c_~min~0 .cse0))))) is different from false [2022-03-15 18:53:29,107 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_250 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) c_~A~0.offset) c_~max~0)) (forall ((v_ArrVal_250 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) c_~A~0.offset))) (or (<= .cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (<= .cse0 (+ c_~max~0 1)))))) is different from false [2022-03-15 18:53:29,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_250 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) is different from false [2022-03-15 18:53:29,245 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249))) (<= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset)))) is different from false [2022-03-15 18:53:29,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249))) (<= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-03-15 18:53:29,259 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:29,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2022-03-15 18:53:29,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1022 treesize of output 942 [2022-03-15 18:53:29,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 886 treesize of output 822 [2022-03-15 18:53:29,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 822 treesize of output 782 [2022-03-15 18:53:29,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 782 treesize of output 718 [2022-03-15 18:53:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 18:53:33,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484851437] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:33,121 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:33,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 29 [2022-03-15 18:53:33,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5341241] [2022-03-15 18:53:33,122 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:33,126 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:33,138 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 126 transitions. [2022-03-15 18:53:33,138 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:34,069 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:53:34,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 18:53:34,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:34,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 18:53:34,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=462, Unknown=10, NotChecked=294, Total=870 [2022-03-15 18:53:34,070 INFO L87 Difference]: Start difference. First operand 140 states and 381 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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 18:53:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:34,283 INFO L93 Difference]: Finished difference Result 374 states and 1016 transitions. [2022-03-15 18:53:34,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:53:34,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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 24 [2022-03-15 18:53:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:34,284 INFO L225 Difference]: With dead ends: 374 [2022-03-15 18:53:34,285 INFO L226 Difference]: Without dead ends: 176 [2022-03-15 18:53:34,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 17 SemanticMatches, 33 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=678, Unknown=10, NotChecked=354, Total=1190 [2022-03-15 18:53:34,285 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:34,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:53:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-03-15 18:53:34,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 136. [2022-03-15 18:53:34,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.6296296296296298) internal successors, (355), 135 states have internal predecessors, (355), 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 18:53:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 355 transitions. [2022-03-15 18:53:34,289 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 355 transitions. Word has length 24 [2022-03-15 18:53:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:34,289 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 355 transitions. [2022-03-15 18:53:34,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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 18:53:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 355 transitions. [2022-03-15 18:53:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:53:34,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:34,290 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:34,307 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 18:53:34,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:34,495 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:34,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1800617318, now seen corresponding path program 5 times [2022-03-15 18:53:34,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:34,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190052148] [2022-03-15 18:53:34,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:34,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:34,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:34,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190052148] [2022-03-15 18:53:34,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190052148] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:34,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917209370] [2022-03-15 18:53:34,683 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:53:34,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:34,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:34,684 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 18:53:34,685 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 18:53:34,757 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:53:34,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:34,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 18:53:34,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:34,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:53:34,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 18:53:34,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 18:53:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:35,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:35,174 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_295 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_295) c_~A~0.base) c_~A~0.offset) c_~max~0)) (= (mod c_~b2~0 256) 0)) is different from false [2022-03-15 18:53:35,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-03-15 18:53:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-15 18:53:35,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917209370] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:35,326 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:35,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2022-03-15 18:53:35,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [286153178] [2022-03-15 18:53:35,326 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:35,328 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:35,339 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 115 transitions. [2022-03-15 18:53:35,339 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:35,876 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:53:35,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 18:53:35,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:35,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 18:53:35,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=633, Unknown=10, NotChecked=52, Total=812 [2022-03-15 18:53:35,877 INFO L87 Difference]: Start difference. First operand 136 states and 355 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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 18:53:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:36,426 INFO L93 Difference]: Finished difference Result 303 states and 783 transitions. [2022-03-15 18:53:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 18:53:36,426 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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 24 [2022-03-15 18:53:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:36,427 INFO L225 Difference]: With dead ends: 303 [2022-03-15 18:53:36,427 INFO L226 Difference]: Without dead ends: 212 [2022-03-15 18:53:36,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=1073, Unknown=10, NotChecked=70, Total=1406 [2022-03-15 18:53:36,428 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:36,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:53:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-03-15 18:53:36,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 145. [2022-03-15 18:53:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.5694444444444446) internal successors, (370), 144 states have internal predecessors, (370), 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 18:53:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 370 transitions. [2022-03-15 18:53:36,431 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 370 transitions. Word has length 24 [2022-03-15 18:53:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:36,431 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 370 transitions. [2022-03-15 18:53:36,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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 18:53:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 370 transitions. [2022-03-15 18:53:36,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:53:36,432 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:36,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:36,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 18:53:36,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:36,648 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:36,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash 120419808, now seen corresponding path program 6 times [2022-03-15 18:53:36,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:36,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535648086] [2022-03-15 18:53:36,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:36,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:53:36,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:36,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535648086] [2022-03-15 18:53:36,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535648086] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:36,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220557934] [2022-03-15 18:53:36,772 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:53:36,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:36,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:36,773 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 18:53:36,774 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 18:53:36,843 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 18:53:36,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:36,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 18:53:36,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:53:36,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:53:36,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220557934] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:36,900 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:53:36,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2022-03-15 18:53:36,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2023151113] [2022-03-15 18:53:36,900 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:36,903 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:36,910 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 69 transitions. [2022-03-15 18:53:36,910 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:37,018 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:53:37,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 18:53:37,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:37,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 18:53:37,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-15 18:53:37,019 INFO L87 Difference]: Start difference. First operand 145 states and 370 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) 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 18:53:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:37,070 INFO L93 Difference]: Finished difference Result 172 states and 430 transitions. [2022-03-15 18:53:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:53:37,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) 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 24 [2022-03-15 18:53:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:37,071 INFO L225 Difference]: With dead ends: 172 [2022-03-15 18:53:37,071 INFO L226 Difference]: Without dead ends: 110 [2022-03-15 18:53:37,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 18:53:37,072 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:37,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:53:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-03-15 18:53:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-03-15 18:53:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.5871559633027523) internal successors, (282), 109 states have internal predecessors, (282), 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 18:53:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 282 transitions. [2022-03-15 18:53:37,075 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 282 transitions. Word has length 24 [2022-03-15 18:53:37,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:37,075 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 282 transitions. [2022-03-15 18:53:37,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) 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 18:53:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 282 transitions. [2022-03-15 18:53:37,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 18:53:37,075 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:37,075 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:37,092 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 18:53:37,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:37,292 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:37,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1232589758, now seen corresponding path program 7 times [2022-03-15 18:53:37,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:37,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983289672] [2022-03-15 18:53:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:37,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:37,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:37,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983289672] [2022-03-15 18:53:37,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983289672] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:37,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421916999] [2022-03-15 18:53:37,382 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:53:37,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:37,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:37,384 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 18:53:37,385 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 18:53:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:37,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 18:53:37,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:37,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:37,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421916999] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:37,594 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:37,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-03-15 18:53:37,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1297455312] [2022-03-15 18:53:37,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:37,598 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:37,608 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 116 transitions. [2022-03-15 18:53:37,608 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:37,835 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:53:37,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 18:53:37,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:37,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 18:53:37,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-03-15 18:53:37,836 INFO L87 Difference]: Start difference. First operand 110 states and 282 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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 18:53:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:37,917 INFO L93 Difference]: Finished difference Result 136 states and 355 transitions. [2022-03-15 18:53:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 18:53:37,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 18:53:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:37,918 INFO L225 Difference]: With dead ends: 136 [2022-03-15 18:53:37,918 INFO L226 Difference]: Without dead ends: 136 [2022-03-15 18:53:37,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:53:37,919 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:37,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:53:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-03-15 18:53:37,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-03-15 18:53:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.6296296296296298) internal successors, (355), 135 states have internal predecessors, (355), 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 18:53:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 355 transitions. [2022-03-15 18:53:37,922 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 355 transitions. Word has length 25 [2022-03-15 18:53:37,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:37,922 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 355 transitions. [2022-03-15 18:53:37,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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 18:53:37,922 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 355 transitions. [2022-03-15 18:53:37,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:53:37,923 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:37,923 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:37,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 18:53:38,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:38,135 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:38,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:38,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1863189973, now seen corresponding path program 8 times [2022-03-15 18:53:38,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:38,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075963188] [2022-03-15 18:53:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:53:38,205 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:38,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075963188] [2022-03-15 18:53:38,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075963188] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:38,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77620577] [2022-03-15 18:53:38,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:53:38,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:38,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:38,208 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 18:53:38,209 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 18:53:38,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:53:38,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:38,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 18:53:38,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:53:38,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:53:38,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77620577] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:38,459 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:38,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-03-15 18:53:38,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1316317584] [2022-03-15 18:53:38,459 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:38,462 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:38,473 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 117 transitions. [2022-03-15 18:53:38,473 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:38,735 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [7596#(or (<= ~N~0 0) (<= 2 ~N~0)), 7595#(or (<= ~N~0 thread1Thread1of1ForFork0_~i~0) (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0))] [2022-03-15 18:53:38,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 18:53:38,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:38,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 18:53:38,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-03-15 18:53:38,735 INFO L87 Difference]: Start difference. First operand 136 states and 355 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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 18:53:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:38,851 INFO L93 Difference]: Finished difference Result 159 states and 423 transitions. [2022-03-15 18:53:38,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 18:53:38,851 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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 26 [2022-03-15 18:53:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:38,853 INFO L225 Difference]: With dead ends: 159 [2022-03-15 18:53:38,853 INFO L226 Difference]: Without dead ends: 159 [2022-03-15 18:53:38,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2022-03-15 18:53:38,853 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:38,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:53:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-03-15 18:53:38,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-03-15 18:53:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.6772151898734178) internal successors, (423), 158 states have internal predecessors, (423), 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 18:53:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 423 transitions. [2022-03-15 18:53:38,858 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 423 transitions. Word has length 26 [2022-03-15 18:53:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:38,858 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 423 transitions. [2022-03-15 18:53:38,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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 18:53:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 423 transitions. [2022-03-15 18:53:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 18:53:38,859 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:38,859 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:38,886 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 18:53:39,067 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,SelfDestructingSolverStorable10 [2022-03-15 18:53:39,067 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash -995746526, now seen corresponding path program 9 times [2022-03-15 18:53:39,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:39,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154511936] [2022-03-15 18:53:39,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:39,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:39,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154511936] [2022-03-15 18:53:39,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154511936] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:39,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998278619] [2022-03-15 18:53:39,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:53:39,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:39,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:39,477 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 18:53:39,477 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 18:53:39,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 18:53:39,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:39,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 18:53:39,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:39,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:53:39,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-03-15 18:53:39,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2022-03-15 18:53:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:53:39,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:40,087 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_484 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_484) c_~A~0.base) (+ c_~A~0.offset 4)) c_~max~0)) (= (mod c_~b2~0 256) 0)) is different from false [2022-03-15 18:53:40,105 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:40,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 60 [2022-03-15 18:53:40,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 18:53:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-03-15 18:53:40,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998278619] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:40,251 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:40,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 36 [2022-03-15 18:53:40,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1580485877] [2022-03-15 18:53:40,252 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:40,255 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:40,268 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 130 transitions. [2022-03-15 18:53:40,268 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:42,157 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [8282#(and (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= ~min~0 ~max~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (= ~A~0.offset 0))), 8287#(and (or (<= ~N~0 1) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~max~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1))), 8285#(and (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min~0) (<= ~min~0 ~max~0) (<= ~N~0 1)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~max~0) (<= ~N~0 1)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~max~0) (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1))), 8289#(and (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (= ~A~0.offset 0))), 8286#(and (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= ~min~0 ~max~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (= ~A~0.offset 0))), 8277#(or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= ~min~0 ~max~0)), 8283#(and (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= ~min~0 ~max~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (= ~A~0.offset 0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))), 8288#(and (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~max~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= ~N~0 1) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0))), 8278#(and (or (<= ~N~0 thread1Thread1of1ForFork0_~i~0) (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 ~max~0)) (or (<= ~N~0 thread1Thread1of1ForFork0_~i~0) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max~0))), 8284#(and (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~max~0) (<= ~N~0 1)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~max~0) (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1)) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min~0) (<= ~min~0 ~max~0) (<= ~N~0 1))), 8279#(and (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= ~N~0 thread1Thread1of1ForFork0_~i~0) (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 ~max~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= ~N~0 thread1Thread1of1ForFork0_~i~0) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max~0))), 8281#(and (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 4))) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 4)) ~max~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= ~min~0 ~max~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 4)) ~min~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~min~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= ~N~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 4)) ~max~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~min~0) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 4))))), 8276#(and (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= (div ~v_assert~0 256) 0)) (or (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~v_assert~0))), 8280#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 4)) ~max~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~min~0) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 4)))) (or (<= ~N~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 4))) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 4)) ~max~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= ~min~0 ~max~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 4)) ~min~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~min~0)))] [2022-03-15 18:53:42,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 18:53:42,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:42,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 18:53:42,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2248, Unknown=1, NotChecked=98, Total=2652 [2022-03-15 18:53:42,159 INFO L87 Difference]: Start difference. First operand 159 states and 423 transitions. Second operand has 32 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 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 18:53:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:44,960 INFO L93 Difference]: Finished difference Result 191 states and 517 transitions. [2022-03-15 18:53:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 18:53:44,961 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 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 27 [2022-03-15 18:53:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:44,961 INFO L225 Difference]: With dead ends: 191 [2022-03-15 18:53:44,961 INFO L226 Difference]: Without dead ends: 0 [2022-03-15 18:53:44,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1611 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1597, Invalid=5378, Unknown=1, NotChecked=164, Total=7140 [2022-03-15 18:53:44,963 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 339 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:44,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 0 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:53:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-15 18:53:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-15 18:53:44,964 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 18:53:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-15 18:53:44,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-03-15 18:53:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:44,964 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-15 18:53:44,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 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 18:53:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-15 18:53:44,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-15 18:53:44,966 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 18:53:44,966 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 18:53:44,966 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 18:53:44,966 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 18:53:44,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 18:53:45,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:45,168 INFO L732 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1] [2022-03-15 18:53:45,170 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 18:53:45,170 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 18:53:45,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 06:53:45 BasicIcfg [2022-03-15 18:53:45,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 18:53:45,171 INFO L158 Benchmark]: Toolchain (without parser) took 31497.62ms. Allocated memory was 183.5MB in the beginning and 720.4MB in the end (delta: 536.9MB). Free memory was 132.9MB in the beginning and 470.0MB in the end (delta: -337.1MB). Peak memory consumption was 200.1MB. Max. memory is 8.0GB. [2022-03-15 18:53:45,172 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 18:53:45,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.08ms. Allocated memory is still 183.5MB. Free memory was 132.8MB in the beginning and 158.8MB in the end (delta: -26.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 18:53:45,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.83ms. Allocated memory is still 183.5MB. Free memory was 158.8MB in the beginning and 156.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:53:45,172 INFO L158 Benchmark]: Boogie Preprocessor took 30.01ms. Allocated memory is still 183.5MB. Free memory was 156.7MB in the beginning and 154.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:53:45,172 INFO L158 Benchmark]: RCFGBuilder took 458.97ms. Allocated memory is still 183.5MB. Free memory was 154.6MB in the beginning and 135.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-15 18:53:45,172 INFO L158 Benchmark]: TraceAbstraction took 30753.97ms. Allocated memory was 183.5MB in the beginning and 720.4MB in the end (delta: 536.9MB). Free memory was 135.2MB in the beginning and 470.0MB in the end (delta: -334.8MB). Peak memory consumption was 202.7MB. Max. memory is 8.0GB. [2022-03-15 18:53:45,174 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.08ms. Allocated memory is still 183.5MB. Free memory was 132.8MB in the beginning and 158.8MB in the end (delta: -26.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.83ms. Allocated memory is still 183.5MB. Free memory was 158.8MB in the beginning and 156.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.01ms. Allocated memory is still 183.5MB. Free memory was 156.7MB in the beginning and 154.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 458.97ms. Allocated memory is still 183.5MB. Free memory was 154.6MB in the beginning and 135.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 30753.97ms. Allocated memory was 183.5MB in the beginning and 720.4MB in the end (delta: 536.9MB). Free memory was 135.2MB in the beginning and 470.0MB in the end (delta: -334.8MB). Peak memory consumption was 202.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 174 PlacesBefore, 35 PlacesAfterwards, 176 TransitionsBefore, 28 TransitionsAfterwards, 1134 CoEnabledTransitionPairs, 7 FixpointIterations, 117 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 4 ConcurrentYvCompositions, 9 ChoiceCompositions, 172 TotalNumberOfCompositions, 1824 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1427, positive: 1359, positive conditional: 0, positive unconditional: 1359, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 611, positive: 594, positive conditional: 0, positive unconditional: 594, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1427, positive: 765, positive conditional: 0, positive unconditional: 765, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 611, unknown conditional: 0, unknown unconditional: 611] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, 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: 115]: 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 7 procedures, 194 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 30.7s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 972 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 972 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 733 mSDsCounter, 381 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1974 IncrementalHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 381 mSolverCounterUnsat, 0 mSDtfsCounter, 1974 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 970 GetRequests, 631 SyntacticMatches, 50 SemanticMatches, 289 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 3583 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=4, InterpolantAutomatonStates: 122, 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, 12 MinimizatonAttempts, 321 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 510 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 656 ConstructedInterpolants, 33 QuantifiedInterpolants, 5919 SizeOfPredicates, 109 NumberOfNonLiveVariables, 2055 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 50/114 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 18:53:45,200 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...