/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 17:29:14,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 17:29:14,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 17:29:14,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 17:29:14,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 17:29:14,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 17:29:14,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 17:29:14,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 17:29:14,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 17:29:14,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 17:29:14,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 17:29:14,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 17:29:14,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 17:29:14,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 17:29:14,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 17:29:14,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 17:29:14,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 17:29:14,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 17:29:14,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 17:29:14,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 17:29:14,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 17:29:14,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 17:29:14,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 17:29:14,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 17:29:14,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 17:29:14,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 17:29:14,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 17:29:14,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 17:29:14,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 17:29:14,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 17:29:14,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 17:29:14,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 17:29:14,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 17:29:14,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 17:29:14,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 17:29:14,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 17:29:14,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 17:29:14,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 17:29:14,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 17:29:14,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 17:29:14,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 17:29:14,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-03 17:29:14,616 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 17:29:14,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 17:29:14,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 17:29:14,616 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 17:29:14,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 17:29:14,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 17:29:14,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 17:29:14,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 17:29:14,618 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 17:29:14,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 17:29:14,618 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 17:29:14,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 17:29:14,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 17:29:14,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 17:29:14,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 17:29:14,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 17:29:14,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 17:29:14,619 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 17:29:14,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 17:29:14,619 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 17:29:14,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 17:29:14,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 17:29:14,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 17:29:14,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 17:29:14,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 17:29:14,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:29:14,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 17:29:14,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 17:29:14,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 17:29:14,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 17:29:14,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 17:29:14,620 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 17:29:14,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 17:29:14,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-03 17:29:14,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 17:29:14,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 17:29:14,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 17:29:14,802 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 17:29:14,802 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 17:29:14,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-03-03 17:29:14,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e6c3461/50509102521a419db0f91fa4cc39c70a/FLAG4d1701c8c [2022-03-03 17:29:15,166 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 17:29:15,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-03-03 17:29:15,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e6c3461/50509102521a419db0f91fa4cc39c70a/FLAG4d1701c8c [2022-03-03 17:29:15,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e6c3461/50509102521a419db0f91fa4cc39c70a [2022-03-03 17:29:15,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 17:29:15,598 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 17:29:15,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 17:29:15,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 17:29:15,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 17:29:15,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:29:15" (1/1) ... [2022-03-03 17:29:15,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d561d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15, skipping insertion in model container [2022-03-03 17:29:15,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:29:15" (1/1) ... [2022-03-03 17:29:15,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 17:29:15,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 17:29:15,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-03-03 17:29:15,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:29:15,770 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 17:29:15,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-03-03 17:29:15,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:29:15,799 INFO L208 MainTranslator]: Completed translation [2022-03-03 17:29:15,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15 WrapperNode [2022-03-03 17:29:15,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 17:29:15,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 17:29:15,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 17:29:15,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 17:29:15,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15" (1/1) ... [2022-03-03 17:29:15,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15" (1/1) ... [2022-03-03 17:29:15,830 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-03-03 17:29:15,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 17:29:15,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 17:29:15,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 17:29:15,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 17:29:15,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15" (1/1) ... [2022-03-03 17:29:15,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15" (1/1) ... [2022-03-03 17:29:15,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15" (1/1) ... [2022-03-03 17:29:15,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15" (1/1) ... [2022-03-03 17:29:15,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15" (1/1) ... [2022-03-03 17:29:15,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15" (1/1) ... [2022-03-03 17:29:15,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15" (1/1) ... [2022-03-03 17:29:15,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 17:29:15,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 17:29:15,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 17:29:15,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 17:29:15,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15" (1/1) ... [2022-03-03 17:29:15,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:29:15,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:29:15,893 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-03 17:29:15,901 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-03 17:29:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 17:29:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-03 17:29:15,918 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-03 17:29:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-03 17:29:15,918 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-03 17:29:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-03 17:29:15,918 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-03 17:29:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 17:29:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 17:29:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 17:29:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-03 17:29:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-03 17:29:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-03 17:29:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 17:29:15,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 17:29:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 17:29:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 17:29:15,920 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 17:29:16,011 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 17:29:16,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 17:29:16,210 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 17:29:16,250 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 17:29:16,251 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-03 17:29:16,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:29:16 BoogieIcfgContainer [2022-03-03 17:29:16,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 17:29:16,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 17:29:16,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 17:29:16,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 17:29:16,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:29:15" (1/3) ... [2022-03-03 17:29:16,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749dd165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:29:16, skipping insertion in model container [2022-03-03 17:29:16,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:29:15" (2/3) ... [2022-03-03 17:29:16,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749dd165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:29:16, skipping insertion in model container [2022-03-03 17:29:16,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:29:16" (3/3) ... [2022-03-03 17:29:16,260 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-03-03 17:29:16,265 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 17:29:16,266 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 17:29:16,266 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-03 17:29:16,266 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 17:29:16,306 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,306 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,306 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,307 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,307 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,307 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,307 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,307 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,308 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,309 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,309 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,309 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,310 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,310 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,310 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,310 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,310 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,310 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,311 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,311 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,311 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,311 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,311 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,312 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,312 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,313 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,313 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,313 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,313 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,313 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,314 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,314 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,314 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,314 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,314 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,314 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,314 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,314 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,314 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,315 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,315 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,315 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,315 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,315 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,316 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,316 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,316 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,316 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,316 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,316 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,316 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,316 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,317 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,317 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,317 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,317 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,317 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,318 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,318 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,318 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,318 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,318 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,318 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,318 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,318 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,318 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,319 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,321 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,321 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,321 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,321 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,321 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,322 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,322 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,323 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,323 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,323 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,324 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:29:16,327 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-03 17:29:16,361 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 17:29:16,368 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, 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=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 17:29:16,368 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-03 17:29:16,385 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 159 transitions, 342 flow [2022-03-03 17:29:16,578 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3813 states, 3812 states have (on average 3.809286463798531) internal successors, (14521), 3812 states have internal predecessors, (14521), 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-03 17:29:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 3813 states, 3812 states have (on average 3.809286463798531) internal successors, (14521), 3812 states have internal predecessors, (14521), 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-03 17:29:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-03-03 17:29:16,642 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:16,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:29:16,644 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-03 17:29:16,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:16,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2094363978, now seen corresponding path program 1 times [2022-03-03 17:29:16,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:16,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82435105] [2022-03-03 17:29:16,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:16,915 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-03 17:29:16,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:16,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82435105] [2022-03-03 17:29:16,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82435105] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:29:16,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:29:16,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 17:29:16,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764512125] [2022-03-03 17:29:16,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:29:16,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 17:29:16,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:17,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 17:29:17,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:29:17,031 INFO L87 Difference]: Start difference. First operand has 3813 states, 3812 states have (on average 3.809286463798531) internal successors, (14521), 3812 states have internal predecessors, (14521), 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 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 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-03 17:29:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:17,128 INFO L93 Difference]: Finished difference Result 3813 states and 13373 transitions. [2022-03-03 17:29:17,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 17:29:17,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 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 109 [2022-03-03 17:29:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:17,186 INFO L225 Difference]: With dead ends: 3813 [2022-03-03 17:29:17,186 INFO L226 Difference]: Without dead ends: 3809 [2022-03-03 17:29:17,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:29:17,193 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:17,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:29:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2022-03-03 17:29:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3809. [2022-03-03 17:29:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3809 states, 3808 states have (on average 3.510766806722689) internal successors, (13369), 3808 states have internal predecessors, (13369), 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-03 17:29:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 13369 transitions. [2022-03-03 17:29:17,410 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 13369 transitions. Word has length 109 [2022-03-03 17:29:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:17,411 INFO L470 AbstractCegarLoop]: Abstraction has 3809 states and 13369 transitions. [2022-03-03 17:29:17,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 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-03 17:29:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 13369 transitions. [2022-03-03 17:29:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-03-03 17:29:17,425 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:17,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:29:17,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 17:29:17,426 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-03 17:29:17,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:17,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2012101173, now seen corresponding path program 1 times [2022-03-03 17:29:17,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:17,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982995946] [2022-03-03 17:29:17,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:17,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:17,616 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-03 17:29:17,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:17,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982995946] [2022-03-03 17:29:17,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982995946] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:29:17,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:29:17,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-03 17:29:17,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049759136] [2022-03-03 17:29:17,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:29:17,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-03 17:29:17,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:17,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-03 17:29:17,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-03 17:29:17,623 INFO L87 Difference]: Start difference. First operand 3809 states and 13369 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-03 17:29:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:17,769 INFO L93 Difference]: Finished difference Result 7071 states and 25089 transitions. [2022-03-03 17:29:17,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-03 17:29:17,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 109 [2022-03-03 17:29:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:17,811 INFO L225 Difference]: With dead ends: 7071 [2022-03-03 17:29:17,811 INFO L226 Difference]: Without dead ends: 7071 [2022-03-03 17:29:17,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-03 17:29:17,813 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 181 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:17,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 212 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:29:17,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2022-03-03 17:29:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 4978. [2022-03-03 17:29:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4978 states, 4977 states have (on average 3.5173799477596948) internal successors, (17506), 4977 states have internal predecessors, (17506), 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-03 17:29:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4978 states to 4978 states and 17506 transitions. [2022-03-03 17:29:18,040 INFO L78 Accepts]: Start accepts. Automaton has 4978 states and 17506 transitions. Word has length 109 [2022-03-03 17:29:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:18,054 INFO L470 AbstractCegarLoop]: Abstraction has 4978 states and 17506 transitions. [2022-03-03 17:29:18,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-03 17:29:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4978 states and 17506 transitions. [2022-03-03 17:29:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-03-03 17:29:18,071 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:18,072 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:29:18,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 17:29:18,072 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-03 17:29:18,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:18,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1404457087, now seen corresponding path program 1 times [2022-03-03 17:29:18,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:18,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124338848] [2022-03-03 17:29:18,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:18,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:18,321 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-03 17:29:18,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:18,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124338848] [2022-03-03 17:29:18,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124338848] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:29:18,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:29:18,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-03 17:29:18,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475326383] [2022-03-03 17:29:18,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:29:18,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-03 17:29:18,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-03 17:29:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-03-03 17:29:18,325 INFO L87 Difference]: Start difference. First operand 4978 states and 17506 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-03 17:29:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:18,517 INFO L93 Difference]: Finished difference Result 4994 states and 17522 transitions. [2022-03-03 17:29:18,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-03 17:29:18,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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 109 [2022-03-03 17:29:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:18,554 INFO L225 Difference]: With dead ends: 4994 [2022-03-03 17:29:18,554 INFO L226 Difference]: Without dead ends: 4984 [2022-03-03 17:29:18,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=59, Unknown=0, NotChecked=0, Total=110 [2022-03-03 17:29:18,559 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 249 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:18,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 379 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:29:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2022-03-03 17:29:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4979. [2022-03-03 17:29:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4979 states, 4978 states have (on average 3.5168742466854157) internal successors, (17507), 4978 states have internal predecessors, (17507), 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-03 17:29:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4979 states to 4979 states and 17507 transitions. [2022-03-03 17:29:18,706 INFO L78 Accepts]: Start accepts. Automaton has 4979 states and 17507 transitions. Word has length 109 [2022-03-03 17:29:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:18,707 INFO L470 AbstractCegarLoop]: Abstraction has 4979 states and 17507 transitions. [2022-03-03 17:29:18,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-03 17:29:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states and 17507 transitions. [2022-03-03 17:29:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-03-03 17:29:18,730 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:18,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:29:18,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 17:29:18,739 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-03 17:29:18,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1972009608, now seen corresponding path program 1 times [2022-03-03 17:29:18,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:18,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025089977] [2022-03-03 17:29:18,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:18,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:29:18,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:18,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025089977] [2022-03-03 17:29:18,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025089977] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:18,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779316163] [2022-03-03 17:29:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:18,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:18,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:29:18,877 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-03 17:29:18,894 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-03 17:29:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:18,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-03 17:29:18,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:29:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:29:19,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:29:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:29:19,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779316163] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:19,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 17:29:19,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-03 17:29:19,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713176366] [2022-03-03 17:29:19,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:29:19,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 17:29:19,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:19,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 17:29:19,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-03 17:29:19,532 INFO L87 Difference]: Start difference. First operand 4979 states and 17507 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:29:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:19,663 INFO L93 Difference]: Finished difference Result 5483 states and 19328 transitions. [2022-03-03 17:29:19,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 17:29:19,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-03-03 17:29:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:19,683 INFO L225 Difference]: With dead ends: 5483 [2022-03-03 17:29:19,683 INFO L226 Difference]: Without dead ends: 5483 [2022-03-03 17:29:19,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-03 17:29:19,684 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 190 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:19,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 383 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:29:19,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2022-03-03 17:29:19,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5483. [2022-03-03 17:29:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5483 states, 5482 states have (on average 3.5257205399489235) internal successors, (19328), 5482 states have internal predecessors, (19328), 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-03 17:29:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5483 states to 5483 states and 19328 transitions. [2022-03-03 17:29:19,804 INFO L78 Accepts]: Start accepts. Automaton has 5483 states and 19328 transitions. Word has length 116 [2022-03-03 17:29:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:19,804 INFO L470 AbstractCegarLoop]: Abstraction has 5483 states and 19328 transitions. [2022-03-03 17:29:19,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:29:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5483 states and 19328 transitions. [2022-03-03 17:29:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-03 17:29:19,819 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:19,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:29:19,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-03 17:29:20,035 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-03 17:29:20,036 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-03 17:29:20,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:20,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1653076207, now seen corresponding path program 1 times [2022-03-03 17:29:20,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:20,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976290334] [2022-03-03 17:29:20,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:20,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:29:20,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:20,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976290334] [2022-03-03 17:29:20,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976290334] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:20,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648458240] [2022-03-03 17:29:20,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:20,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:20,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:29:20,116 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-03 17:29:20,139 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-03 17:29:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:20,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 17:29:20,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:29:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:29:20,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:29:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:29:20,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648458240] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:20,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 17:29:20,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-03-03 17:29:20,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145985261] [2022-03-03 17:29:20,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:29:20,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 17:29:20,684 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:20,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 17:29:20,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-03 17:29:20,684 INFO L87 Difference]: Start difference. First operand 5483 states and 19328 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 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-03 17:29:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:20,887 INFO L93 Difference]: Finished difference Result 8369 states and 29751 transitions. [2022-03-03 17:29:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-03 17:29:20,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 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 121 [2022-03-03 17:29:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:20,912 INFO L225 Difference]: With dead ends: 8369 [2022-03-03 17:29:20,912 INFO L226 Difference]: Without dead ends: 8369 [2022-03-03 17:29:20,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2022-03-03 17:29:20,913 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 548 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:20,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 694 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:29:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8369 states. [2022-03-03 17:29:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8369 to 5615. [2022-03-03 17:29:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5615 states, 5614 states have (on average 3.521197007481297) internal successors, (19768), 5614 states have internal predecessors, (19768), 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-03 17:29:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 19768 transitions. [2022-03-03 17:29:21,062 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 19768 transitions. Word has length 121 [2022-03-03 17:29:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:21,062 INFO L470 AbstractCegarLoop]: Abstraction has 5615 states and 19768 transitions. [2022-03-03 17:29:21,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 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-03 17:29:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 19768 transitions. [2022-03-03 17:29:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-03 17:29:21,073 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:21,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:29:21,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-03 17:29:21,287 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-03 17:29:21,287 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-03 17:29:21,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:21,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1659282011, now seen corresponding path program 2 times [2022-03-03 17:29:21,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:21,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791601724] [2022-03-03 17:29:21,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:21,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:29:21,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:21,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791601724] [2022-03-03 17:29:21,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791601724] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:21,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810364701] [2022-03-03 17:29:21,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:29:21,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:21,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:29:21,392 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-03 17:29:21,393 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-03 17:29:21,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 17:29:21,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:29:21,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-03 17:29:21,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:29:21,768 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-03 17:29:21,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 17:29:21,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810364701] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:29:21,768 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 17:29:21,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-03-03 17:29:21,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463948851] [2022-03-03 17:29:21,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:29:21,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 17:29:21,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:21,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 17:29:21,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-03-03 17:29:21,771 INFO L87 Difference]: Start difference. First operand 5615 states and 19768 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-03 17:29:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:21,927 INFO L93 Difference]: Finished difference Result 5306 states and 18640 transitions. [2022-03-03 17:29:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-03 17:29:21,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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 121 [2022-03-03 17:29:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:21,945 INFO L225 Difference]: With dead ends: 5306 [2022-03-03 17:29:21,945 INFO L226 Difference]: Without dead ends: 5306 [2022-03-03 17:29:21,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-03-03 17:29:21,947 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 192 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:21,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 412 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:29:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5306 states. [2022-03-03 17:29:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5306 to 4584. [2022-03-03 17:29:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 4583 states have (on average 3.5339297403447523) internal successors, (16196), 4583 states have internal predecessors, (16196), 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-03 17:29:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 16196 transitions. [2022-03-03 17:29:22,085 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 16196 transitions. Word has length 121 [2022-03-03 17:29:22,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:22,086 INFO L470 AbstractCegarLoop]: Abstraction has 4584 states and 16196 transitions. [2022-03-03 17:29:22,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-03 17:29:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 16196 transitions. [2022-03-03 17:29:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-03 17:29:22,096 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:22,096 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:29:22,118 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-03 17:29:22,310 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-03 17:29:22,311 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-03 17:29:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 611662898, now seen corresponding path program 1 times [2022-03-03 17:29:22,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:22,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034004068] [2022-03-03 17:29:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:22,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:23,074 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-03 17:29:23,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:23,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034004068] [2022-03-03 17:29:23,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034004068] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:23,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275628286] [2022-03-03 17:29:23,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:23,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:23,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:29:23,076 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-03 17:29:23,077 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-03 17:29:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:23,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-03 17:29:23,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:29:23,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-03 17:29:23,310 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:29:23,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-03-03 17:29:23,758 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:29:23,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 15 [2022-03-03 17:29:25,002 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 27 treesize of output 27 [2022-03-03 17:29:25,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:29:25,273 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 27 treesize of output 27 [2022-03-03 17:29:25,522 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:25,522 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 58 treesize of output 42 [2022-03-03 17:29:26,056 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-03 17:29:26,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:29:26,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_174 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse0) (not (< .cse0 c_~min3~0)) (not (< .cse0 c_~min2~0))))) (or (forall ((v_ArrVal_174 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)) (= c_~min1~0 c_~min3~0) (not (< c_~min3~0 c_~min2~0)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:27,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (or (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)) (= c_~min1~0 c_~min3~0) (not (< c_~min3~0 c_~min2~0))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0) (not (< .cse0 c_~min3~0)))))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:27,722 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:27,723 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 335 treesize of output 295 [2022-03-03 17:29:27,730 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 256 treesize of output 244 [2022-03-03 17:29:27,736 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 244 treesize of output 238 [2022-03-03 17:29:27,743 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 238 treesize of output 202 [2022-03-03 17:29:27,751 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 202 treesize of output 184 [2022-03-03 17:29:30,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:29:30,858 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 10 treesize of output 8 [2022-03-03 17:29:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:29:31,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275628286] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:29:31,039 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:29:31,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32, 33] total 83 [2022-03-03 17:29:31,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144023425] [2022-03-03 17:29:31,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:29:31,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-03-03 17:29:31,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:31,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-03-03 17:29:31,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=5661, Unknown=2, NotChecked=318, Total=6806 [2022-03-03 17:29:31,042 INFO L87 Difference]: Start difference. First operand 4584 states and 16196 transitions. Second operand has 83 states, 83 states have (on average 4.156626506024097) internal successors, (345), 83 states have internal predecessors, (345), 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-03 17:29:34,701 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (< c_thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ c_thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))))) (let ((.cse0 (< .cse1 c_~min3~0))) (and (or (not .cse0) (not (< .cse1 c_~min2~0)) (= c_~min1~0 .cse1)) (or .cse0 (= c_~min1~0 c_~min3~0) (not (< c_~min3~0 c_~min2~0))))))) (forall ((~M~0 Int)) (or (and (or (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)) (= c_~min1~0 c_~min3~0) (not (< c_~min3~0 c_~min2~0))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse2 c_~min2~0)) (= c_~min1~0 .cse2) (not (< .cse2 c_~min3~0)))))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-03 17:29:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:39,758 INFO L93 Difference]: Finished difference Result 24010 states and 84293 transitions. [2022-03-03 17:29:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-03 17:29:39,759 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 4.156626506024097) internal successors, (345), 83 states have internal predecessors, (345), 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 126 [2022-03-03 17:29:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:39,849 INFO L225 Difference]: With dead ends: 24010 [2022-03-03 17:29:39,849 INFO L226 Difference]: Without dead ends: 23992 [2022-03-03 17:29:39,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 198 SyntacticMatches, 10 SemanticMatches, 164 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=3528, Invalid=22887, Unknown=3, NotChecked=972, Total=27390 [2022-03-03 17:29:39,855 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 4123 mSDsluCounter, 9498 mSDsCounter, 0 mSdLazyCounter, 4985 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4123 SdHoareTripleChecker+Valid, 8812 SdHoareTripleChecker+Invalid, 7688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 4985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2438 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:39,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4123 Valid, 8812 Invalid, 7688 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [265 Valid, 4985 Invalid, 0 Unknown, 2438 Unchecked, 2.5s Time] [2022-03-03 17:29:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23992 states. [2022-03-03 17:29:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23992 to 8543. [2022-03-03 17:29:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8543 states, 8542 states have (on average 3.5312573167876375) internal successors, (30164), 8542 states have internal predecessors, (30164), 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-03 17:29:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8543 states to 8543 states and 30164 transitions. [2022-03-03 17:29:40,261 INFO L78 Accepts]: Start accepts. Automaton has 8543 states and 30164 transitions. Word has length 126 [2022-03-03 17:29:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:40,261 INFO L470 AbstractCegarLoop]: Abstraction has 8543 states and 30164 transitions. [2022-03-03 17:29:40,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 4.156626506024097) internal successors, (345), 83 states have internal predecessors, (345), 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-03 17:29:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 8543 states and 30164 transitions. [2022-03-03 17:29:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-03 17:29:40,281 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:40,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:29:40,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-03 17:29:40,487 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-03 17:29:40,487 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-03 17:29:40,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash 4018812, now seen corresponding path program 1 times [2022-03-03 17:29:40,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:40,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978851193] [2022-03-03 17:29:40,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:40,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:41,418 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-03 17:29:41,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:41,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978851193] [2022-03-03 17:29:41,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978851193] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:41,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070824276] [2022-03-03 17:29:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:41,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:41,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:29:41,420 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-03 17:29:41,424 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-03 17:29:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:41,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-03 17:29:41,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:29:41,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-03 17:29:41,584 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:29:41,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-03-03 17:29:41,636 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:29:41,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-03-03 17:29:42,244 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:29:42,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 18 [2022-03-03 17:29:42,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:29:43,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03 17:29:43,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:29:43,505 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 35 treesize of output 33 [2022-03-03 17:29:43,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:29:43,927 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 35 treesize of output 33 [2022-03-03 17:29:44,182 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:44,183 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 69 treesize of output 45 [2022-03-03 17:29:44,854 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-03 17:29:44,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:29:47,130 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (and (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0)))) (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)) (< c_~min3~0 c_~min2~0))) (< 0 ~M~0) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (= c_~min2~0 c_~min1~0) .cse1) (or (not .cse1) (= c_~min2~0 .cse2))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:53,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (and (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0)))) (or (< c_~min3~0 c_~min2~0) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0)))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse2 (< .cse1 c_~min1~0))) (and (or (= c_~min2~0 .cse1) (not .cse2)) (or (= c_~min2~0 c_~min1~0) .cse2)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:54,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse0 c_~min2~0) (not (< .cse0 c_~min3~0)))))) (< 0 ~M~0) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (not .cse1) (= c_~min2~0 .cse2)) (or (= c_~min2~0 c_~min1~0) .cse1)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:54,953 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0))))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (not .cse1) (= c_~min2~0 .cse2)) (or (= c_~min2~0 c_~min1~0) .cse1)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:59,138 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:59,139 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 177 treesize of output 117 [2022-03-03 17:29:59,163 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:59,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1631 treesize of output 1571 [2022-03-03 17:29:59,194 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:59,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1571 treesize of output 1517 [2022-03-03 17:29:59,216 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 1406 treesize of output 1310 [2022-03-03 17:29:59,229 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 1310 treesize of output 1118 [2022-03-03 17:29:59,241 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 1118 treesize of output 1070 [2022-03-03 17:29:59,255 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 1070 treesize of output 1046 [2022-03-03 17:30:02,784 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-03 17:30:02,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070824276] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:02,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:02,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35, 36] total 90 [2022-03-03 17:30:02,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364863334] [2022-03-03 17:30:02,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:02,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-03-03 17:30:02,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:02,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-03-03 17:30:02,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1108, Invalid=6200, Unknown=18, NotChecked=684, Total=8010 [2022-03-03 17:30:02,788 INFO L87 Difference]: Start difference. First operand 8543 states and 30164 transitions. Second operand has 90 states, 90 states have (on average 3.7222222222222223) internal successors, (335), 90 states have internal predecessors, (335), 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-03 17:30:05,848 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse1 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse1 c_~min3~0)) (< .cse1 c_~min2~0))))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse2 (< .cse3 c_~min1~0))) (and (or (not .cse2) (= c_~min2~0 .cse3)) (or (= c_~min2~0 c_~min1~0) .cse2)))) (< (+ ~M~0 1) c_~N~0))))) (and (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0) .cse0)) is different from false [2022-03-03 17:30:37,240 WARN L228 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 98 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 17:30:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:39,882 INFO L93 Difference]: Finished difference Result 28082 states and 98885 transitions. [2022-03-03 17:30:39,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2022-03-03 17:30:39,883 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 3.7222222222222223) internal successors, (335), 90 states have internal predecessors, (335), 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 126 [2022-03-03 17:30:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:39,988 INFO L225 Difference]: With dead ends: 28082 [2022-03-03 17:30:39,988 INFO L226 Difference]: Without dead ends: 27632 [2022-03-03 17:30:39,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 213 SyntacticMatches, 30 SemanticMatches, 226 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 21637 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=6625, Invalid=42809, Unknown=92, NotChecked=2230, Total=51756 [2022-03-03 17:30:39,995 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 4136 mSDsluCounter, 14367 mSDsCounter, 0 mSdLazyCounter, 4809 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 13390 SdHoareTripleChecker+Invalid, 12506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 4809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7546 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:39,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4136 Valid, 13390 Invalid, 12506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 4809 Invalid, 0 Unknown, 7546 Unchecked, 2.2s Time] [2022-03-03 17:30:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27632 states. [2022-03-03 17:30:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27632 to 10712. [2022-03-03 17:30:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10712 states, 10711 states have (on average 3.534964055643731) internal successors, (37863), 10711 states have internal predecessors, (37863), 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-03 17:30:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10712 states to 10712 states and 37863 transitions. [2022-03-03 17:30:40,463 INFO L78 Accepts]: Start accepts. Automaton has 10712 states and 37863 transitions. Word has length 126 [2022-03-03 17:30:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:40,463 INFO L470 AbstractCegarLoop]: Abstraction has 10712 states and 37863 transitions. [2022-03-03 17:30:40,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 3.7222222222222223) internal successors, (335), 90 states have internal predecessors, (335), 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-03 17:30:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 10712 states and 37863 transitions. [2022-03-03 17:30:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-03 17:30:40,487 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:40,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:30:40,506 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-03 17:30:40,699 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-03 17:30:40,699 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-03 17:30:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:40,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1583376580, now seen corresponding path program 2 times [2022-03-03 17:30:40,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:40,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493321380] [2022-03-03 17:30:40,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:40,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:41,747 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-03 17:30:41,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:41,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493321380] [2022-03-03 17:30:41,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493321380] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:41,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419273499] [2022-03-03 17:30:41,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:30:41,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:41,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:41,749 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-03 17:30:41,749 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-03 17:30:41,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:30:41,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:30:41,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-03 17:30:41,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:41,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-03 17:30:41,932 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 17:30:41,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2022-03-03 17:30:42,188 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-03 17:30:42,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 17:30:42,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-03 17:30:43,221 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 35 treesize of output 33 [2022-03-03 17:30:43,405 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:43,406 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 69 treesize of output 45 [2022-03-03 17:30:44,052 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-03 17:30:44,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:45,151 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:45,152 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 259 treesize of output 227 [2022-03-03 17:30:45,157 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 188 treesize of output 164 [2022-03-03 17:30:45,162 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 164 treesize of output 158 [2022-03-03 17:30:45,170 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 158 treesize of output 146 [2022-03-03 17:30:45,175 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 146 treesize of output 134 [2022-03-03 17:30:46,672 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 13 treesize of output 11 [2022-03-03 17:30:46,746 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-03 17:30:46,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419273499] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:46,746 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:46,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 27, 27] total 75 [2022-03-03 17:30:46,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703936837] [2022-03-03 17:30:46,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:46,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-03-03 17:30:46,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:46,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-03-03 17:30:46,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=927, Invalid=4615, Unknown=8, NotChecked=0, Total=5550 [2022-03-03 17:30:46,749 INFO L87 Difference]: Start difference. First operand 10712 states and 37863 transitions. Second operand has 75 states, 75 states have (on average 4.466666666666667) internal successors, (335), 75 states have internal predecessors, (335), 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-03 17:30:55,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:55,955 INFO L93 Difference]: Finished difference Result 25341 states and 88152 transitions. [2022-03-03 17:30:55,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-03 17:30:55,955 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 4.466666666666667) internal successors, (335), 75 states have internal predecessors, (335), 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 126 [2022-03-03 17:30:55,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:56,042 INFO L225 Difference]: With dead ends: 25341 [2022-03-03 17:30:56,043 INFO L226 Difference]: Without dead ends: 25037 [2022-03-03 17:30:56,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10787 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3908, Invalid=25816, Unknown=32, NotChecked=0, Total=29756 [2022-03-03 17:30:56,046 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 2875 mSDsluCounter, 9548 mSDsCounter, 0 mSdLazyCounter, 4704 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2875 SdHoareTripleChecker+Valid, 8961 SdHoareTripleChecker+Invalid, 6432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 4704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1566 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:56,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2875 Valid, 8961 Invalid, 6432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 4704 Invalid, 0 Unknown, 1566 Unchecked, 2.1s Time] [2022-03-03 17:30:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25037 states. [2022-03-03 17:30:56,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25037 to 10255. [2022-03-03 17:30:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10255 states, 10254 states have (on average 3.54788375268188) internal successors, (36380), 10254 states have internal predecessors, (36380), 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-03 17:30:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10255 states to 10255 states and 36380 transitions. [2022-03-03 17:30:56,436 INFO L78 Accepts]: Start accepts. Automaton has 10255 states and 36380 transitions. Word has length 126 [2022-03-03 17:30:56,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:56,436 INFO L470 AbstractCegarLoop]: Abstraction has 10255 states and 36380 transitions. [2022-03-03 17:30:56,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.466666666666667) internal successors, (335), 75 states have internal predecessors, (335), 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-03 17:30:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 10255 states and 36380 transitions. [2022-03-03 17:30:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-03 17:30:56,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:56,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:30:56,475 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-03 17:30:56,675 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-03 17:30:56,676 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-03 17:30:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1285676480, now seen corresponding path program 3 times [2022-03-03 17:30:56,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:56,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388354563] [2022-03-03 17:30:56,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:56,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:57,491 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-03 17:30:57,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:57,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388354563] [2022-03-03 17:30:57,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388354563] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:57,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916745671] [2022-03-03 17:30:57,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:30:57,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:57,496 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-03 17:30:57,497 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-03 17:30:57,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:30:57,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:30:57,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-03 17:30:57,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:57,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-03 17:30:57,662 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 17:30:57,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2022-03-03 17:30:57,891 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-03 17:30:57,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 17:30:58,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-03 17:30:58,897 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 35 treesize of output 33 [2022-03-03 17:30:59,083 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:59,084 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 69 treesize of output 45 [2022-03-03 17:30:59,709 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-03 17:30:59,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:31:00,809 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:00,810 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 419 treesize of output 371 [2022-03-03 17:31:00,817 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 332 treesize of output 320 [2022-03-03 17:31:00,824 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 320 treesize of output 296 [2022-03-03 17:31:00,830 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 296 treesize of output 290 [2022-03-03 17:31:00,836 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 290 treesize of output 242 [2022-03-03 17:31:02,361 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 13 treesize of output 11 [2022-03-03 17:31:02,430 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-03 17:31:02,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916745671] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:31:02,431 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:31:02,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 27] total 72 [2022-03-03 17:31:02,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217168978] [2022-03-03 17:31:02,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:31:02,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-03-03 17:31:02,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:02,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-03-03 17:31:02,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=972, Invalid=4134, Unknown=6, NotChecked=0, Total=5112 [2022-03-03 17:31:02,437 INFO L87 Difference]: Start difference. First operand 10255 states and 36380 transitions. Second operand has 72 states, 72 states have (on average 4.638888888888889) internal successors, (334), 72 states have internal predecessors, (334), 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-03 17:31:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:08,509 INFO L93 Difference]: Finished difference Result 24969 states and 86762 transitions. [2022-03-03 17:31:08,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-03 17:31:08,510 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 4.638888888888889) internal successors, (334), 72 states have internal predecessors, (334), 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 126 [2022-03-03 17:31:08,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:08,582 INFO L225 Difference]: With dead ends: 24969 [2022-03-03 17:31:08,582 INFO L226 Difference]: Without dead ends: 24817 [2022-03-03 17:31:08,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6284 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2750, Invalid=14799, Unknown=7, NotChecked=0, Total=17556 [2022-03-03 17:31:08,583 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 2256 mSDsluCounter, 7399 mSDsCounter, 0 mSdLazyCounter, 3838 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2256 SdHoareTripleChecker+Valid, 6963 SdHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 3838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1433 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:08,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2256 Valid, 6963 Invalid, 5395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 3838 Invalid, 0 Unknown, 1433 Unchecked, 1.7s Time] [2022-03-03 17:31:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24817 states. [2022-03-03 17:31:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24817 to 10492. [2022-03-03 17:31:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10492 states, 10491 states have (on average 3.547040320274521) internal successors, (37212), 10491 states have internal predecessors, (37212), 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-03 17:31:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10492 states to 10492 states and 37212 transitions. [2022-03-03 17:31:08,881 INFO L78 Accepts]: Start accepts. Automaton has 10492 states and 37212 transitions. Word has length 126 [2022-03-03 17:31:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:08,881 INFO L470 AbstractCegarLoop]: Abstraction has 10492 states and 37212 transitions. [2022-03-03 17:31:08,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.638888888888889) internal successors, (334), 72 states have internal predecessors, (334), 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-03 17:31:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 10492 states and 37212 transitions. [2022-03-03 17:31:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-03 17:31:08,899 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:08,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:31:08,914 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-03 17:31:09,099 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-03 17:31:09,099 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-03 17:31:09,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1892826920, now seen corresponding path program 4 times [2022-03-03 17:31:09,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:09,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788224437] [2022-03-03 17:31:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:09,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:10,146 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-03 17:31:10,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:10,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788224437] [2022-03-03 17:31:10,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788224437] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:31:10,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022636013] [2022-03-03 17:31:10,147 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:31:10,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:31:10,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:31:10,148 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-03 17:31:10,149 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-03 17:31:10,219 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:31:10,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:31:10,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-03 17:31:10,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:31:10,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-03 17:31:10,314 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:31:10,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-03-03 17:31:10,362 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:31:10,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-03-03 17:31:10,931 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:31:10,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 18 [2022-03-03 17:31:11,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03 17:31:11,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03 17:31:11,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:31:11,949 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 35 treesize of output 33 [2022-03-03 17:31:12,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:31:12,181 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 35 treesize of output 33 [2022-03-03 17:31:12,416 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:12,416 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 69 treesize of output 45 [2022-03-03 17:31:13,368 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-03 17:31:13,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:31:15,486 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_324 (Array Int Int))) (or (< 0 ~M~0) (and (or (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_326) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_326) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse0 c_~min2~0) (not (< .cse0 c_~min3~0)))))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_324) c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (= c_~min2~0 c_~min1~0) .cse1) (or (not .cse1) (= c_~min2~0 .cse2))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:31:21,820 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_324 (Array Int Int))) (or (< 0 ~M~0) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse0 (< .cse1 c_~min1~0))) (and (or (not .cse0) (= c_~min2~0 .cse1)) (or (= c_~min2~0 c_~min1~0) .cse0)))) (and (or (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< .cse2 c_~min2~0) (not (< .cse2 c_~min3~0)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:31:23,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_324 (Array Int Int))) (or (< 0 ~M~0) (and (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0)))) (or (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0)) (< c_~min3~0 c_~min2~0))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (not .cse1) (= c_~min2~0 .cse2)) (or (= c_~min2~0 c_~min1~0) .cse1)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:31:23,978 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_324 (Array Int Int))) (or (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse1 (< .cse0 c_~min1~0))) (and (or (= c_~min2~0 .cse0) (not .cse1)) (or (= c_~min2~0 c_~min1~0) .cse1)))) (< 0 ~M~0) (and (or (< c_~min3~0 c_~min2~0) (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))) (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse2 c_~min3~0)) (< .cse2 c_~min2~0))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:31:26,995 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:26,995 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 177 treesize of output 117 [2022-03-03 17:31:27,017 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:27,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 999 treesize of output 971 [2022-03-03 17:31:27,035 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:27,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 971 treesize of output 941 [2022-03-03 17:31:27,051 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 830 treesize of output 782 [2022-03-03 17:31:27,062 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 758 [2022-03-03 17:31:27,076 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 758 treesize of output 662 [2022-03-03 17:31:27,090 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 662 treesize of output 614 [2022-03-03 17:31:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:31:30,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022636013] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:31:30,656 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:31:30,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33, 33] total 87 [2022-03-03 17:31:30,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687727767] [2022-03-03 17:31:30,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:31:30,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-03-03 17:31:30,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:30,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-03-03 17:31:30,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1077, Invalid=5736, Unknown=9, NotChecked=660, Total=7482 [2022-03-03 17:31:30,657 INFO L87 Difference]: Start difference. First operand 10492 states and 37212 transitions. Second operand has 87 states, 87 states have (on average 3.8505747126436782) internal successors, (335), 87 states have internal predecessors, (335), 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-03 17:32:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:32:12,215 INFO L93 Difference]: Finished difference Result 30674 states and 108283 transitions. [2022-03-03 17:32:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2022-03-03 17:32:12,216 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 3.8505747126436782) internal successors, (335), 87 states have internal predecessors, (335), 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 126 [2022-03-03 17:32:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:32:12,309 INFO L225 Difference]: With dead ends: 30674 [2022-03-03 17:32:12,309 INFO L226 Difference]: Without dead ends: 30596 [2022-03-03 17:32:12,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 222 SyntacticMatches, 12 SemanticMatches, 266 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 28410 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=9013, Invalid=60281, Unknown=154, NotChecked=2108, Total=71556 [2022-03-03 17:32:12,313 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 4273 mSDsluCounter, 13855 mSDsCounter, 0 mSdLazyCounter, 6213 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4273 SdHoareTripleChecker+Valid, 12573 SdHoareTripleChecker+Invalid, 13198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 6213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6823 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-03 17:32:12,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4273 Valid, 12573 Invalid, 13198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 6213 Invalid, 0 Unknown, 6823 Unchecked, 2.9s Time] [2022-03-03 17:32:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30596 states. [2022-03-03 17:32:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30596 to 12553. [2022-03-03 17:32:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12553 states, 12552 states have (on average 3.5740917782026767) internal successors, (44862), 12552 states have internal predecessors, (44862), 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-03 17:32:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12553 states to 12553 states and 44862 transitions. [2022-03-03 17:32:12,740 INFO L78 Accepts]: Start accepts. Automaton has 12553 states and 44862 transitions. Word has length 126 [2022-03-03 17:32:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:32:12,740 INFO L470 AbstractCegarLoop]: Abstraction has 12553 states and 44862 transitions. [2022-03-03 17:32:12,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 3.8505747126436782) internal successors, (335), 87 states have internal predecessors, (335), 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-03 17:32:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 12553 states and 44862 transitions. [2022-03-03 17:32:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-03 17:32:12,764 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:32:12,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 17:32:12,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-03 17:32:12,967 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-03 17:32:12,968 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-03 17:32:12,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:32:12,968 INFO L85 PathProgramCache]: Analyzing trace with hash 482151332, now seen corresponding path program 5 times [2022-03-03 17:32:12,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:32:12,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78146475] [2022-03-03 17:32:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:32:12,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:32:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:32:14,129 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-03 17:32:14,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:32:14,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78146475] [2022-03-03 17:32:14,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78146475] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:32:14,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437653869] [2022-03-03 17:32:14,129 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:32:14,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:32:14,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:32:14,130 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-03 17:32:14,133 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-03 17:32:14,216 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:32:14,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:32:14,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-03 17:32:14,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:32:14,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-03 17:32:14,313 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:32:14,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-03-03 17:32:14,365 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:32:14,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-03-03 17:32:14,905 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:32:14,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 18 [2022-03-03 17:32:15,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:32:15,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03 17:32:16,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:32:16,123 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 35 treesize of output 33 [2022-03-03 17:32:16,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:32:16,314 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 35 treesize of output 33 [2022-03-03 17:32:16,528 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:16,530 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 63 treesize of output 43 [2022-03-03 17:32:17,340 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-03 17:32:17,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:32:19,422 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((~M~0 Int) (v_ArrVal_364 (Array Int Int))) (or (and (or (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_366) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_366) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse0 c_~min2~0) (not (< .cse0 c_~min3~0)))))) (not (< ~M~0 c_~N~0)) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364) c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (< .cse1 c_~min1~0))) (and (or (= c_~min2~0 .cse1) (not .cse2)) (or (= c_~min2~0 c_~min1~0) .cse2)))) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-03-03 17:32:24,611 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((~M~0 Int) (v_ArrVal_364 (Array Int Int))) (or (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse0 (< .cse1 c_~min1~0))) (and (or (= c_~min2~0 c_~min1~0) .cse0) (or (not .cse0) (= c_~min2~0 .cse1))))) (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< .cse2 c_~min3~0)) (< .cse2 c_~min2~0)))) (or (< c_~min3~0 c_~min2~0) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-03 17:32:25,524 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((~M~0 Int) (v_ArrVal_364 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse0 c_~min2~0) (not (< .cse0 c_~min3~0))))) (or (< c_~min3~0 c_~min2~0) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0)))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (not .cse1) (= c_~min2~0 .cse2)) (or (= c_~min2~0 c_~min1~0) .cse1)))) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-03-03 17:32:26,004 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((~M~0 Int) (v_ArrVal_364 (Array Int Int))) (or (and (or (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0))))) (not (< ~M~0 c_~N~0)) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (= c_~min2~0 c_~min1~0) .cse1) (or (= c_~min2~0 .cse2) (not .cse1))))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-03 17:32:29,051 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:29,051 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 177 treesize of output 117 [2022-03-03 17:32:29,070 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:29,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3819 treesize of output 3647 [2022-03-03 17:32:29,097 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:29,098 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3647 treesize of output 3509 [2022-03-03 17:32:29,133 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 3398 treesize of output 3206 [2022-03-03 17:32:29,156 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 3206 treesize of output 3110 [2022-03-03 17:32:29,180 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 3110 treesize of output 2918 [2022-03-03 17:32:29,201 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 2918 treesize of output 2534 [2022-03-03 17:32:29,218 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-03 17:32:29,239 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-03 17:32:29,418 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-03 17:32:29,419 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-03 17:32:29,422 INFO L158 Benchmark]: Toolchain (without parser) took 193823.58ms. Allocated memory was 184.5MB in the beginning and 836.8MB in the end (delta: 652.2MB). Free memory was 133.4MB in the beginning and 224.2MB in the end (delta: -90.7MB). Peak memory consumption was 563.0MB. Max. memory is 8.0GB. [2022-03-03 17:32:29,422 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 17:32:29,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.51ms. Allocated memory is still 184.5MB. Free memory was 133.2MB in the beginning and 159.1MB in the end (delta: -25.9MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-03-03 17:32:29,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.67ms. Allocated memory is still 184.5MB. Free memory was 159.1MB in the beginning and 157.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 17:32:29,423 INFO L158 Benchmark]: Boogie Preprocessor took 24.84ms. Allocated memory is still 184.5MB. Free memory was 157.5MB in the beginning and 156.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-03 17:32:29,423 INFO L158 Benchmark]: RCFGBuilder took 397.09ms. Allocated memory is still 184.5MB. Free memory was 156.0MB in the beginning and 137.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-03 17:32:29,423 INFO L158 Benchmark]: TraceAbstraction took 193167.32ms. Allocated memory was 184.5MB in the beginning and 836.8MB in the end (delta: 652.2MB). Free memory was 136.6MB in the beginning and 224.2MB in the end (delta: -87.6MB). Peak memory consumption was 565.6MB. Max. memory is 8.0GB. [2022-03-03 17:32:29,424 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 184.5MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.51ms. Allocated memory is still 184.5MB. Free memory was 133.2MB in the beginning and 159.1MB in the end (delta: -25.9MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.67ms. Allocated memory is still 184.5MB. Free memory was 159.1MB in the beginning and 157.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.84ms. Allocated memory is still 184.5MB. Free memory was 157.5MB in the beginning and 156.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 397.09ms. Allocated memory is still 184.5MB. Free memory was 156.0MB in the beginning and 137.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 193167.32ms. Allocated memory was 184.5MB in the beginning and 836.8MB in the end (delta: 652.2MB). Free memory was 136.6MB in the beginning and 224.2MB in the end (delta: -87.6MB). Peak memory consumption was 565.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-03 17:32:29,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...