/usr/bin/java -Xmx16000000000 -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-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 02:06:42,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 02:06:42,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 02:06:43,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 02:06:43,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 02:06:43,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 02:06:43,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 02:06:43,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 02:06:43,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 02:06:43,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 02:06:43,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 02:06:43,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 02:06:43,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 02:06:43,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 02:06:43,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 02:06:43,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 02:06:43,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 02:06:43,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 02:06:43,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 02:06:43,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 02:06:43,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 02:06:43,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 02:06:43,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 02:06:43,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 02:06:43,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 02:06:43,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 02:06:43,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 02:06:43,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 02:06:43,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 02:06:43,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 02:06:43,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 02:06:43,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 02:06:43,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 02:06:43,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 02:06:43,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 02:06:43,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 02:06:43,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 02:06:43,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 02:06:43,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 02:06:43,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 02:06:43,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 02:06:43,035 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-01-18 02:06:43,052 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 02:06:43,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 02:06:43,053 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 02:06:43,053 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 02:06:43,053 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 02:06:43,054 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 02:06:43,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 02:06:43,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 02:06:43,054 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 02:06:43,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 02:06:43,055 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 02:06:43,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 02:06:43,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 02:06:43,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 02:06:43,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 02:06:43,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 02:06:43,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 02:06:43,056 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 02:06:43,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 02:06:43,056 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 02:06:43,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 02:06:43,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 02:06:43,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 02:06:43,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 02:06:43,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 02:06:43,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 02:06:43,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 02:06:43,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 02:06:43,058 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 02:06:43,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 02:06:43,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 02:06:43,058 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 02:06:43,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 02:06:43,059 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-01-18 02:06:43,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 02:06:43,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 02:06:43,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 02:06:43,259 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 02:06:43,265 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 02:06:43,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-01-18 02:06:43,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e022b639/38397175bac840449d8fdacf5991eec0/FLAG6e528e416 [2022-01-18 02:06:43,714 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 02:06:43,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-01-18 02:06:43,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e022b639/38397175bac840449d8fdacf5991eec0/FLAG6e528e416 [2022-01-18 02:06:43,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e022b639/38397175bac840449d8fdacf5991eec0 [2022-01-18 02:06:43,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 02:06:43,748 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 02:06:43,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 02:06:43,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 02:06:43,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 02:06:43,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 02:06:43" (1/1) ... [2022-01-18 02:06:43,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4438be2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:43, skipping insertion in model container [2022-01-18 02:06:43,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 02:06:43" (1/1) ... [2022-01-18 02:06:43,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 02:06:43,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 02:06:43,965 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-array-sum-alt.wvr.c[2761,2774] [2022-01-18 02:06:43,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 02:06:43,980 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 02:06:43,998 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-array-sum-alt.wvr.c[2761,2774] [2022-01-18 02:06:44,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 02:06:44,013 INFO L208 MainTranslator]: Completed translation [2022-01-18 02:06:44,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:44 WrapperNode [2022-01-18 02:06:44,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 02:06:44,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 02:06:44,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 02:06:44,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 02:06:44,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:44" (1/1) ... [2022-01-18 02:06:44,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:44" (1/1) ... [2022-01-18 02:06:44,052 INFO L137 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 200 [2022-01-18 02:06:44,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 02:06:44,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 02:06:44,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 02:06:44,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 02:06:44,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:44" (1/1) ... [2022-01-18 02:06:44,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:44" (1/1) ... [2022-01-18 02:06:44,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:44" (1/1) ... [2022-01-18 02:06:44,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:44" (1/1) ... [2022-01-18 02:06:44,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:44" (1/1) ... [2022-01-18 02:06:44,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:44" (1/1) ... [2022-01-18 02:06:44,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:44" (1/1) ... [2022-01-18 02:06:44,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 02:06:44,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 02:06:44,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 02:06:44,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 02:06:44,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:44" (1/1) ... [2022-01-18 02:06:44,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 02:06:44,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:06:44,120 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-01-18 02:06:44,130 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-01-18 02:06:44,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 02:06:44,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 02:06:44,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 02:06:44,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 02:06:44,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 02:06:44,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 02:06:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 02:06:44,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 02:06:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 02:06:44,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 02:06:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 02:06:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 02:06:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 02:06:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 02:06:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 02:06:44,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 02:06:44,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 02:06:44,153 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 02:06:44,227 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 02:06:44,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 02:06:44,505 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 02:06:44,604 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 02:06:44,604 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-18 02:06:44,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:06:44 BoogieIcfgContainer [2022-01-18 02:06:44,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 02:06:44,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 02:06:44,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 02:06:44,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 02:06:44,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 02:06:43" (1/3) ... [2022-01-18 02:06:44,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b1c370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:06:44, skipping insertion in model container [2022-01-18 02:06:44,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:06:44" (2/3) ... [2022-01-18 02:06:44,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b1c370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:06:44, skipping insertion in model container [2022-01-18 02:06:44,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:06:44" (3/3) ... [2022-01-18 02:06:44,618 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2022-01-18 02:06:44,622 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 02:06:44,623 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 02:06:44,623 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 02:06:44,623 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 02:06:44,680 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,680 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,680 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,680 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,681 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,681 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,682 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,682 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,685 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,687 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,688 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,688 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,688 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,689 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,689 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,689 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,689 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,689 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,689 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,689 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,692 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,692 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,694 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,694 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,694 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,694 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,695 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,695 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,695 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,696 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,696 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,696 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,696 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,697 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,697 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,697 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,698 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,698 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,698 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,698 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,698 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,698 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,699 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,699 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,699 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,699 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,705 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,705 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,705 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,705 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,706 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,706 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,706 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,706 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,706 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,706 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,706 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,708 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,708 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,708 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,708 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,709 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,709 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,709 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,710 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,711 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,711 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,713 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,716 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,718 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,719 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,719 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,719 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,719 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,719 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,720 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,720 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,720 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,720 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,720 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,720 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,720 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,722 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,722 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,722 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,722 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,724 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,724 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,724 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,724 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,724 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,725 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,725 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,725 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,725 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,725 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,725 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,725 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,728 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,728 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,728 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,728 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,739 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,739 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,739 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,739 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,740 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,740 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,740 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,740 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,740 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,740 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,742 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,742 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,744 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,744 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,744 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,744 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,744 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,745 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,745 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,745 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,745 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,745 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,745 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,745 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,745 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,746 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:06:44,766 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-18 02:06:44,825 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 02:06:44,830 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, 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 [2022-01-18 02:06:44,831 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-18 02:06:44,848 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 156 transitions, 336 flow [2022-01-18 02:06:45,065 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5072 states, 5071 states have (on average 3.8171958193650166) internal successors, (19357), 5071 states have internal predecessors, (19357), 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-01-18 02:06:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 5072 states, 5071 states have (on average 3.8171958193650166) internal successors, (19357), 5071 states have internal predecessors, (19357), 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-01-18 02:06:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 02:06:45,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:06:45,136 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] [2022-01-18 02:06:45,136 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:06:45,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:06:45,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1255483766, now seen corresponding path program 1 times [2022-01-18 02:06:45,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:06:45,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91850094] [2022-01-18 02:06:45,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:45,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:06:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:06:45,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:06:45,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91850094] [2022-01-18 02:06:45,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91850094] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:06:45,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:06:45,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 02:06:45,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581484304] [2022-01-18 02:06:45,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:06:45,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 02:06:45,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:06:45,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 02:06:45,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 02:06:45,451 INFO L87 Difference]: Start difference. First operand has 5072 states, 5071 states have (on average 3.8171958193650166) internal successors, (19357), 5071 states have internal predecessors, (19357), 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 52.5) internal successors, (105), 2 states have internal predecessors, (105), 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-01-18 02:06:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:06:45,614 INFO L93 Difference]: Finished difference Result 5072 states and 17963 transitions. [2022-01-18 02:06:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 02:06:45,616 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2022-01-18 02:06:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:06:45,680 INFO L225 Difference]: With dead ends: 5072 [2022-01-18 02:06:45,680 INFO L226 Difference]: Without dead ends: 5068 [2022-01-18 02:06:45,682 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-01-18 02:06:45,687 INFO L933 BasicCegarLoop]: 125 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, 125 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.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:06:45,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:06:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2022-01-18 02:06:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 5068. [2022-01-18 02:06:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5068 states, 5067 states have (on average 3.544306295638445) internal successors, (17959), 5067 states have internal predecessors, (17959), 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-01-18 02:06:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5068 states to 5068 states and 17959 transitions. [2022-01-18 02:06:45,968 INFO L78 Accepts]: Start accepts. Automaton has 5068 states and 17959 transitions. Word has length 105 [2022-01-18 02:06:45,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:06:45,969 INFO L470 AbstractCegarLoop]: Abstraction has 5068 states and 17959 transitions. [2022-01-18 02:06:45,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 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-01-18 02:06:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5068 states and 17959 transitions. [2022-01-18 02:06:45,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 02:06:45,986 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:06:45,986 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] [2022-01-18 02:06:45,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 02:06:45,987 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:06:45,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:06:45,988 INFO L85 PathProgramCache]: Analyzing trace with hash 613749194, now seen corresponding path program 1 times [2022-01-18 02:06:45,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:06:45,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546654953] [2022-01-18 02:06:45,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:45,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:06:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:06:46,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:06:46,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546654953] [2022-01-18 02:06:46,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546654953] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:06:46,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:06:46,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 02:06:46,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034730866] [2022-01-18 02:06:46,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:06:46,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 02:06:46,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:06:46,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 02:06:46,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 02:06:46,255 INFO L87 Difference]: Start difference. First operand 5068 states and 17959 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-01-18 02:06:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:06:46,541 INFO L93 Difference]: Finished difference Result 9970 states and 35356 transitions. [2022-01-18 02:06:46,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 02:06:46,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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 105 [2022-01-18 02:06:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:06:46,629 INFO L225 Difference]: With dead ends: 9970 [2022-01-18 02:06:46,629 INFO L226 Difference]: Without dead ends: 9820 [2022-01-18 02:06:46,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-18 02:06:46,635 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 174 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:06:46,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 477 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:06:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2022-01-18 02:06:46,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 5678. [2022-01-18 02:06:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5678 states, 5677 states have (on average 3.5317949621278846) internal successors, (20050), 5677 states have internal predecessors, (20050), 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-01-18 02:06:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 20050 transitions. [2022-01-18 02:06:46,921 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 20050 transitions. Word has length 105 [2022-01-18 02:06:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:06:46,925 INFO L470 AbstractCegarLoop]: Abstraction has 5678 states and 20050 transitions. [2022-01-18 02:06:46,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-01-18 02:06:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 20050 transitions. [2022-01-18 02:06:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-18 02:06:46,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:06:46,950 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] [2022-01-18 02:06:46,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 02:06:46,951 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:06:46,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:06:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2081314034, now seen corresponding path program 1 times [2022-01-18 02:06:46,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:06:46,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594332889] [2022-01-18 02:06:46,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:46,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:06:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:06:47,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:06:47,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594332889] [2022-01-18 02:06:47,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594332889] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:06:47,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:06:47,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 02:06:47,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240462406] [2022-01-18 02:06:47,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:06:47,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 02:06:47,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:06:47,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 02:06:47,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-18 02:06:47,180 INFO L87 Difference]: Start difference. First operand 5678 states and 20050 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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-01-18 02:06:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:06:47,498 INFO L93 Difference]: Finished difference Result 8818 states and 30445 transitions. [2022-01-18 02:06:47,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 02:06:47,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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 111 [2022-01-18 02:06:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:06:47,581 INFO L225 Difference]: With dead ends: 8818 [2022-01-18 02:06:47,581 INFO L226 Difference]: Without dead ends: 8728 [2022-01-18 02:06:47,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-01-18 02:06:47,582 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 554 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:06:47,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 675 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:06:47,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2022-01-18 02:06:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 6938. [2022-01-18 02:06:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6938 states, 6937 states have (on average 3.5180913939743403) internal successors, (24405), 6937 states have internal predecessors, (24405), 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-01-18 02:06:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 24405 transitions. [2022-01-18 02:06:47,833 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 24405 transitions. Word has length 111 [2022-01-18 02:06:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:06:47,833 INFO L470 AbstractCegarLoop]: Abstraction has 6938 states and 24405 transitions. [2022-01-18 02:06:47,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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-01-18 02:06:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 24405 transitions. [2022-01-18 02:06:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-18 02:06:47,901 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:06:47,901 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] [2022-01-18 02:06:47,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 02:06:47,902 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:06:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:06:47,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1189826400, now seen corresponding path program 1 times [2022-01-18 02:06:47,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:06:47,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175910830] [2022-01-18 02:06:47,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:47,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:06:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:06:48,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:06:48,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175910830] [2022-01-18 02:06:48,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175910830] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:06:48,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:06:48,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 02:06:48,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399467228] [2022-01-18 02:06:48,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:06:48,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 02:06:48,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:06:48,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 02:06:48,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-18 02:06:48,201 INFO L87 Difference]: Start difference. First operand 6938 states and 24405 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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-01-18 02:06:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:06:48,654 INFO L93 Difference]: Finished difference Result 7558 states and 25776 transitions. [2022-01-18 02:06:48,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 02:06:48,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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 111 [2022-01-18 02:06:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:06:48,686 INFO L225 Difference]: With dead ends: 7558 [2022-01-18 02:06:48,687 INFO L226 Difference]: Without dead ends: 7294 [2022-01-18 02:06:48,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-01-18 02:06:48,695 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 564 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:06:48,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [564 Valid, 635 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:06:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2022-01-18 02:06:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 6848. [2022-01-18 02:06:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6848 states, 6847 states have (on average 3.465897473345991) internal successors, (23731), 6847 states have internal predecessors, (23731), 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-01-18 02:06:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6848 states to 6848 states and 23731 transitions. [2022-01-18 02:06:48,947 INFO L78 Accepts]: Start accepts. Automaton has 6848 states and 23731 transitions. Word has length 111 [2022-01-18 02:06:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:06:48,948 INFO L470 AbstractCegarLoop]: Abstraction has 6848 states and 23731 transitions. [2022-01-18 02:06:48,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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-01-18 02:06:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 6848 states and 23731 transitions. [2022-01-18 02:06:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-18 02:06:48,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:06:48,968 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] [2022-01-18 02:06:48,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 02:06:48,968 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:06:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:06:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash -805575258, now seen corresponding path program 1 times [2022-01-18 02:06:48,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:06:48,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51003714] [2022-01-18 02:06:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:48,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:06:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:06:49,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:06:49,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51003714] [2022-01-18 02:06:49,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51003714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:06:49,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:06:49,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 02:06:49,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355650027] [2022-01-18 02:06:49,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:06:49,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 02:06:49,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:06:49,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 02:06:49,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-18 02:06:49,078 INFO L87 Difference]: Start difference. First operand 6848 states and 23731 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-01-18 02:06:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:06:49,211 INFO L93 Difference]: Finished difference Result 5971 states and 20798 transitions. [2022-01-18 02:06:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 02:06:49,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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 111 [2022-01-18 02:06:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:06:49,234 INFO L225 Difference]: With dead ends: 5971 [2022-01-18 02:06:49,235 INFO L226 Difference]: Without dead ends: 5684 [2022-01-18 02:06:49,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-18 02:06:49,236 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 379 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:06:49,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 393 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:06:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5684 states. [2022-01-18 02:06:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5684 to 5679. [2022-01-18 02:06:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5679 states, 5678 states have (on average 3.5313490665727367) internal successors, (20051), 5678 states have internal predecessors, (20051), 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-01-18 02:06:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 20051 transitions. [2022-01-18 02:06:49,452 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 20051 transitions. Word has length 111 [2022-01-18 02:06:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:06:49,453 INFO L470 AbstractCegarLoop]: Abstraction has 5679 states and 20051 transitions. [2022-01-18 02:06:49,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-01-18 02:06:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 20051 transitions. [2022-01-18 02:06:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 02:06:49,468 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:06:49,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 02:06:49,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 02:06:49,468 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:06:49,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:06:49,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1704257340, now seen corresponding path program 1 times [2022-01-18 02:06:49,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:06:49,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187045055] [2022-01-18 02:06:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:49,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:06:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:49,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:06:49,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187045055] [2022-01-18 02:06:49,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187045055] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:06:49,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469285037] [2022-01-18 02:06:49,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:49,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:06:49,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:06:49,555 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-01-18 02:06:49,584 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-01-18 02:06:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:49,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 02:06:49,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:06:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:49,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:06:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:50,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469285037] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 02:06:50,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 02:06:50,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 02:06:50,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345573898] [2022-01-18 02:06:50,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:06:50,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 02:06:50,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:06:50,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 02:06:50,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 02:06:50,278 INFO L87 Difference]: Start difference. First operand 5679 states and 20051 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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-01-18 02:06:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:06:50,453 INFO L93 Difference]: Finished difference Result 5775 states and 20516 transitions. [2022-01-18 02:06:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 02:06:50,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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 118 [2022-01-18 02:06:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:06:50,479 INFO L225 Difference]: With dead ends: 5775 [2022-01-18 02:06:50,479 INFO L226 Difference]: Without dead ends: 5775 [2022-01-18 02:06:50,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 228 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-01-18 02:06:50,480 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 248 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:06:50,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 335 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:06:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2022-01-18 02:06:50,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5535. [2022-01-18 02:06:50,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5535 states, 5534 states have (on average 3.5511384170581857) internal successors, (19652), 5534 states have internal predecessors, (19652), 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-01-18 02:06:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 19652 transitions. [2022-01-18 02:06:50,647 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 19652 transitions. Word has length 118 [2022-01-18 02:06:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:06:50,647 INFO L470 AbstractCegarLoop]: Abstraction has 5535 states and 19652 transitions. [2022-01-18 02:06:50,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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-01-18 02:06:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 19652 transitions. [2022-01-18 02:06:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 02:06:50,661 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:06:50,662 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] [2022-01-18 02:06:50,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-18 02:06:50,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-18 02:06:50,884 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:06:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:06:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1314971180, now seen corresponding path program 1 times [2022-01-18 02:06:50,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:06:50,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935450113] [2022-01-18 02:06:50,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:50,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:06:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:51,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:06:51,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935450113] [2022-01-18 02:06:51,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935450113] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:06:51,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175249586] [2022-01-18 02:06:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:51,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:06:51,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:06:51,005 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-01-18 02:06:51,011 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-01-18 02:06:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:51,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 02:06:51,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:06:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:51,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:06:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:51,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175249586] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 02:06:51,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 02:06:51,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-01-18 02:06:51,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412538251] [2022-01-18 02:06:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:06:51,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 02:06:51,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:06:51,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 02:06:51,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-01-18 02:06:51,661 INFO L87 Difference]: Start difference. First operand 5535 states and 19652 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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-01-18 02:06:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:06:51,940 INFO L93 Difference]: Finished difference Result 7577 states and 27120 transitions. [2022-01-18 02:06:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 02:06:51,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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 118 [2022-01-18 02:06:51,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:06:51,969 INFO L225 Difference]: With dead ends: 7577 [2022-01-18 02:06:51,969 INFO L226 Difference]: Without dead ends: 7577 [2022-01-18 02:06:51,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2022-01-18 02:06:51,970 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 373 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:06:51,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 576 Invalid, 167 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:06:51,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2022-01-18 02:06:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 5864. [2022-01-18 02:06:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5864 states, 5863 states have (on average 3.551594746716698) internal successors, (20823), 5863 states have internal predecessors, (20823), 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-01-18 02:06:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 20823 transitions. [2022-01-18 02:06:52,136 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 20823 transitions. Word has length 118 [2022-01-18 02:06:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:06:52,137 INFO L470 AbstractCegarLoop]: Abstraction has 5864 states and 20823 transitions. [2022-01-18 02:06:52,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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-01-18 02:06:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 20823 transitions. [2022-01-18 02:06:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 02:06:52,152 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:06:52,152 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] [2022-01-18 02:06:52,178 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-01-18 02:06:52,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-01-18 02:06:52,376 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:06:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:06:52,376 INFO L85 PathProgramCache]: Analyzing trace with hash 267659860, now seen corresponding path program 2 times [2022-01-18 02:06:52,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:06:52,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010087078] [2022-01-18 02:06:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:52,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:06:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:52,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:06:52,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010087078] [2022-01-18 02:06:52,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010087078] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:06:52,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650236202] [2022-01-18 02:06:52,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:06:52,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:06:52,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:06:52,492 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-01-18 02:06:52,494 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-01-18 02:06:52,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:06:52,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:06:52,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 02:06:52,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:06:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:52,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:06:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:53,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650236202] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:06:53,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:06:53,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-01-18 02:06:53,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293390976] [2022-01-18 02:06:53,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:06:53,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-18 02:06:53,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:06:53,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-18 02:06:53,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-01-18 02:06:53,026 INFO L87 Difference]: Start difference. First operand 5864 states and 20823 transitions. Second operand has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 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-01-18 02:06:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:06:54,181 INFO L93 Difference]: Finished difference Result 26682 states and 97534 transitions. [2022-01-18 02:06:54,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-18 02:06:54,181 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 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 118 [2022-01-18 02:06:54,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:06:54,304 INFO L225 Difference]: With dead ends: 26682 [2022-01-18 02:06:54,305 INFO L226 Difference]: Without dead ends: 26682 [2022-01-18 02:06:54,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=570, Invalid=1686, Unknown=0, NotChecked=0, Total=2256 [2022-01-18 02:06:54,306 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1077 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:06:54,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1077 Valid, 1713 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 02:06:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26682 states. [2022-01-18 02:06:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26682 to 5911. [2022-01-18 02:06:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5911 states, 5910 states have (on average 3.5686971235194584) internal successors, (21091), 5910 states have internal predecessors, (21091), 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-01-18 02:06:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 21091 transitions. [2022-01-18 02:06:54,788 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 21091 transitions. Word has length 118 [2022-01-18 02:06:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:06:54,789 INFO L470 AbstractCegarLoop]: Abstraction has 5911 states and 21091 transitions. [2022-01-18 02:06:54,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 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-01-18 02:06:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 21091 transitions. [2022-01-18 02:06:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 02:06:54,800 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:06:54,800 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] [2022-01-18 02:06:54,819 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-01-18 02:06:55,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:06:55,010 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:06:55,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:06:55,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1570091000, now seen corresponding path program 3 times [2022-01-18 02:06:55,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:06:55,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018340694] [2022-01-18 02:06:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:55,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:06:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:55,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:06:55,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018340694] [2022-01-18 02:06:55,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018340694] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:06:55,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109171823] [2022-01-18 02:06:55,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:06:55,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:06:55,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:06:55,112 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-01-18 02:06:55,144 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-01-18 02:06:55,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 02:06:55,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:06:55,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 02:06:55,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:06:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:55,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:06:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:55,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109171823] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:06:55,620 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:06:55,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-01-18 02:06:55,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760643659] [2022-01-18 02:06:55,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:06:55,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-18 02:06:55,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:06:55,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-18 02:06:55,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-01-18 02:06:55,622 INFO L87 Difference]: Start difference. First operand 5911 states and 21091 transitions. Second operand has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 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-01-18 02:06:56,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:06:56,538 INFO L93 Difference]: Finished difference Result 18477 states and 67462 transitions. [2022-01-18 02:06:56,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-18 02:06:56,539 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 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 118 [2022-01-18 02:06:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:06:56,613 INFO L225 Difference]: With dead ends: 18477 [2022-01-18 02:06:56,614 INFO L226 Difference]: Without dead ends: 18477 [2022-01-18 02:06:56,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=970, Unknown=0, NotChecked=0, Total=1332 [2022-01-18 02:06:56,615 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 752 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:06:56,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 1606 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 02:06:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18477 states. [2022-01-18 02:06:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18477 to 6055. [2022-01-18 02:06:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6055 states, 6054 states have (on average 3.5632639577139082) internal successors, (21572), 6054 states have internal predecessors, (21572), 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-01-18 02:06:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6055 states to 6055 states and 21572 transitions. [2022-01-18 02:06:56,935 INFO L78 Accepts]: Start accepts. Automaton has 6055 states and 21572 transitions. Word has length 118 [2022-01-18 02:06:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:06:56,935 INFO L470 AbstractCegarLoop]: Abstraction has 6055 states and 21572 transitions. [2022-01-18 02:06:56,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 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-01-18 02:06:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 6055 states and 21572 transitions. [2022-01-18 02:06:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 02:06:56,952 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:06:56,953 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] [2022-01-18 02:06:56,976 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-01-18 02:06:57,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:06:57,171 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:06:57,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:06:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2139413420, now seen corresponding path program 4 times [2022-01-18 02:06:57,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:06:57,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451207290] [2022-01-18 02:06:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:57,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:06:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:57,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:06:57,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451207290] [2022-01-18 02:06:57,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451207290] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:06:57,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392434719] [2022-01-18 02:06:57,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 02:06:57,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:06:57,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:06:57,275 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-01-18 02:06:57,308 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-01-18 02:06:57,373 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 02:06:57,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:06:57,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 02:06:57,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:06:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:57,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:06:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:58,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392434719] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 02:06:58,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 02:06:58,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2022-01-18 02:06:58,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578896120] [2022-01-18 02:06:58,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:06:58,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 02:06:58,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:06:58,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 02:06:58,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-01-18 02:06:58,017 INFO L87 Difference]: Start difference. First operand 6055 states and 21572 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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-01-18 02:06:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:06:58,284 INFO L93 Difference]: Finished difference Result 12871 states and 46133 transitions. [2022-01-18 02:06:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 02:06:58,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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 118 [2022-01-18 02:06:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:06:58,317 INFO L225 Difference]: With dead ends: 12871 [2022-01-18 02:06:58,317 INFO L226 Difference]: Without dead ends: 12871 [2022-01-18 02:06:58,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-01-18 02:06:58,318 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 391 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:06:58,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 734 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:06:58,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12871 states. [2022-01-18 02:06:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12871 to 6215. [2022-01-18 02:06:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6215 states, 6214 states have (on average 3.5926939169616996) internal successors, (22325), 6214 states have internal predecessors, (22325), 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-01-18 02:06:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 22325 transitions. [2022-01-18 02:06:58,533 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 22325 transitions. Word has length 118 [2022-01-18 02:06:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:06:58,533 INFO L470 AbstractCegarLoop]: Abstraction has 6215 states and 22325 transitions. [2022-01-18 02:06:58,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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-01-18 02:06:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 22325 transitions. [2022-01-18 02:06:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 02:06:58,547 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:06:58,547 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] [2022-01-18 02:06:58,572 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-01-18 02:06:58,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-18 02:06:58,770 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:06:58,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:06:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash -836982280, now seen corresponding path program 5 times [2022-01-18 02:06:58,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:06:58,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676255863] [2022-01-18 02:06:58,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:06:58,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:06:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:06:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:58,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:06:58,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676255863] [2022-01-18 02:06:58,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676255863] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:06:58,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455718011] [2022-01-18 02:06:58,864 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:06:58,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:06:58,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:06:58,866 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-01-18 02:06:58,867 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-01-18 02:06:58,964 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:06:58,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:06:58,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 02:06:58,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:06:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:59,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:06:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:06:59,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455718011] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:06:59,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:06:59,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-01-18 02:06:59,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187248011] [2022-01-18 02:06:59,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:06:59,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-18 02:06:59,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:06:59,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-18 02:06:59,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-01-18 02:06:59,435 INFO L87 Difference]: Start difference. First operand 6215 states and 22325 transitions. Second operand has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 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-01-18 02:07:00,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:07:00,422 INFO L93 Difference]: Finished difference Result 22956 states and 82999 transitions. [2022-01-18 02:07:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-18 02:07:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 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 118 [2022-01-18 02:07:00,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:07:00,487 INFO L225 Difference]: With dead ends: 22956 [2022-01-18 02:07:00,488 INFO L226 Difference]: Without dead ends: 22956 [2022-01-18 02:07:00,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=1076, Unknown=0, NotChecked=0, Total=1482 [2022-01-18 02:07:00,489 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 722 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 02:07:00,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 2690 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 02:07:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22956 states. [2022-01-18 02:07:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22956 to 6168. [2022-01-18 02:07:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6168 states, 6167 states have (on average 3.5766174801362087) internal successors, (22057), 6167 states have internal predecessors, (22057), 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-01-18 02:07:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6168 states to 6168 states and 22057 transitions. [2022-01-18 02:07:00,791 INFO L78 Accepts]: Start accepts. Automaton has 6168 states and 22057 transitions. Word has length 118 [2022-01-18 02:07:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:07:00,791 INFO L470 AbstractCegarLoop]: Abstraction has 6168 states and 22057 transitions. [2022-01-18 02:07:00,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 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-01-18 02:07:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6168 states and 22057 transitions. [2022-01-18 02:07:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 02:07:00,835 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:07:00,835 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] [2022-01-18 02:07:00,851 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-01-18 02:07:01,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:07:01,036 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:07:01,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:07:01,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1449163496, now seen corresponding path program 6 times [2022-01-18 02:07:01,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:07:01,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581957331] [2022-01-18 02:07:01,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:07:01,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:07:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:07:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:07:01,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:07:01,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581957331] [2022-01-18 02:07:01,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581957331] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:07:01,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499670359] [2022-01-18 02:07:01,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:07:01,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:07:01,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:07:01,128 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-01-18 02:07:01,131 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-01-18 02:07:01,220 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-01-18 02:07:01,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:07:01,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 02:07:01,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:07:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:07:01,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:07:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:07:01,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499670359] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:07:01,598 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:07:01,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-01-18 02:07:01,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163828212] [2022-01-18 02:07:01,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:07:01,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 02:07:01,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:07:01,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 02:07:01,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-01-18 02:07:01,599 INFO L87 Difference]: Start difference. First operand 6168 states and 22057 transitions. Second operand has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 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-01-18 02:07:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:07:02,160 INFO L93 Difference]: Finished difference Result 14859 states and 53179 transitions. [2022-01-18 02:07:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-18 02:07:02,160 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 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 118 [2022-01-18 02:07:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:07:02,199 INFO L225 Difference]: With dead ends: 14859 [2022-01-18 02:07:02,199 INFO L226 Difference]: Without dead ends: 14859 [2022-01-18 02:07:02,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2022-01-18 02:07:02,200 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 535 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 02:07:02,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 1835 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-18 02:07:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2022-01-18 02:07:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 6510. [2022-01-18 02:07:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6510 states, 6509 states have (on average 3.5437087110155168) internal successors, (23066), 6509 states have internal predecessors, (23066), 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-01-18 02:07:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 23066 transitions. [2022-01-18 02:07:02,372 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 23066 transitions. Word has length 118 [2022-01-18 02:07:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:07:02,372 INFO L470 AbstractCegarLoop]: Abstraction has 6510 states and 23066 transitions. [2022-01-18 02:07:02,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 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-01-18 02:07:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 23066 transitions. [2022-01-18 02:07:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:07:02,385 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:07:02,385 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] [2022-01-18 02:07:02,400 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-01-18 02:07:02,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:07:02,585 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:07:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:07:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash 372116376, now seen corresponding path program 1 times [2022-01-18 02:07:02,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:07:02,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968832407] [2022-01-18 02:07:02,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:07:02,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:07:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:07:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:07:03,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:07:03,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968832407] [2022-01-18 02:07:03,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968832407] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:07:03,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42501218] [2022-01-18 02:07:03,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:07:03,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:07:03,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:07:03,020 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-01-18 02:07:03,031 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-01-18 02:07:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:07:03,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 71 conjunts are in the unsatisfiable core [2022-01-18 02:07:03,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:07:03,216 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-01-18 02:07:03,266 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 02:07:03,266 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-01-18 02:07:03,674 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:07:03,674 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-01-18 02:07:03,847 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-01-18 02:07:04,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:07:04,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:07:04,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:07:04,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:07:04,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-18 02:07:04,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-01-18 02:07:04,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:07:04,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int))) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-01-18 02:07:04,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) c_~res1~0)) 0)) is different from false [2022-01-18 02:07:04,959 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) (* (- 1) |c_thread1Thread1of1ForFork0_~tmp~0#1|) c_~res2~0) 0)) is different from false [2022-01-18 02:07:04,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (* (- 1) c_~res1~0)) 0)) is different from false [2022-01-18 02:07:04,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= 0 (+ (* (- 1) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) c_~res1~0)))) is different from false [2022-01-18 02:07:04,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) (* (- 1) (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-01-18 02:07:05,049 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res2~0 (* (- 1) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-01-18 02:07:05,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-01-18 02:07:05,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res2~0 (* (- 1) c_~res1~0))))) is different from false [2022-01-18 02:07:05,104 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:07:05,105 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 55 treesize of output 44 [2022-01-18 02:07:05,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 726 [2022-01-18 02:07:05,118 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 726 treesize of output 710 [2022-01-18 02:07:05,126 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 710 treesize of output 678 [2022-01-18 02:07:05,136 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 678 treesize of output 646 [2022-01-18 02:07:08,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 02:07:08,893 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-01-18 02:07:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-18 02:07:08,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42501218] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:07:08,916 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:07:08,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 22] total 54 [2022-01-18 02:07:08,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143975991] [2022-01-18 02:07:08,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:07:08,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-18 02:07:08,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:07:08,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-18 02:07:08,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1797, Unknown=9, NotChecked=846, Total=2862 [2022-01-18 02:07:08,919 INFO L87 Difference]: Start difference. First operand 6510 states and 23066 transitions. Second operand has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 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-01-18 02:07:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:07:11,849 INFO L93 Difference]: Finished difference Result 18736 states and 66973 transitions. [2022-01-18 02:07:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-18 02:07:11,849 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 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 124 [2022-01-18 02:07:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:07:11,897 INFO L225 Difference]: With dead ends: 18736 [2022-01-18 02:07:11,897 INFO L226 Difference]: Without dead ends: 18586 [2022-01-18 02:07:11,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 217 SyntacticMatches, 11 SemanticMatches, 81 ConstructedPredicates, 9 IntricatePredicates, 3 DeprecatedPredicates, 1559 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=668, Invalid=4761, Unknown=9, NotChecked=1368, Total=6806 [2022-01-18 02:07:11,899 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 1626 mSDsluCounter, 5401 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 5230 SdHoareTripleChecker+Invalid, 6137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4004 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:07:11,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1626 Valid, 5230 Invalid, 6137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2090 Invalid, 0 Unknown, 4004 Unchecked, 1.0s Time] [2022-01-18 02:07:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18586 states. [2022-01-18 02:07:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18586 to 9408. [2022-01-18 02:07:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9408 states, 9407 states have (on average 3.5748910385882855) internal successors, (33629), 9407 states have internal predecessors, (33629), 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-01-18 02:07:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9408 states to 9408 states and 33629 transitions. [2022-01-18 02:07:12,130 INFO L78 Accepts]: Start accepts. Automaton has 9408 states and 33629 transitions. Word has length 124 [2022-01-18 02:07:12,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:07:12,130 INFO L470 AbstractCegarLoop]: Abstraction has 9408 states and 33629 transitions. [2022-01-18 02:07:12,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 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-01-18 02:07:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9408 states and 33629 transitions. [2022-01-18 02:07:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:07:12,146 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:07:12,146 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] [2022-01-18 02:07:12,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-18 02:07:12,347 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,SelfDestructingSolverStorable12 [2022-01-18 02:07:12,347 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:07:12,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:07:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1263604010, now seen corresponding path program 1 times [2022-01-18 02:07:12,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:07:12,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344149003] [2022-01-18 02:07:12,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:07:12,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:07:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:07:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:07:13,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:07:13,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344149003] [2022-01-18 02:07:13,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344149003] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:07:13,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320852525] [2022-01-18 02:07:13,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:07:13,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:07:13,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:07:13,193 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-01-18 02:07:13,194 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-01-18 02:07:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:07:13,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 85 conjunts are in the unsatisfiable core [2022-01-18 02:07:13,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:07:13,367 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-01-18 02:07:13,416 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 02:07:13,417 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-01-18 02:07:13,948 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:07:13,948 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-01-18 02:07:14,199 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-18 02:07:15,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:07:15,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:07:15,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:07:15,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:07:15,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 02:07:15,849 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:07:15,850 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 17 treesize of output 10 [2022-01-18 02:07:15,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:07:15,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:07:17,854 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:07:17,854 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 55 treesize of output 44 [2022-01-18 02:07:17,865 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:07:17,866 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 830 treesize of output 746 [2022-01-18 02:07:17,880 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 734 treesize of output 638 [2022-01-18 02:07:17,897 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 638 treesize of output 590 [2022-01-18 02:07:17,911 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:07:17,911 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 590 treesize of output 546 [2022-01-18 02:07:20,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 02:07:20,228 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-01-18 02:07:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:07:20,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320852525] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:07:20,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:07:20,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 32] total 83 [2022-01-18 02:07:20,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005518823] [2022-01-18 02:07:20,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:07:20,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-01-18 02:07:20,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:07:20,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-01-18 02:07:20,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=6217, Unknown=74, NotChecked=0, Total=6806 [2022-01-18 02:07:20,254 INFO L87 Difference]: Start difference. First operand 9408 states and 33629 transitions. Second operand has 83 states, 83 states have (on average 3.63855421686747) internal successors, (302), 83 states have internal predecessors, (302), 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-01-18 02:07:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:07:27,736 INFO L93 Difference]: Finished difference Result 36669 states and 132152 transitions. [2022-01-18 02:07:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-18 02:07:27,736 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 3.63855421686747) internal successors, (302), 83 states have internal predecessors, (302), 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 124 [2022-01-18 02:07:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:07:27,846 INFO L225 Difference]: With dead ends: 36669 [2022-01-18 02:07:27,846 INFO L226 Difference]: Without dead ends: 36369 [2022-01-18 02:07:27,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5892 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2233, Invalid=17715, Unknown=74, NotChecked=0, Total=20022 [2022-01-18 02:07:27,850 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 3268 mSDsluCounter, 10626 mSDsCounter, 0 mSdLazyCounter, 4953 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3268 SdHoareTripleChecker+Valid, 9915 SdHoareTripleChecker+Invalid, 8507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 4953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3452 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-18 02:07:27,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3268 Valid, 9915 Invalid, 8507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 4953 Invalid, 0 Unknown, 3452 Unchecked, 2.2s Time] [2022-01-18 02:07:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36369 states. [2022-01-18 02:07:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36369 to 11810. [2022-01-18 02:07:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11810 states, 11809 states have (on average 3.587009907697519) internal successors, (42359), 11809 states have internal predecessors, (42359), 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-01-18 02:07:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11810 states to 11810 states and 42359 transitions. [2022-01-18 02:07:28,244 INFO L78 Accepts]: Start accepts. Automaton has 11810 states and 42359 transitions. Word has length 124 [2022-01-18 02:07:28,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:07:28,245 INFO L470 AbstractCegarLoop]: Abstraction has 11810 states and 42359 transitions. [2022-01-18 02:07:28,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 3.63855421686747) internal successors, (302), 83 states have internal predecessors, (302), 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-01-18 02:07:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 11810 states and 42359 transitions. [2022-01-18 02:07:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:07:28,265 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:07:28,265 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] [2022-01-18 02:07:28,280 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-01-18 02:07:28,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-18 02:07:28,465 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:07:28,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:07:28,466 INFO L85 PathProgramCache]: Analyzing trace with hash 541534492, now seen corresponding path program 2 times [2022-01-18 02:07:28,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:07:28,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368512066] [2022-01-18 02:07:28,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:07:28,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:07:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:07:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:07:28,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:07:28,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368512066] [2022-01-18 02:07:28,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368512066] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:07:28,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751985197] [2022-01-18 02:07:28,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:07:28,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:07:28,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:07:28,960 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:07:28,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-18 02:07:29,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:07:29,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:07:29,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-18 02:07:29,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:07:29,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:07:29,783 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 18 treesize of output 20 [2022-01-18 02:07:29,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:07:29,870 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 18 treesize of output 20 [2022-01-18 02:07:29,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-18 02:07:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:07:30,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:07:30,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int))) (= 0 (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_406) c_~A~0.base) c_~A~0.offset)) |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) c_~res2~0)))) is different from false [2022-01-18 02:07:30,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (+ (* (- 1) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_406) c_~A~0.base) c_~A~0.offset)) |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) c_~res2~0)) 0)) is different from false [2022-01-18 02:07:30,267 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:07:30,267 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 116 treesize of output 92 [2022-01-18 02:07:30,270 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 80 treesize of output 76 [2022-01-18 02:07:30,274 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 38 treesize of output 36 [2022-01-18 02:07:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:07:30,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751985197] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:07:30,843 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:07:30,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 20] total 51 [2022-01-18 02:07:30,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603785571] [2022-01-18 02:07:30,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:07:30,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-18 02:07:30,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:07:30,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-18 02:07:30,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2127, Unknown=2, NotChecked=190, Total=2550 [2022-01-18 02:07:30,845 INFO L87 Difference]: Start difference. First operand 11810 states and 42359 transitions. Second operand has 51 states, 51 states have (on average 5.666666666666667) internal successors, (289), 51 states have internal predecessors, (289), 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-01-18 02:07:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:07:32,628 INFO L93 Difference]: Finished difference Result 18584 states and 66824 transitions. [2022-01-18 02:07:32,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 02:07:32,629 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.666666666666667) internal successors, (289), 51 states have internal predecessors, (289), 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 124 [2022-01-18 02:07:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:07:32,678 INFO L225 Difference]: With dead ends: 18584 [2022-01-18 02:07:32,679 INFO L226 Difference]: Without dead ends: 18434 [2022-01-18 02:07:32,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=628, Invalid=4070, Unknown=2, NotChecked=270, Total=4970 [2022-01-18 02:07:32,681 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 1208 mSDsluCounter, 3922 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 3874 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 663 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 02:07:32,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1208 Valid, 3874 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1389 Invalid, 0 Unknown, 663 Unchecked, 0.5s Time] [2022-01-18 02:07:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18434 states. [2022-01-18 02:07:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18434 to 12232. [2022-01-18 02:07:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12232 states, 12231 states have (on average 3.5917749979560134) internal successors, (43931), 12231 states have internal predecessors, (43931), 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-01-18 02:07:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12232 states to 12232 states and 43931 transitions. [2022-01-18 02:07:32,956 INFO L78 Accepts]: Start accepts. Automaton has 12232 states and 43931 transitions. Word has length 124 [2022-01-18 02:07:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:07:32,956 INFO L470 AbstractCegarLoop]: Abstraction has 12232 states and 43931 transitions. [2022-01-18 02:07:32,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.666666666666667) internal successors, (289), 51 states have internal predecessors, (289), 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-01-18 02:07:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 12232 states and 43931 transitions. [2022-01-18 02:07:32,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:07:32,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:07:32,982 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] [2022-01-18 02:07:32,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-18 02:07:33,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-18 02:07:33,184 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:07:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:07:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1105715552, now seen corresponding path program 3 times [2022-01-18 02:07:33,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:07:33,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785358081] [2022-01-18 02:07:33,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:07:33,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:07:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:07:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:07:33,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:07:33,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785358081] [2022-01-18 02:07:33,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785358081] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:07:33,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359894362] [2022-01-18 02:07:33,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:07:33,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:07:33,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:07:33,581 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:07:33,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-18 02:07:33,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 02:07:33,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:07:33,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-18 02:07:33,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:07:34,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:07:34,438 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 18 treesize of output 20 [2022-01-18 02:07:34,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:07:34,524 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 18 treesize of output 20 [2022-01-18 02:07:34,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-18 02:07:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:07:34,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:07:34,865 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base) c_~A~0.offset)) |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) c_~res2~0)) 0)) is different from false [2022-01-18 02:07:34,883 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (= (+ |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res2~0)) 0)) is different from false [2022-01-18 02:07:34,901 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:07:34,901 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 116 treesize of output 92 [2022-01-18 02:07:34,905 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 40 treesize of output 38 [2022-01-18 02:07:34,907 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 78 treesize of output 74 [2022-01-18 02:07:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:07:35,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359894362] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:07:35,405 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:07:35,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 46 [2022-01-18 02:07:35,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291591146] [2022-01-18 02:07:35,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:07:35,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-18 02:07:35,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:07:35,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-18 02:07:35,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1701, Unknown=2, NotChecked=170, Total=2070 [2022-01-18 02:07:35,407 INFO L87 Difference]: Start difference. First operand 12232 states and 43931 transitions. Second operand has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 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-01-18 02:07:37,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:07:37,498 INFO L93 Difference]: Finished difference Result 37903 states and 136252 transitions. [2022-01-18 02:07:37,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-18 02:07:37,498 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 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 124 [2022-01-18 02:07:37,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:07:37,609 INFO L225 Difference]: With dead ends: 37903 [2022-01-18 02:07:37,609 INFO L226 Difference]: Without dead ends: 37603 [2022-01-18 02:07:37,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 222 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=739, Invalid=5429, Unknown=2, NotChecked=310, Total=6480 [2022-01-18 02:07:37,611 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 1655 mSDsluCounter, 5704 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 5528 SdHoareTripleChecker+Invalid, 3524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 996 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 02:07:37,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1655 Valid, 5528 Invalid, 3524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2455 Invalid, 0 Unknown, 996 Unchecked, 0.9s Time] [2022-01-18 02:07:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37603 states. [2022-01-18 02:07:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37603 to 12580. [2022-01-18 02:07:38,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12580 states, 12579 states have (on average 3.601955640352969) internal successors, (45309), 12579 states have internal predecessors, (45309), 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-01-18 02:07:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 45309 transitions. [2022-01-18 02:07:38,056 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 45309 transitions. Word has length 124 [2022-01-18 02:07:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:07:38,057 INFO L470 AbstractCegarLoop]: Abstraction has 12580 states and 45309 transitions. [2022-01-18 02:07:38,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 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-01-18 02:07:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 45309 transitions. [2022-01-18 02:07:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:07:38,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:07:38,084 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] [2022-01-18 02:07:38,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-18 02:07:38,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-18 02:07:38,307 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:07:38,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:07:38,308 INFO L85 PathProgramCache]: Analyzing trace with hash 879013074, now seen corresponding path program 4 times [2022-01-18 02:07:38,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:07:38,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651311488] [2022-01-18 02:07:38,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:07:38,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:07:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:07:38,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:07:38,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:07:38,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651311488] [2022-01-18 02:07:38,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651311488] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:07:38,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547569668] [2022-01-18 02:07:38,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 02:07:38,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:07:38,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:07:38,685 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:07:38,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-18 02:07:38,818 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 02:07:38,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:07:38,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 66 conjunts are in the unsatisfiable core [2022-01-18 02:07:38,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:07:39,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-18 02:07:39,555 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:07:39,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:07:39,714 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 18 treesize of output 20 [2022-01-18 02:07:39,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:07:39,776 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 18 treesize of output 20 [2022-01-18 02:07:39,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-18 02:07:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:07:39,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:07:40,092 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 (Array Int Int))) (= (+ (* (- 1) |c_thread1Thread1of1ForFork0_~tmp~0#1|) c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset)) 0)) is different from false [2022-01-18 02:07:40,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (+ (* (- 1) |c_thread1Thread1of1ForFork0_~tmp~0#1|) c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset)) 0)) is different from false [2022-01-18 02:07:40,130 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (+ c_~res2~0 (* (- 1) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-01-18 02:07:40,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= 0 (+ (* (- 1) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)))) is different from false [2022-01-18 02:07:40,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset) (* (- 1) (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-01-18 02:07:40,188 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ (* (- 1) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) c_~res2~0 (* (- 1) c_~res1~0) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))))) is different from false [2022-01-18 02:07:40,199 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res2~0 (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-01-18 02:07:40,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-01-18 02:07:40,238 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:07:40,238 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 55 treesize of output 44 [2022-01-18 02:07:40,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 726 [2022-01-18 02:07:40,246 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 726 treesize of output 694 [2022-01-18 02:07:40,250 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 694 treesize of output 662 [2022-01-18 02:07:40,254 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 646 [2022-01-18 02:07:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-18 02:07:40,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547569668] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:07:40,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:07:40,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 22] total 54 [2022-01-18 02:07:40,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285267746] [2022-01-18 02:07:40,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:07:40,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-18 02:07:40,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:07:40,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-18 02:07:40,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1875, Unknown=8, NotChecked=760, Total=2862 [2022-01-18 02:07:40,655 INFO L87 Difference]: Start difference. First operand 12580 states and 45309 transitions. Second operand has 54 states, 54 states have (on average 5.37037037037037) internal successors, (290), 54 states have internal predecessors, (290), 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-01-18 02:07:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:07:42,673 INFO L93 Difference]: Finished difference Result 30299 states and 108654 transitions. [2022-01-18 02:07:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-18 02:07:42,673 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.37037037037037) internal successors, (290), 54 states have internal predecessors, (290), 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 124 [2022-01-18 02:07:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:07:42,758 INFO L225 Difference]: With dead ends: 30299 [2022-01-18 02:07:42,758 INFO L226 Difference]: Without dead ends: 30149 [2022-01-18 02:07:42,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 219 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=535, Invalid=4601, Unknown=8, NotChecked=1176, Total=6320 [2022-01-18 02:07:42,760 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 1336 mSDsluCounter, 5099 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 4966 SdHoareTripleChecker+Invalid, 6068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3833 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 02:07:42,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1336 Valid, 4966 Invalid, 6068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2204 Invalid, 0 Unknown, 3833 Unchecked, 0.8s Time] [2022-01-18 02:07:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30149 states. [2022-01-18 02:07:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30149 to 12580. [2022-01-18 02:07:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12580 states, 12579 states have (on average 3.601955640352969) internal successors, (45309), 12579 states have internal predecessors, (45309), 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-01-18 02:07:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 45309 transitions. [2022-01-18 02:07:43,132 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 45309 transitions. Word has length 124 [2022-01-18 02:07:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:07:43,132 INFO L470 AbstractCegarLoop]: Abstraction has 12580 states and 45309 transitions. [2022-01-18 02:07:43,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.37037037037037) internal successors, (290), 54 states have internal predecessors, (290), 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-01-18 02:07:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 45309 transitions. [2022-01-18 02:07:43,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:07:43,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:07:43,155 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] [2022-01-18 02:07:43,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-18 02:07:43,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-18 02:07:43,364 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:07:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:07:43,365 INFO L85 PathProgramCache]: Analyzing trace with hash -732266808, now seen corresponding path program 2 times [2022-01-18 02:07:43,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:07:43,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192248828] [2022-01-18 02:07:43,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:07:43,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:07:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:07:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:07:44,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:07:44,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192248828] [2022-01-18 02:07:44,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192248828] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:07:44,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022719259] [2022-01-18 02:07:44,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:07:44,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:07:44,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:07:44,226 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:07:44,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-18 02:07:44,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:07:44,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:07:44,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-18 02:07:44,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:07:45,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:07:45,206 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 18 treesize of output 20 [2022-01-18 02:07:45,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:07:45,301 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 18 treesize of output 20 [2022-01-18 02:07:45,568 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:07:45,568 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 17 treesize of output 17 [2022-01-18 02:07:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:07:45,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:07:46,415 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork2_~i~2#1_41| Int) (v_ArrVal_511 (Array Int Int))) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_41|) (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_41| 1) c_~N~0) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_511) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_41| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 02:07:46,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork2_~i~2#1_41| Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_41|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_511) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_41| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_41| 1) c_~N~0))) is different from false [2022-01-18 02:07:46,667 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:07:46,668 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 116 treesize of output 92 [2022-01-18 02:07: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 76 treesize of output 64 [2022-01-18 02:07:46,676 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 34 treesize of output 28 [2022-01-18 02:07:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:07:47,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022719259] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:07:47,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:07:47,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 70 [2022-01-18 02:07:47,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848545551] [2022-01-18 02:07:47,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:07:47,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-01-18 02:07:47,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:07:47,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-01-18 02:07:47,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=4049, Unknown=2, NotChecked=266, Total=4830 [2022-01-18 02:07:47,431 INFO L87 Difference]: Start difference. First operand 12580 states and 45309 transitions. Second operand has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 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-01-18 02:08:26,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:08:26,493 INFO L93 Difference]: Finished difference Result 89801 states and 326321 transitions. [2022-01-18 02:08:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 473 states. [2022-01-18 02:08:26,493 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 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 124 [2022-01-18 02:08:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:08:26,803 INFO L225 Difference]: With dead ends: 89801 [2022-01-18 02:08:26,803 INFO L226 Difference]: Without dead ends: 89201 [2022-01-18 02:08:26,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 210 SyntacticMatches, 8 SemanticMatches, 521 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 118518 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=21399, Invalid=249527, Unknown=2, NotChecked=2078, Total=273006 [2022-01-18 02:08:26,821 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 4982 mSDsluCounter, 20796 mSDsCounter, 0 mSdLazyCounter, 18787 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4982 SdHoareTripleChecker+Valid, 19364 SdHoareTripleChecker+Invalid, 24904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 18787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5650 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-01-18 02:08:26,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4982 Valid, 19364 Invalid, 24904 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [467 Valid, 18787 Invalid, 0 Unknown, 5650 Unchecked, 8.2s Time] [2022-01-18 02:08:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89201 states. [2022-01-18 02:08:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89201 to 12803. [2022-01-18 02:08:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12803 states, 12802 states have (on average 3.6176378690829556) internal successors, (46313), 12802 states have internal predecessors, (46313), 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-01-18 02:08:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12803 states to 12803 states and 46313 transitions. [2022-01-18 02:08:27,648 INFO L78 Accepts]: Start accepts. Automaton has 12803 states and 46313 transitions. Word has length 124 [2022-01-18 02:08:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:08:27,648 INFO L470 AbstractCegarLoop]: Abstraction has 12803 states and 46313 transitions. [2022-01-18 02:08:27,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 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-01-18 02:08:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 12803 states and 46313 transitions. [2022-01-18 02:08:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:08:27,673 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:08:27,674 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] [2022-01-18 02:08:27,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-01-18 02:08:27,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-18 02:08:27,874 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:08:27,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:08:27,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1913273718, now seen corresponding path program 3 times [2022-01-18 02:08:27,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:08:27,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398143231] [2022-01-18 02:08:27,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:08:27,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:08:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:08:28,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:08:28,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:08:28,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398143231] [2022-01-18 02:08:28,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398143231] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:08:28,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851184672] [2022-01-18 02:08:28,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:08:28,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:08:28,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:08:28,675 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:08:28,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-18 02:08:28,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 02:08:28,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:08:28,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-18 02:08:28,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:08:29,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:08:29,642 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 18 treesize of output 20 [2022-01-18 02:08:29,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:08:29,734 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 18 treesize of output 20 [2022-01-18 02:08:29,889 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:08:29,889 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 21 treesize of output 21 [2022-01-18 02:08:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:08:30,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:08:30,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_44| Int)) (or (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_44| 1) c_~N~0) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_44| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_44|))) is different from false [2022-01-18 02:08:30,803 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_44| Int) (v_ArrVal_544 (Array Int Int))) (or (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_44| 1) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_44|) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_544) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_44| 4))))))) is different from false [2022-01-18 02:08:30,852 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:08:30,852 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 242 treesize of output 178 [2022-01-18 02:08:30,856 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 81 treesize of output 69 [2022-01-18 02:08:30,862 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 150 treesize of output 126 [2022-01-18 02:08:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:08:31,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851184672] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:08:31,689 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:08:31,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 70 [2022-01-18 02:08:31,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353958612] [2022-01-18 02:08:31,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:08:31,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-01-18 02:08:31,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:08:31,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-01-18 02:08:31,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=4046, Unknown=2, NotChecked=266, Total=4830 [2022-01-18 02:08:31,691 INFO L87 Difference]: Start difference. First operand 12803 states and 46313 transitions. Second operand has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 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-01-18 02:09:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:09:04,212 INFO L93 Difference]: Finished difference Result 72952 states and 266277 transitions. [2022-01-18 02:09:04,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 431 states. [2022-01-18 02:09:04,213 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 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 124 [2022-01-18 02:09:04,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:09:04,440 INFO L225 Difference]: With dead ends: 72952 [2022-01-18 02:09:04,440 INFO L226 Difference]: Without dead ends: 72652 [2022-01-18 02:09:04,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 220 SyntacticMatches, 33 SemanticMatches, 477 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 101099 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=20521, Invalid=206537, Unknown=2, NotChecked=1902, Total=228962 [2022-01-18 02:09:04,451 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 4524 mSDsluCounter, 17572 mSDsCounter, 0 mSdLazyCounter, 12271 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4524 SdHoareTripleChecker+Valid, 16496 SdHoareTripleChecker+Invalid, 19162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 12271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6459 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-01-18 02:09:04,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4524 Valid, 16496 Invalid, 19162 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [432 Valid, 12271 Invalid, 0 Unknown, 6459 Unchecked, 5.5s Time] [2022-01-18 02:09:04,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72652 states. [2022-01-18 02:09:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72652 to 13141. [2022-01-18 02:09:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13141 states, 13140 states have (on average 3.6317351598173517) internal successors, (47721), 13140 states have internal predecessors, (47721), 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-01-18 02:09:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13141 states to 13141 states and 47721 transitions. [2022-01-18 02:09:05,183 INFO L78 Accepts]: Start accepts. Automaton has 13141 states and 47721 transitions. Word has length 124 [2022-01-18 02:09:05,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:09:05,183 INFO L470 AbstractCegarLoop]: Abstraction has 13141 states and 47721 transitions. [2022-01-18 02:09:05,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 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-01-18 02:09:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 13141 states and 47721 transitions. [2022-01-18 02:09:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:09:05,207 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:09:05,208 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] [2022-01-18 02:09:05,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-01-18 02:09:05,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:09:05,408 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:09:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:09:05,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1254294472, now seen corresponding path program 4 times [2022-01-18 02:09:05,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:09:05,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939655001] [2022-01-18 02:09:05,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:09:05,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:09:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:09:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:09:06,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:09:06,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939655001] [2022-01-18 02:09:06,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939655001] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:09:06,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991148283] [2022-01-18 02:09:06,188 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 02:09:06,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:09:06,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:09:06,189 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:09:06,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-18 02:09:06,285 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 02:09:06,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:09:06,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-18 02:09:06,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:09:06,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 02:09:07,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:09:07,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:09:07,677 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 18 treesize of output 20 [2022-01-18 02:09:07,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:09:07,772 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 18 treesize of output 20 [2022-01-18 02:09:07,922 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:09:07,923 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 27 treesize of output 27 [2022-01-18 02:09:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:09:08,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:09:08,588 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:08,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:08,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:08,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:08,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:08,906 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:08,936 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:08,952 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) |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|))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:09,283 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:09:09,284 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 55 treesize of output 44 [2022-01-18 02:09:09,292 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:09:09,292 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 410 treesize of output 374 [2022-01-18 02:09:09,296 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 362 treesize of output 314 [2022-01-18 02:09:09,299 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 314 treesize of output 290 [2022-01-18 02:09:09,307 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:09:09,307 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 290 treesize of output 274 [2022-01-18 02:09:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 02:09:10,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991148283] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:09:10,466 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:09:10,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 85 [2022-01-18 02:09:10,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865795217] [2022-01-18 02:09:10,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:09:10,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-01-18 02:09:10,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:09:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-01-18 02:09:10,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=5417, Unknown=11, NotChecked=1256, Total=7140 [2022-01-18 02:09:10,467 INFO L87 Difference]: Start difference. First operand 13141 states and 47721 transitions. Second operand has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 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-01-18 02:09:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:09:20,937 INFO L93 Difference]: Finished difference Result 35886 states and 129652 transitions. [2022-01-18 02:09:20,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-18 02:09:20,937 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 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 124 [2022-01-18 02:09:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:09:21,042 INFO L225 Difference]: With dead ends: 35886 [2022-01-18 02:09:21,042 INFO L226 Difference]: Without dead ends: 35736 [2022-01-18 02:09:21,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 146 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 6265 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1665, Invalid=17816, Unknown=11, NotChecked=2264, Total=21756 [2022-01-18 02:09:21,045 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 2378 mSDsluCounter, 10050 mSDsCounter, 0 mSdLazyCounter, 4262 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2378 SdHoareTripleChecker+Valid, 9629 SdHoareTripleChecker+Invalid, 9589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 4262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5204 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 02:09:21,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2378 Valid, 9629 Invalid, 9589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 4262 Invalid, 0 Unknown, 5204 Unchecked, 1.8s Time] [2022-01-18 02:09:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35736 states. [2022-01-18 02:09:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35736 to 13355. [2022-01-18 02:09:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13355 states, 13354 states have (on average 3.635015725625281) internal successors, (48542), 13354 states have internal predecessors, (48542), 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-01-18 02:09:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13355 states to 13355 states and 48542 transitions. [2022-01-18 02:09:21,491 INFO L78 Accepts]: Start accepts. Automaton has 13355 states and 48542 transitions. Word has length 124 [2022-01-18 02:09:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:09:21,491 INFO L470 AbstractCegarLoop]: Abstraction has 13355 states and 48542 transitions. [2022-01-18 02:09:21,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 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-01-18 02:09:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 13355 states and 48542 transitions. [2022-01-18 02:09:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:09:21,517 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:09:21,517 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] [2022-01-18 02:09:21,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-01-18 02:09:21,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:09:21,718 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:09:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:09:21,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2051171398, now seen corresponding path program 5 times [2022-01-18 02:09:21,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:09:21,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868132417] [2022-01-18 02:09:21,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:09:21,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:09:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:09:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:09:22,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:09:22,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868132417] [2022-01-18 02:09:22,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868132417] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:09:22,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707923471] [2022-01-18 02:09:22,591 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:09:22,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:09:22,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:09:22,592 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:09:22,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-18 02:09:22,689 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 02:09:22,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:09:22,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 83 conjunts are in the unsatisfiable core [2022-01-18 02:09:22,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:09:22,734 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-01-18 02:09:22,769 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 02:09:22,769 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-01-18 02:09:22,823 INFO L353 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-01-18 02:09:22,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-01-18 02:09:23,367 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-18 02:09:23,368 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 24 treesize of output 34 [2022-01-18 02:09:23,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-18 02:09:24,092 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-01-18 02:09:24,379 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 18 treesize of output 20 [2022-01-18 02:09:24,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:09:24,486 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 18 treesize of output 20 [2022-01-18 02:09:24,651 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:09:24,652 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 27 treesize of output 27 [2022-01-18 02:09:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:09:24,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:09:25,350 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int)) (or (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:25,418 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:25,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:25,495 WARN L838 $PredicateComparison]: unable to prove that (or (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-01-18 02:09:25,512 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-01-18 02:09:25,544 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-01-18 02:09:25,724 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-01-18 02:09:25,759 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-01-18 02:09:25,778 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) |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_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-01-18 02:09:26,118 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:09:26,119 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 55 treesize of output 44 [2022-01-18 02:09:26,131 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:09:26,132 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 1670 treesize of output 1490 [2022-01-18 02:09:26,142 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 1478 treesize of output 1382 [2022-01-18 02:09:26,150 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 1382 treesize of output 1190 [2022-01-18 02:09:26,166 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:09:26,166 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 1190 treesize of output 1090 [2022-01-18 02:09:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 02:09:31,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707923471] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:09:31,796 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:09:31,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 34] total 85 [2022-01-18 02:09:31,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957523470] [2022-01-18 02:09:31,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:09:31,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-01-18 02:09:31,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:09:31,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-01-18 02:09:31,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=5300, Unknown=11, NotChecked=1404, Total=7140 [2022-01-18 02:09:31,797 INFO L87 Difference]: Start difference. First operand 13355 states and 48542 transitions. Second operand has 85 states, 85 states have (on average 3.447058823529412) internal successors, (293), 85 states have internal predecessors, (293), 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-01-18 02:09:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:09:40,994 INFO L93 Difference]: Finished difference Result 23721 states and 85469 transitions. [2022-01-18 02:09:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-18 02:09:40,994 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.447058823529412) internal successors, (293), 85 states have internal predecessors, (293), 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 124 [2022-01-18 02:09:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:09:41,056 INFO L225 Difference]: With dead ends: 23721 [2022-01-18 02:09:41,057 INFO L226 Difference]: Without dead ends: 23571 [2022-01-18 02:09:41,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 9 SemanticMatches, 121 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 3779 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1212, Invalid=11695, Unknown=11, NotChecked=2088, Total=15006 [2022-01-18 02:09:41,058 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1355 mSDsluCounter, 8168 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 7894 SdHoareTripleChecker+Invalid, 7136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4250 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 02:09:41,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1355 Valid, 7894 Invalid, 7136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2830 Invalid, 0 Unknown, 4250 Unchecked, 1.2s Time] [2022-01-18 02:09:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23571 states. [2022-01-18 02:09:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23571 to 13311. [2022-01-18 02:09:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13311 states, 13310 states have (on average 3.6322314049586777) internal successors, (48345), 13310 states have internal predecessors, (48345), 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-01-18 02:09:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13311 states to 13311 states and 48345 transitions. [2022-01-18 02:09:41,391 INFO L78 Accepts]: Start accepts. Automaton has 13311 states and 48345 transitions. Word has length 124 [2022-01-18 02:09:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:09:41,392 INFO L470 AbstractCegarLoop]: Abstraction has 13311 states and 48345 transitions. [2022-01-18 02:09:41,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.447058823529412) internal successors, (293), 85 states have internal predecessors, (293), 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-01-18 02:09:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 13311 states and 48345 transitions. [2022-01-18 02:09:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:09:41,417 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:09:41,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 02:09:41,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-18 02:09:41,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:09:41,619 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:09:41,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:09:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1783840602, now seen corresponding path program 6 times [2022-01-18 02:09:41,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:09:41,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919836922] [2022-01-18 02:09:41,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:09:41,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:09:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:09:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:09:42,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:09:42,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919836922] [2022-01-18 02:09:42,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919836922] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:09:42,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322728541] [2022-01-18 02:09:42,425 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:09:42,425 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:09:42,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:09:42,426 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:09:42,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-18 02:09:42,525 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 02:09:42,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:09:42,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-01-18 02:09:42,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:09:42,588 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-01-18 02:09:42,790 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:09:42,790 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 11 treesize of output 11 [2022-01-18 02:09:43,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:09:43,285 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 18 treesize of output 20 [2022-01-18 02:09:43,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-18 02:09:43,505 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:09:43,506 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 27 treesize of output 27 [2022-01-18 02:09:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:09:43,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:09:44,340 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_657) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:44,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_657) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:09:44,452 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:09:44,453 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 116 treesize of output 92 [2022-01-18 02:09:44,455 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 76 treesize of output 64 [2022-01-18 02:09:44,459 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 34 treesize of output 28 [2022-01-18 02:09:45,683 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-01-18 02:09:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:09:45,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322728541] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:09:45,750 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:09:45,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-01-18 02:09:45,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229679120] [2022-01-18 02:09:45,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:09:45,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-01-18 02:09:45,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:09:45,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-01-18 02:09:45,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=4287, Unknown=2, NotChecked=270, Total=4970 [2022-01-18 02:09:45,751 INFO L87 Difference]: Start difference. First operand 13311 states and 48345 transitions. Second operand has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 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-01-18 02:10:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:10:03,642 INFO L93 Difference]: Finished difference Result 46956 states and 170767 transitions. [2022-01-18 02:10:03,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2022-01-18 02:10:03,642 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 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 124 [2022-01-18 02:10:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:10:03,790 INFO L225 Difference]: With dead ends: 46956 [2022-01-18 02:10:03,791 INFO L226 Difference]: Without dead ends: 46521 [2022-01-18 02:10:03,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 213 SyntacticMatches, 24 SemanticMatches, 249 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 22581 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=7433, Invalid=54325, Unknown=2, NotChecked=990, Total=62750 [2022-01-18 02:10:03,797 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 2911 mSDsluCounter, 17291 mSDsCounter, 0 mSdLazyCounter, 6481 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2911 SdHoareTripleChecker+Valid, 16356 SdHoareTripleChecker+Invalid, 18788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 6481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12174 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:10:03,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2911 Valid, 16356 Invalid, 18788 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [133 Valid, 6481 Invalid, 0 Unknown, 12174 Unchecked, 3.0s Time] [2022-01-18 02:10:03,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46521 states. [2022-01-18 02:10:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46521 to 13892. [2022-01-18 02:10:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13892 states, 13891 states have (on average 3.653876610755165) internal successors, (50756), 13891 states have internal predecessors, (50756), 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-01-18 02:10:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13892 states to 13892 states and 50756 transitions. [2022-01-18 02:10:04,382 INFO L78 Accepts]: Start accepts. Automaton has 13892 states and 50756 transitions. Word has length 124 [2022-01-18 02:10:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:10:04,382 INFO L470 AbstractCegarLoop]: Abstraction has 13892 states and 50756 transitions. [2022-01-18 02:10:04,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 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-01-18 02:10:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 13892 states and 50756 transitions. [2022-01-18 02:10:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:10:04,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:10:04,409 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] [2022-01-18 02:10:04,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-01-18 02:10:04,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:10:04,609 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:10:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:10:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash -369162054, now seen corresponding path program 7 times [2022-01-18 02:10:04,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:10:04,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782621682] [2022-01-18 02:10:04,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:10:04,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:10:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:10:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:10:05,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:10:05,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782621682] [2022-01-18 02:10:05,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782621682] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:10:05,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736805697] [2022-01-18 02:10:05,516 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 02:10:05,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:10:05,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:10:05,517 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:10:05,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-18 02:10:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:10:05,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 77 conjunts are in the unsatisfiable core [2022-01-18 02:10:05,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:10:06,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 02:10:06,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:10:07,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:10:07,069 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 18 treesize of output 20 [2022-01-18 02:10:07,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:10:07,162 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 18 treesize of output 20 [2022-01-18 02:10:07,317 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:10:07,317 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 27 treesize of output 27 [2022-01-18 02:10:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:10:07,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:10:08,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)))) is different from false [2022-01-18 02:10:08,202 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-01-18 02:10:08,257 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-01-18 02:10:08,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-01-18 02:10:08,308 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-01-18 02:10:08,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))))) is different from false [2022-01-18 02:10:08,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0))))) is different from false [2022-01-18 02:10:08,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) |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|))))))) is different from false [2022-01-18 02:10:08,738 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:10:08,738 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 55 treesize of output 44 [2022-01-18 02:10:08,747 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:10:08,747 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 410 treesize of output 374 [2022-01-18 02:10:08,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 362 treesize of output 314 [2022-01-18 02:10:08,755 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 314 treesize of output 290 [2022-01-18 02:10:08,765 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:10:08,765 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 290 treesize of output 274 [2022-01-18 02:10:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 02:10:10,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736805697] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:10:10,666 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:10:10,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 84 [2022-01-18 02:10:10,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718569765] [2022-01-18 02:10:10,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:10:10,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-01-18 02:10:10,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:10:10,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-01-18 02:10:10,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=5244, Unknown=10, NotChecked=1240, Total=6972 [2022-01-18 02:10:10,668 INFO L87 Difference]: Start difference. First operand 13892 states and 50756 transitions. Second operand has 84 states, 84 states have (on average 3.630952380952381) internal successors, (305), 84 states have internal predecessors, (305), 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-01-18 02:10:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:10:16,693 INFO L93 Difference]: Finished difference Result 32580 states and 118215 transitions. [2022-01-18 02:10:16,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-01-18 02:10:16,693 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.630952380952381) internal successors, (305), 84 states have internal predecessors, (305), 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 124 [2022-01-18 02:10:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:10:16,791 INFO L225 Difference]: With dead ends: 32580 [2022-01-18 02:10:16,791 INFO L226 Difference]: Without dead ends: 32430 [2022-01-18 02:10:16,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 136 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 5413 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1476, Invalid=15316, Unknown=10, NotChecked=2104, Total=18906 [2022-01-18 02:10:16,794 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 1804 mSDsluCounter, 9411 mSDsCounter, 0 mSdLazyCounter, 4238 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 9093 SdHoareTripleChecker+Invalid, 9249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 4238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4933 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 02:10:16,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1804 Valid, 9093 Invalid, 9249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 4238 Invalid, 0 Unknown, 4933 Unchecked, 1.8s Time] [2022-01-18 02:10:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32430 states. [2022-01-18 02:10:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32430 to 13886. [2022-01-18 02:10:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13886 states, 13885 states have (on average 3.6503420957868205) internal successors, (50685), 13885 states have internal predecessors, (50685), 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-01-18 02:10:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13886 states to 13886 states and 50685 transitions. [2022-01-18 02:10:17,206 INFO L78 Accepts]: Start accepts. Automaton has 13886 states and 50685 transitions. Word has length 124 [2022-01-18 02:10:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:10:17,206 INFO L470 AbstractCegarLoop]: Abstraction has 13886 states and 50685 transitions. [2022-01-18 02:10:17,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.630952380952381) internal successors, (305), 84 states have internal predecessors, (305), 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-01-18 02:10:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 13886 states and 50685 transitions. [2022-01-18 02:10:17,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:10:17,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:10:17,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 02:10:17,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-18 02:10:17,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:10:17,432 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:10:17,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:10:17,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1457504890, now seen corresponding path program 8 times [2022-01-18 02:10:17,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:10:17,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521739153] [2022-01-18 02:10:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:10:17,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:10:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:10:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:10:18,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:10:18,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521739153] [2022-01-18 02:10:18,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521739153] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:10:18,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522734235] [2022-01-18 02:10:18,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:10:18,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:10:18,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:10:18,425 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:10:18,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-18 02:10:18,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:10:18,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:10:18,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-18 02:10:18,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:10:18,593 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-01-18 02:10:18,629 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 02:10:18,629 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-01-18 02:10:18,863 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 02:10:18,863 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-01-18 02:10:19,450 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 18 treesize of output 20 [2022-01-18 02:10:19,528 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 18 treesize of output 20 [2022-01-18 02:10:19,672 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:10:19,672 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 27 treesize of output 27 [2022-01-18 02:10:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:10:20,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:10:20,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_730 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)))) is different from false [2022-01-18 02:10:20,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)))) is different from false [2022-01-18 02:10:20,755 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:10:20,755 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 116 treesize of output 92 [2022-01-18 02:10:20,758 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 76 treesize of output 64 [2022-01-18 02:10:20,761 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 34 treesize of output 28 [2022-01-18 02:10:21,782 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-01-18 02:10:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:10:21,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522734235] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:10:21,804 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:10:21,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-01-18 02:10:21,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691483977] [2022-01-18 02:10:21,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:10:21,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-01-18 02:10:21,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:10:21,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-01-18 02:10:21,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=4257, Unknown=2, NotChecked=270, Total=4970 [2022-01-18 02:10:21,806 INFO L87 Difference]: Start difference. First operand 13886 states and 50685 transitions. Second operand has 71 states, 71 states have (on average 4.408450704225352) internal successors, (313), 71 states have internal predecessors, (313), 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-01-18 02:10:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:10:40,910 INFO L93 Difference]: Finished difference Result 45671 states and 167359 transitions. [2022-01-18 02:10:40,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2022-01-18 02:10:40,911 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 4.408450704225352) internal successors, (313), 71 states have internal predecessors, (313), 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 124 [2022-01-18 02:10:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:10:41,064 INFO L225 Difference]: With dead ends: 45671 [2022-01-18 02:10:41,064 INFO L226 Difference]: Without dead ends: 45371 [2022-01-18 02:10:41,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 220 SyntacticMatches, 15 SemanticMatches, 275 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 28816 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=10241, Invalid=65115, Unknown=2, NotChecked=1094, Total=76452 [2022-01-18 02:10:41,070 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 2925 mSDsluCounter, 13205 mSDsCounter, 0 mSdLazyCounter, 5462 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2925 SdHoareTripleChecker+Valid, 12442 SdHoareTripleChecker+Invalid, 16342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 5462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10722 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-18 02:10:41,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2925 Valid, 12442 Invalid, 16342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 5462 Invalid, 0 Unknown, 10722 Unchecked, 2.7s Time] [2022-01-18 02:10:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45371 states. [2022-01-18 02:10:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45371 to 14264. [2022-01-18 02:10:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14264 states, 14263 states have (on average 3.6511252892098436) internal successors, (52076), 14263 states have internal predecessors, (52076), 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-01-18 02:10:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14264 states to 14264 states and 52076 transitions. [2022-01-18 02:10:41,586 INFO L78 Accepts]: Start accepts. Automaton has 14264 states and 52076 transitions. Word has length 124 [2022-01-18 02:10:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:10:41,586 INFO L470 AbstractCegarLoop]: Abstraction has 14264 states and 52076 transitions. [2022-01-18 02:10:41,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 4.408450704225352) internal successors, (313), 71 states have internal predecessors, (313), 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-01-18 02:10:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 14264 states and 52076 transitions. [2022-01-18 02:10:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:10:41,612 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:10:41,612 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] [2022-01-18 02:10:41,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-18 02:10:41,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:10:41,812 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:10:41,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:10:41,813 INFO L85 PathProgramCache]: Analyzing trace with hash -89866212, now seen corresponding path program 9 times [2022-01-18 02:10:41,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:10:41,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654732757] [2022-01-18 02:10:41,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:10:41,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:10:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:10:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:10:42,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:10:42,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654732757] [2022-01-18 02:10:42,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654732757] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:10:42,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057513078] [2022-01-18 02:10:42,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:10:42,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:10:42,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:10:42,737 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:10:42,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-18 02:10:42,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 02:10:42,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:10:42,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-18 02:10:42,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:10:42,918 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-01-18 02:10:42,958 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 02:10:42,958 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-01-18 02:10:43,235 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 02:10:43,235 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-01-18 02:10:43,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-18 02:10:43,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:10:43,903 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 18 treesize of output 20 [2022-01-18 02:10:43,979 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 18 treesize of output 20 [2022-01-18 02:10:44,122 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:10:44,123 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 27 treesize of output 27 [2022-01-18 02:10:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:10:44,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:10:44,958 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 02:10:45,021 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 02:10:45,075 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-01-18 02:10:45,089 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-01-18 02:10:45,102 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (< 0 ~M~0))) is different from false [2022-01-18 02:10:45,126 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))))) is different from false [2022-01-18 02:10:45,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) is different from false [2022-01-18 02:10:45,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) is different from false [2022-01-18 02:10:45,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) |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|))))))) is different from false [2022-01-18 02:10:45,345 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:10:45,346 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 55 treesize of output 44 [2022-01-18 02:10:45,355 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-18 02:10:45,355 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 1670 treesize of output 1482 [2022-01-18 02:10:45,366 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 1478 treesize of output 1382 [2022-01-18 02:10:45,373 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 1382 treesize of output 1190 [2022-01-18 02:10:45,388 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-18 02:10:45,388 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 1190 treesize of output 1082 [2022-01-18 02:10:49,280 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-01-18 02:10:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-18 02:10:49,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057513078] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:10:49,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:10:49,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 28] total 75 [2022-01-18 02:10:49,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845476045] [2022-01-18 02:10:49,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:10:49,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-01-18 02:10:49,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:10:49,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-01-18 02:10:49,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3909, Unknown=9, NotChecked=1224, Total=5550 [2022-01-18 02:10:49,303 INFO L87 Difference]: Start difference. First operand 14264 states and 52076 transitions. Second operand has 75 states, 75 states have (on average 4.16) internal successors, (312), 75 states have internal predecessors, (312), 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-01-18 02:11:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:11:09,040 INFO L93 Difference]: Finished difference Result 40970 states and 149500 transitions. [2022-01-18 02:11:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-01-18 02:11:09,040 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 4.16) internal successors, (312), 75 states have internal predecessors, (312), 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 124 [2022-01-18 02:11:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:11:09,156 INFO L225 Difference]: With dead ends: 40970 [2022-01-18 02:11:09,156 INFO L226 Difference]: Without dead ends: 40670 [2022-01-18 02:11:09,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 228 SyntacticMatches, 15 SemanticMatches, 259 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 23295 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=7904, Invalid=55375, Unknown=9, NotChecked=4572, Total=67860 [2022-01-18 02:11:09,161 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 3010 mSDsluCounter, 11920 mSDsCounter, 0 mSdLazyCounter, 5288 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3010 SdHoareTripleChecker+Valid, 11358 SdHoareTripleChecker+Invalid, 19772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 5288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14362 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-18 02:11:09,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3010 Valid, 11358 Invalid, 19772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 5288 Invalid, 0 Unknown, 14362 Unchecked, 2.7s Time] [2022-01-18 02:11:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40670 states. [2022-01-18 02:11:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40670 to 14094. [2022-01-18 02:11:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14094 states, 14093 states have (on average 3.6449301071453912) internal successors, (51368), 14093 states have internal predecessors, (51368), 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-01-18 02:11:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14094 states to 14094 states and 51368 transitions. [2022-01-18 02:11:09,667 INFO L78 Accepts]: Start accepts. Automaton has 14094 states and 51368 transitions. Word has length 124 [2022-01-18 02:11:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:11:09,667 INFO L470 AbstractCegarLoop]: Abstraction has 14094 states and 51368 transitions. [2022-01-18 02:11:09,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.16) internal successors, (312), 75 states have internal predecessors, (312), 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-01-18 02:11:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 14094 states and 51368 transitions. [2022-01-18 02:11:09,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:11:09,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:11:09,695 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] [2022-01-18 02:11:09,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-18 02:11:09,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-01-18 02:11:09,896 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:11:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:11:09,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1002033640, now seen corresponding path program 10 times [2022-01-18 02:11:09,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:11:09,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235002835] [2022-01-18 02:11:09,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:11:09,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:11:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:11:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:11:10,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:11:10,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235002835] [2022-01-18 02:11:10,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235002835] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:11:10,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248705986] [2022-01-18 02:11:10,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 02:11:10,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:11:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:11:10,672 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:11:10,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-18 02:11:10,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 02:11:10,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:11:10,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-18 02:11:10,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:11:11,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 02:11:11,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:11:12,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:11:12,228 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 18 treesize of output 20 [2022-01-18 02:11:12,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:11:12,328 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 18 treesize of output 20 [2022-01-18 02:11:12,491 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:11:12,492 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 27 treesize of output 27 [2022-01-18 02:11:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:11:12,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:11:13,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:11:13,206 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:11:13,257 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:11:13,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:11:13,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:11:13,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:11:13,455 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) is different from false [2022-01-18 02:11:13,469 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) |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_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:11:13,722 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:11:13,723 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 55 treesize of output 44 [2022-01-18 02:11:13,734 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:11:13,734 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 830 treesize of output 746 [2022-01-18 02:11:13,742 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 734 treesize of output 686 [2022-01-18 02:11:13,748 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 686 treesize of output 590 [2022-01-18 02:11:13,762 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:11:13,762 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 590 treesize of output 546 [2022-01-18 02:11:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 02:11:26,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248705986] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:11:26,482 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:11:26,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 85 [2022-01-18 02:11:26,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284554947] [2022-01-18 02:11:26,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:11:26,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-01-18 02:11:26,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:11:26,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-01-18 02:11:26,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=5341, Unknown=11, NotChecked=1256, Total=7140 [2022-01-18 02:11:26,484 INFO L87 Difference]: Start difference. First operand 14094 states and 51368 transitions. Second operand has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 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-01-18 02:11:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:11:40,324 INFO L93 Difference]: Finished difference Result 29759 states and 107876 transitions. [2022-01-18 02:11:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-18 02:11:40,325 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 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 124 [2022-01-18 02:11:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:11:40,409 INFO L225 Difference]: With dead ends: 29759 [2022-01-18 02:11:40,410 INFO L226 Difference]: Without dead ends: 29609 [2022-01-18 02:11:40,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 199 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 4914 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=1504, Invalid=13769, Unknown=11, NotChecked=2008, Total=17292 [2022-01-18 02:11:40,411 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 1932 mSDsluCounter, 9243 mSDsCounter, 0 mSdLazyCounter, 3695 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1932 SdHoareTripleChecker+Valid, 8922 SdHoareTripleChecker+Invalid, 9166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5402 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-18 02:11:40,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1932 Valid, 8922 Invalid, 9166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3695 Invalid, 0 Unknown, 5402 Unchecked, 1.6s Time] [2022-01-18 02:11:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2022-01-18 02:11:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 14606. [2022-01-18 02:11:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14606 states, 14605 states have (on average 3.6661417322834646) internal successors, (53544), 14605 states have internal predecessors, (53544), 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-01-18 02:11:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14606 states to 14606 states and 53544 transitions. [2022-01-18 02:11:40,809 INFO L78 Accepts]: Start accepts. Automaton has 14606 states and 53544 transitions. Word has length 124 [2022-01-18 02:11:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:11:40,810 INFO L470 AbstractCegarLoop]: Abstraction has 14606 states and 53544 transitions. [2022-01-18 02:11:40,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 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-01-18 02:11:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 14606 states and 53544 transitions. [2022-01-18 02:11:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:11:40,840 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:11:40,840 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] [2022-01-18 02:11:40,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-01-18 02:11:41,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-18 02:11:41,040 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:11:41,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:11:41,041 INFO L85 PathProgramCache]: Analyzing trace with hash 727737786, now seen corresponding path program 11 times [2022-01-18 02:11:41,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:11:41,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419346682] [2022-01-18 02:11:41,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:11:41,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:11:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:11:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:11:41,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:11:41,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419346682] [2022-01-18 02:11:41,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419346682] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:11:41,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356258977] [2022-01-18 02:11:41,835 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:11:41,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:11:41,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:11:41,836 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:11:41,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-18 02:11:41,937 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:11:41,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:11:41,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 84 conjunts are in the unsatisfiable core [2022-01-18 02:11:41,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:11:42,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 02:11:43,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:11:43,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:11:43,473 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 18 treesize of output 20 [2022-01-18 02:11:43,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:11:43,598 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 18 treesize of output 20 [2022-01-18 02:11:43,779 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:11:43,780 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 21 treesize of output 21 [2022-01-18 02:11:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:11:44,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:11:44,559 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 02:11:44,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 02:11:44,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-01-18 02:11:44,696 WARN L838 $PredicateComparison]: unable to prove that (or (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))))) is different from false [2022-01-18 02:11:44,712 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) (not (< 0 c_~N~0))) is different from false [2022-01-18 02:11:44,742 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))))))) is different from false [2022-01-18 02:11:44,886 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))))))) is different from false [2022-01-18 02:11:44,918 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0)))))) is different from false [2022-01-18 02:11:44,935 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) |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|))))) (not (< ~M~0 c_~N~0)))) (not (< 0 c_~N~0))) is different from false [2022-01-18 02:11:45,212 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:11:45,213 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 55 treesize of output 44 [2022-01-18 02:11:45,226 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:11:45,226 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 1670 treesize of output 1490 [2022-01-18 02:11:45,234 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 1478 treesize of output 1382 [2022-01-18 02:11:45,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 1382 treesize of output 1190 [2022-01-18 02:11:45,254 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:11:45,255 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 1190 treesize of output 1090 [2022-01-18 02:11:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 02:11:46,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356258977] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:11:46,879 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:11:46,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 84 [2022-01-18 02:11:46,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713155529] [2022-01-18 02:11:46,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:11:46,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-01-18 02:11:46,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:11:46,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-01-18 02:11:46,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=5056, Unknown=10, NotChecked=1386, Total=6972 [2022-01-18 02:11:46,881 INFO L87 Difference]: Start difference. First operand 14606 states and 53544 transitions. Second operand has 84 states, 84 states have (on average 3.5952380952380953) internal successors, (302), 84 states have internal predecessors, (302), 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-01-18 02:11:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:11:55,209 INFO L93 Difference]: Finished difference Result 34843 states and 126620 transitions. [2022-01-18 02:11:55,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-01-18 02:11:55,209 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.5952380952380953) internal successors, (302), 84 states have internal predecessors, (302), 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 124 [2022-01-18 02:11:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:11:55,304 INFO L225 Difference]: With dead ends: 34843 [2022-01-18 02:11:55,304 INFO L226 Difference]: Without dead ends: 34693 [2022-01-18 02:11:55,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 197 SyntacticMatches, 6 SemanticMatches, 136 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 5324 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1575, Invalid=14963, Unknown=10, NotChecked=2358, Total=18906 [2022-01-18 02:11:55,305 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 1979 mSDsluCounter, 8269 mSDsCounter, 0 mSdLazyCounter, 4307 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1979 SdHoareTripleChecker+Valid, 7930 SdHoareTripleChecker+Invalid, 8037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 4307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3598 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-18 02:11:55,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1979 Valid, 7930 Invalid, 8037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 4307 Invalid, 0 Unknown, 3598 Unchecked, 1.9s Time] [2022-01-18 02:11:55,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34693 states. [2022-01-18 02:11:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34693 to 14314. [2022-01-18 02:11:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14314 states, 14313 states have (on average 3.6482218961782995) internal successors, (52217), 14313 states have internal predecessors, (52217), 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-01-18 02:11:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 52217 transitions. [2022-01-18 02:11:55,699 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 52217 transitions. Word has length 124 [2022-01-18 02:11:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:11:55,700 INFO L470 AbstractCegarLoop]: Abstraction has 14314 states and 52217 transitions. [2022-01-18 02:11:55,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.5952380952380953) internal successors, (302), 84 states have internal predecessors, (302), 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-01-18 02:11:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 52217 transitions. [2022-01-18 02:11:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:11:55,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:11:55,727 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] [2022-01-18 02:11:55,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-01-18 02:11:55,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-18 02:11:55,927 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:11:55,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:11:55,928 INFO L85 PathProgramCache]: Analyzing trace with hash 929729368, now seen corresponding path program 12 times [2022-01-18 02:11:55,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:11:55,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314788632] [2022-01-18 02:11:55,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:11:55,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:11:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:11:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:11:56,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:11:56,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314788632] [2022-01-18 02:11:56,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314788632] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:11:56,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661965659] [2022-01-18 02:11:56,712 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:11:56,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:11:56,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:11:56,713 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:11:56,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-01-18 02:11:56,811 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-01-18 02:11:56,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:11:56,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-01-18 02:11:56,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:11:56,853 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-01-18 02:11:56,887 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 02:11:56,887 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-01-18 02:11:57,088 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 02:11:57,088 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-01-18 02:11:57,623 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 18 treesize of output 20 [2022-01-18 02:11:57,697 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 18 treesize of output 20 [2022-01-18 02:11:57,887 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:11:57,887 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 27 treesize of output 27 [2022-01-18 02:11:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:11:58,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:11:58,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_71| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_71|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_71|) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_71| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 02:11:58,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_879 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_71| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_71|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_71|) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_71| 4))))))) is different from false [2022-01-18 02:11:58,612 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:11:58,612 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 242 treesize of output 178 [2022-01-18 02:11:58,616 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 162 treesize of output 150 [2022-01-18 02:11:58,619 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 150 treesize of output 126 [2022-01-18 02:11:59,573 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-01-18 02:11:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:11:59,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661965659] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:11:59,596 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:11:59,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 68 [2022-01-18 02:11:59,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974617009] [2022-01-18 02:11:59,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:11:59,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-18 02:11:59,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:11:59,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-18 02:11:59,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=3889, Unknown=2, NotChecked=258, Total=4556 [2022-01-18 02:11:59,598 INFO L87 Difference]: Start difference. First operand 14314 states and 52217 transitions. Second operand has 68 states, 68 states have (on average 4.5) internal successors, (306), 68 states have internal predecessors, (306), 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-01-18 02:12:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:12:09,140 INFO L93 Difference]: Finished difference Result 34356 states and 125418 transitions. [2022-01-18 02:12:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-01-18 02:12:09,140 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 4.5) internal successors, (306), 68 states have internal predecessors, (306), 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 124 [2022-01-18 02:12:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:12:09,238 INFO L225 Difference]: With dead ends: 34356 [2022-01-18 02:12:09,238 INFO L226 Difference]: Without dead ends: 34347 [2022-01-18 02:12:09,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 221 SyntacticMatches, 12 SemanticMatches, 159 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 7929 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=3779, Invalid=21349, Unknown=2, NotChecked=630, Total=25760 [2022-01-18 02:12:09,240 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 2572 mSDsluCounter, 9887 mSDsCounter, 0 mSdLazyCounter, 4111 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2572 SdHoareTripleChecker+Valid, 9666 SdHoareTripleChecker+Invalid, 8060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3890 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:12:09,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2572 Valid, 9666 Invalid, 8060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4111 Invalid, 0 Unknown, 3890 Unchecked, 2.0s Time] [2022-01-18 02:12:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34347 states. [2022-01-18 02:12:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34347 to 15582. [2022-01-18 02:12:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15582 states, 15581 states have (on average 3.662345163981773) internal successors, (57063), 15581 states have internal predecessors, (57063), 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-01-18 02:12:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15582 states to 15582 states and 57063 transitions. [2022-01-18 02:12:09,666 INFO L78 Accepts]: Start accepts. Automaton has 15582 states and 57063 transitions. Word has length 124 [2022-01-18 02:12:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:12:09,666 INFO L470 AbstractCegarLoop]: Abstraction has 15582 states and 57063 transitions. [2022-01-18 02:12:09,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 4.5) internal successors, (306), 68 states have internal predecessors, (306), 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-01-18 02:12:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 15582 states and 57063 transitions. [2022-01-18 02:12:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:12:09,694 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:12:09,694 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] [2022-01-18 02:12:09,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-01-18 02:12:09,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:12:09,895 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:12:09,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:12:09,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1843297594, now seen corresponding path program 13 times [2022-01-18 02:12:09,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:12:09,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621790299] [2022-01-18 02:12:09,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:12:09,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:12:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:12:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:12:10,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:12:10,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621790299] [2022-01-18 02:12:10,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621790299] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:12:10,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974048108] [2022-01-18 02:12:10,690 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 02:12:10,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:12:10,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:12:10,691 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:12:10,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-01-18 02:12:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:12:10,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 84 conjunts are in the unsatisfiable core [2022-01-18 02:12:10,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:12:10,858 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-01-18 02:12:10,897 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 02:12:10,898 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-01-18 02:12:11,270 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 02:12:11,270 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-01-18 02:12:11,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-18 02:12:12,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:12:12,244 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 18 treesize of output 20 [2022-01-18 02:12:12,340 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 18 treesize of output 20 [2022-01-18 02:12:12,538 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:12:12,539 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 27 treesize of output 27 [2022-01-18 02:12:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:12:12,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:12:13,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-01-18 02:12:13,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 02:12:13,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-01-18 02:12:13,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 02:12:13,394 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_916))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 02:12:13,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_916))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))))) is different from false [2022-01-18 02:12:13,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_916))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 02:12:13,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_916))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) |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_~res2~0))))) is different from false [2022-01-18 02:12:13,817 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:12:13,818 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 55 treesize of output 44 [2022-01-18 02:12:13,827 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:12:13,827 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 3350 treesize of output 2978 [2022-01-18 02:12:13,838 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 2966 treesize of output 2774 [2022-01-18 02:12:13,849 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 2774 treesize of output 2390 [2022-01-18 02:12:13,865 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:12:13,866 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 2390 treesize of output 2178 [2022-01-18 02:12:42,484 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-01-18 02:12:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 02:12:42,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974048108] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:12:42,507 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:12:42,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 81 [2022-01-18 02:12:42,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451026528] [2022-01-18 02:12:42,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:12:42,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-01-18 02:12:42,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:12:42,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-01-18 02:12:42,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=4785, Unknown=11, NotChecked=1192, Total=6480 [2022-01-18 02:12:42,509 INFO L87 Difference]: Start difference. First operand 15582 states and 57063 transitions. Second operand has 81 states, 81 states have (on average 3.7777777777777777) internal successors, (306), 81 states have internal predecessors, (306), 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-01-18 02:12:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:12:47,947 INFO L93 Difference]: Finished difference Result 32775 states and 118600 transitions. [2022-01-18 02:12:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-18 02:12:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.7777777777777777) internal successors, (306), 81 states have internal predecessors, (306), 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 124 [2022-01-18 02:12:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:12:48,035 INFO L225 Difference]: With dead ends: 32775 [2022-01-18 02:12:48,035 INFO L226 Difference]: Without dead ends: 32475 [2022-01-18 02:12:48,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 205 SyntacticMatches, 8 SemanticMatches, 127 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 4676 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1459, Invalid=13082, Unknown=11, NotChecked=1960, Total=16512 [2022-01-18 02:12:48,037 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 1584 mSDsluCounter, 9207 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 8871 SdHoareTripleChecker+Invalid, 9180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6201 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 02:12:48,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1584 Valid, 8871 Invalid, 9180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2936 Invalid, 0 Unknown, 6201 Unchecked, 1.3s Time] [2022-01-18 02:12:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32475 states. [2022-01-18 02:12:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32475 to 15001. [2022-01-18 02:12:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15001 states, 15000 states have (on average 3.6474) internal successors, (54711), 15000 states have internal predecessors, (54711), 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-01-18 02:12:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15001 states to 15001 states and 54711 transitions. [2022-01-18 02:12:48,426 INFO L78 Accepts]: Start accepts. Automaton has 15001 states and 54711 transitions. Word has length 124 [2022-01-18 02:12:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:12:48,426 INFO L470 AbstractCegarLoop]: Abstraction has 15001 states and 54711 transitions. [2022-01-18 02:12:48,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.7777777777777777) internal successors, (306), 81 states have internal predecessors, (306), 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-01-18 02:12:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 15001 states and 54711 transitions. [2022-01-18 02:12:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:12:48,452 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:12:48,452 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] [2022-01-18 02:12:48,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-01-18 02:12:48,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-18 02:12:48,652 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:12:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:12:48,653 INFO L85 PathProgramCache]: Analyzing trace with hash -673379146, now seen corresponding path program 14 times [2022-01-18 02:12:48,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:12:48,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003518295] [2022-01-18 02:12:48,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:12:48,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:12:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:12:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:12:49,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:12:49,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003518295] [2022-01-18 02:12:49,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003518295] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:12:49,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724869013] [2022-01-18 02:12:49,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:12:49,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:12:49,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:12:49,416 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:12:49,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-01-18 02:12:49,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:12:49,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:12:49,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 71 conjunts are in the unsatisfiable core [2022-01-18 02:12:49,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:12:49,605 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-01-18 02:12:49,866 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:12:49,866 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 11 treesize of output 11 [2022-01-18 02:12:50,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:12:50,365 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 18 treesize of output 20 [2022-01-18 02:12:50,444 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 18 treesize of output 20 [2022-01-18 02:12:50,648 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:12:50,648 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 27 treesize of output 27 [2022-01-18 02:12:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:12:50,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:12:51,310 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_77| Int)) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_77|) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_953) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_77| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_77|) c_~N~0))) is different from false [2022-01-18 02:12:51,369 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_952 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_77| Int)) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_77|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_953) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_77| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_77|) c_~N~0))) is different from false [2022-01-18 02:12:51,419 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:12:51,419 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 116 treesize of output 92 [2022-01-18 02:12:51,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2022-01-18 02:12:51,425 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 34 treesize of output 28 [2022-01-18 02:12:52,505 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-01-18 02:12:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:12:52,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724869013] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:12:52,566 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:12:52,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 67 [2022-01-18 02:12:52,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894960187] [2022-01-18 02:12:52,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:12:52,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-01-18 02:12:52,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:12:52,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-01-18 02:12:52,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=3772, Unknown=2, NotChecked=254, Total=4422 [2022-01-18 02:12:52,568 INFO L87 Difference]: Start difference. First operand 15001 states and 54711 transitions. Second operand has 67 states, 67 states have (on average 4.552238805970149) internal successors, (305), 67 states have internal predecessors, (305), 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-01-18 02:13:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:03,536 INFO L93 Difference]: Finished difference Result 33145 states and 121092 transitions. [2022-01-18 02:13:03,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-01-18 02:13:03,537 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 4.552238805970149) internal successors, (305), 67 states have internal predecessors, (305), 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 124 [2022-01-18 02:13:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:03,638 INFO L225 Difference]: With dead ends: 33145 [2022-01-18 02:13:03,638 INFO L226 Difference]: Without dead ends: 33130 [2022-01-18 02:13:03,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 213 SyntacticMatches, 16 SemanticMatches, 156 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 7416 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=3518, Invalid=20668, Unknown=2, NotChecked=618, Total=24806 [2022-01-18 02:13:03,640 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 2313 mSDsluCounter, 11725 mSDsCounter, 0 mSdLazyCounter, 5658 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2313 SdHoareTripleChecker+Valid, 11362 SdHoareTripleChecker+Invalid, 8825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 5658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3117 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-18 02:13:03,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2313 Valid, 11362 Invalid, 8825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 5658 Invalid, 0 Unknown, 3117 Unchecked, 2.6s Time] [2022-01-18 02:13:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33130 states. [2022-01-18 02:13:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33130 to 14998. [2022-01-18 02:13:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14998 states, 14997 states have (on average 3.6475961859038475) internal successors, (54703), 14997 states have internal predecessors, (54703), 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-01-18 02:13:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14998 states to 14998 states and 54703 transitions. [2022-01-18 02:13:04,075 INFO L78 Accepts]: Start accepts. Automaton has 14998 states and 54703 transitions. Word has length 124 [2022-01-18 02:13:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:04,076 INFO L470 AbstractCegarLoop]: Abstraction has 14998 states and 54703 transitions. [2022-01-18 02:13:04,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.552238805970149) internal successors, (305), 67 states have internal predecessors, (305), 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-01-18 02:13:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 14998 states and 54703 transitions. [2022-01-18 02:13:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:13:04,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:04,103 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] [2022-01-18 02:13:04,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-01-18 02:13:04,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:13:04,304 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:13:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:04,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1592604130, now seen corresponding path program 15 times [2022-01-18 02:13:04,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:04,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638467269] [2022-01-18 02:13:04,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:04,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:13:05,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:05,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638467269] [2022-01-18 02:13:05,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638467269] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:13:05,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576469815] [2022-01-18 02:13:05,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:13:05,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:13:05,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:13:05,075 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:13:05,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-01-18 02:13:05,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 02:13:05,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:13:05,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 79 conjunts are in the unsatisfiable core [2022-01-18 02:13:05,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:13:05,282 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-01-18 02:13:05,539 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:13:05,539 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 11 treesize of output 11 [2022-01-18 02:13:05,712 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-01-18 02:13:06,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:13:06,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:13:06,291 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 18 treesize of output 20 [2022-01-18 02:13:06,384 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 18 treesize of output 20 [2022-01-18 02:13:06,628 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:13:06,629 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 21 treesize of output 21 [2022-01-18 02:13:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:13:06,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:13:07,287 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-01-18 02:13:07,359 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 02:13:07,411 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-01-18 02:13:07,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-01-18 02:13:07,438 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4))))))) is different from false [2022-01-18 02:13:07,461 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_989))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))))))) is different from false [2022-01-18 02:13:07,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_989))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))))) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-01-18 02:13:07,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_989))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-01-18 02:13:07,606 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_989))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-01-18 02:13:07,667 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:13:07,667 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 55 treesize of output 44 [2022-01-18 02:13:07,675 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-18 02:13:07,675 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 1670 treesize of output 1482 [2022-01-18 02:13:07,685 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 1478 treesize of output 1286 [2022-01-18 02:13:07,695 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-18 02:13:07,695 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 1286 treesize of output 1178 [2022-01-18 02:13:07,704 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 1174 treesize of output 1078 [2022-01-18 02:14:21,401 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-01-18 02:14:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-18 02:14:21,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576469815] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:21,460 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:21,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 28] total 73 [2022-01-18 02:14:21,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101087814] [2022-01-18 02:14:21,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:21,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-01-18 02:14:21,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:21,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-01-18 02:14:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=3647, Unknown=9, NotChecked=1188, Total=5256 [2022-01-18 02:14:21,461 INFO L87 Difference]: Start difference. First operand 14998 states and 54703 transitions. Second operand has 73 states, 73 states have (on average 4.205479452054795) internal successors, (307), 73 states have internal predecessors, (307), 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-01-18 02:14:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:31,079 INFO L93 Difference]: Finished difference Result 48904 states and 177911 transitions. [2022-01-18 02:14:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-01-18 02:14:31,080 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 4.205479452054795) internal successors, (307), 73 states have internal predecessors, (307), 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 124 [2022-01-18 02:14:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:31,229 INFO L225 Difference]: With dead ends: 48904 [2022-01-18 02:14:31,229 INFO L226 Difference]: Without dead ends: 48754 [2022-01-18 02:14:31,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 211 SyntacticMatches, 8 SemanticMatches, 186 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 12282 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=3025, Invalid=28864, Unknown=9, NotChecked=3258, Total=35156 [2022-01-18 02:14:31,234 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 2340 mSDsluCounter, 11278 mSDsCounter, 0 mSdLazyCounter, 7571 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2340 SdHoareTripleChecker+Valid, 10568 SdHoareTripleChecker+Invalid, 14567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 7571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6877 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:31,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2340 Valid, 10568 Invalid, 14567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 7571 Invalid, 0 Unknown, 6877 Unchecked, 3.5s Time] [2022-01-18 02:14:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48754 states. [2022-01-18 02:14:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48754 to 13945. [2022-01-18 02:14:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13945 states, 13944 states have (on average 3.6399885255306943) internal successors, (50756), 13944 states have internal predecessors, (50756), 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-01-18 02:14:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13945 states to 13945 states and 50756 transitions. [2022-01-18 02:14:31,795 INFO L78 Accepts]: Start accepts. Automaton has 13945 states and 50756 transitions. Word has length 124 [2022-01-18 02:14:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:31,795 INFO L470 AbstractCegarLoop]: Abstraction has 13945 states and 50756 transitions. [2022-01-18 02:14:31,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 4.205479452054795) internal successors, (307), 73 states have internal predecessors, (307), 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-01-18 02:14:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 13945 states and 50756 transitions. [2022-01-18 02:14:31,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:14:31,818 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:31,818 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] [2022-01-18 02:14:31,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-01-18 02:14:32,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-01-18 02:14:32,019 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:14:32,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:32,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1814647960, now seen corresponding path program 5 times [2022-01-18 02:14:32,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:32,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036498326] [2022-01-18 02:14:32,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:32,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:32,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:32,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036498326] [2022-01-18 02:14:32,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036498326] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:32,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905394470] [2022-01-18 02:14:32,317 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:14:32,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:32,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:32,320 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:14:32,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-01-18 02:14:32,441 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:14:32,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:14:32,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-18 02:14:32,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:32,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-18 02:14:33,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:14:33,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:14:33,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:14:33,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-18 02:14:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:14:33,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:33,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1028) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0 (* (- 1) c_~res2~0))) 0)) is different from false [2022-01-18 02:14:33,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1027 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1027) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1028) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0 (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) c_~res2~0))) 0)) is different from false [2022-01-18 02:14:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-18 02:14:33,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905394470] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:33,955 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:33,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 13] total 39 [2022-01-18 02:14:33,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202078369] [2022-01-18 02:14:33,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:33,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-18 02:14:33,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:33,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-18 02:14:33,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1161, Unknown=2, NotChecked=142, Total=1482 [2022-01-18 02:14:33,956 INFO L87 Difference]: Start difference. First operand 13945 states and 50756 transitions. Second operand has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 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-01-18 02:14:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:35,683 INFO L93 Difference]: Finished difference Result 25805 states and 94321 transitions. [2022-01-18 02:14:35,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-18 02:14:35,684 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 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 124 [2022-01-18 02:14:35,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:35,780 INFO L225 Difference]: With dead ends: 25805 [2022-01-18 02:14:35,780 INFO L226 Difference]: Without dead ends: 25655 [2022-01-18 02:14:35,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 227 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=576, Invalid=3590, Unknown=2, NotChecked=254, Total=4422 [2022-01-18 02:14:35,782 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 1124 mSDsluCounter, 4131 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 4095 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 554 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:35,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1124 Valid, 4095 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1677 Invalid, 0 Unknown, 554 Unchecked, 0.7s Time] [2022-01-18 02:14:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25655 states. [2022-01-18 02:14:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25655 to 14379. [2022-01-18 02:14:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14379 states, 14378 states have (on average 3.642857142857143) internal successors, (52377), 14378 states have internal predecessors, (52377), 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-01-18 02:14:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14379 states to 14379 states and 52377 transitions. [2022-01-18 02:14:36,232 INFO L78 Accepts]: Start accepts. Automaton has 14379 states and 52377 transitions. Word has length 124 [2022-01-18 02:14:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:36,232 INFO L470 AbstractCegarLoop]: Abstraction has 14379 states and 52377 transitions. [2022-01-18 02:14:36,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 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-01-18 02:14:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 14379 states and 52377 transitions. [2022-01-18 02:14:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:14:36,259 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:36,259 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] [2022-01-18 02:14:36,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-01-18 02:14:36,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:36,460 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:14:36,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1340158932, now seen corresponding path program 6 times [2022-01-18 02:14:36,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:36,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808043119] [2022-01-18 02:14:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:36,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:36,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:36,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808043119] [2022-01-18 02:14:36,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808043119] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:36,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698724967] [2022-01-18 02:14:36,737 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:14:36,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:36,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:36,740 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:14:36,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-01-18 02:14:36,877 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-01-18 02:14:36,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:14:36,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-18 02:14:36,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:37,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-18 02:14:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:37,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:37,489 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:37,489 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 27 treesize of output 28 [2022-01-18 02:14:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:37,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698724967] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:37,689 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:37,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 24 [2022-01-18 02:14:37,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625940781] [2022-01-18 02:14:37,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:37,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 02:14:37,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:37,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 02:14:37,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-01-18 02:14:37,690 INFO L87 Difference]: Start difference. First operand 14379 states and 52377 transitions. Second operand has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 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-01-18 02:14:38,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:38,708 INFO L93 Difference]: Finished difference Result 34527 states and 125047 transitions. [2022-01-18 02:14:38,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-18 02:14:38,708 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 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 124 [2022-01-18 02:14:38,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:38,809 INFO L225 Difference]: With dead ends: 34527 [2022-01-18 02:14:38,809 INFO L226 Difference]: Without dead ends: 34377 [2022-01-18 02:14:38,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=402, Invalid=2354, Unknown=0, NotChecked=0, Total=2756 [2022-01-18 02:14:38,810 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1095 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 3352 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:38,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1095 Valid, 3352 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 02:14:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34377 states. [2022-01-18 02:14:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34377 to 14583. [2022-01-18 02:14:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14583 states, 14582 states have (on average 3.643327389932794) internal successors, (53127), 14582 states have internal predecessors, (53127), 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-01-18 02:14:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14583 states to 14583 states and 53127 transitions. [2022-01-18 02:14:39,259 INFO L78 Accepts]: Start accepts. Automaton has 14583 states and 53127 transitions. Word has length 124 [2022-01-18 02:14:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:39,259 INFO L470 AbstractCegarLoop]: Abstraction has 14583 states and 53127 transitions. [2022-01-18 02:14:39,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 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-01-18 02:14:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 14583 states and 53127 transitions. [2022-01-18 02:14:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:14:39,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:39,288 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] [2022-01-18 02:14:39,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-01-18 02:14:39,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:39,489 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:14:39,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:39,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1904339992, now seen corresponding path program 7 times [2022-01-18 02:14:39,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:39,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219629480] [2022-01-18 02:14:39,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:39,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:39,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:39,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219629480] [2022-01-18 02:14:39,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219629480] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:39,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471127531] [2022-01-18 02:14:39,758 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 02:14:39,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:39,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:39,759 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:14:39,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-01-18 02:14:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:39,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-18 02:14:39,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:40,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-18 02:14:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:40,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:40,394 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:40,394 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 27 treesize of output 28 [2022-01-18 02:14:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:40,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471127531] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:40,592 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:40,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 11] total 26 [2022-01-18 02:14:40,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559270151] [2022-01-18 02:14:40,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:40,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-18 02:14:40,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:40,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-18 02:14:40,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-01-18 02:14:40,593 INFO L87 Difference]: Start difference. First operand 14583 states and 53127 transitions. Second operand has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 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-01-18 02:14:41,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:41,454 INFO L93 Difference]: Finished difference Result 30539 states and 110704 transitions. [2022-01-18 02:14:41,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-18 02:14:41,454 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 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 124 [2022-01-18 02:14:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:41,540 INFO L225 Difference]: With dead ends: 30539 [2022-01-18 02:14:41,540 INFO L226 Difference]: Without dead ends: 30389 [2022-01-18 02:14:41,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=349, Invalid=1907, Unknown=0, NotChecked=0, Total=2256 [2022-01-18 02:14:41,541 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 813 mSDsluCounter, 3306 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:41,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [813 Valid, 3378 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 02:14:41,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30389 states. [2022-01-18 02:14:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30389 to 14507. [2022-01-18 02:14:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14507 states, 14506 states have (on average 3.6431131945401902) internal successors, (52847), 14506 states have internal predecessors, (52847), 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-01-18 02:14:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14507 states to 14507 states and 52847 transitions. [2022-01-18 02:14:41,921 INFO L78 Accepts]: Start accepts. Automaton has 14507 states and 52847 transitions. Word has length 124 [2022-01-18 02:14:41,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:41,921 INFO L470 AbstractCegarLoop]: Abstraction has 14507 states and 52847 transitions. [2022-01-18 02:14:41,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 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-01-18 02:14:41,921 INFO L276 IsEmpty]: Start isEmpty. Operand 14507 states and 52847 transitions. [2022-01-18 02:14:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:14:41,947 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:41,947 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] [2022-01-18 02:14:41,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-01-18 02:14:42,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:42,148 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:14:42,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1045504418, now seen corresponding path program 8 times [2022-01-18 02:14:42,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:42,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446465484] [2022-01-18 02:14:42,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:42,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:42,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:42,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446465484] [2022-01-18 02:14:42,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446465484] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:42,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801945377] [2022-01-18 02:14:42,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:14:42,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:42,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:42,437 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:14:42,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-01-18 02:14:42,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:14:42,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:14:42,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-18 02:14:42,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:43,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-18 02:14:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:43,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:43,181 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:43,182 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 27 treesize of output 28 [2022-01-18 02:14:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:43,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801945377] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:43,385 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:43,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 24 [2022-01-18 02:14:43,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635757905] [2022-01-18 02:14:43,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:43,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 02:14:43,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:43,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 02:14:43,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-01-18 02:14:43,386 INFO L87 Difference]: Start difference. First operand 14507 states and 52847 transitions. Second operand has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 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-01-18 02:14:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:44,376 INFO L93 Difference]: Finished difference Result 37419 states and 135757 transitions. [2022-01-18 02:14:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-18 02:14:44,377 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 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 124 [2022-01-18 02:14:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:44,486 INFO L225 Difference]: With dead ends: 37419 [2022-01-18 02:14:44,486 INFO L226 Difference]: Without dead ends: 37269 [2022-01-18 02:14:44,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=2191, Unknown=0, NotChecked=0, Total=2550 [2022-01-18 02:14:44,487 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1294 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:44,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 3001 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 02:14:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37269 states. [2022-01-18 02:14:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37269 to 14589. [2022-01-18 02:14:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14589 states, 14588 states have (on average 3.6469015629284343) internal successors, (53201), 14588 states have internal predecessors, (53201), 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-01-18 02:14:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14589 states to 14589 states and 53201 transitions. [2022-01-18 02:14:45,044 INFO L78 Accepts]: Start accepts. Automaton has 14589 states and 53201 transitions. Word has length 124 [2022-01-18 02:14:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:45,045 INFO L470 AbstractCegarLoop]: Abstraction has 14589 states and 53201 transitions. [2022-01-18 02:14:45,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 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-01-18 02:14:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 14589 states and 53201 transitions. [2022-01-18 02:14:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:14:45,072 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:14:45,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-01-18 02:14:45,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-01-18 02:14:45,272 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:14:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash -708025836, now seen corresponding path program 9 times [2022-01-18 02:14:45,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:45,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411041464] [2022-01-18 02:14:45,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:45,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:45,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:45,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411041464] [2022-01-18 02:14:45,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411041464] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:45,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497319593] [2022-01-18 02:14:45,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:14:45,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:45,572 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:14:45,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-01-18 02:14:45,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 02:14:45,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:14:45,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-18 02:14:45,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:46,204 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-18 02:14:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:46,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:46,359 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:46,359 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 27 treesize of output 28 [2022-01-18 02:14:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:14:46,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497319593] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:46,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:46,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 25 [2022-01-18 02:14:46,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797730627] [2022-01-18 02:14:46,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:46,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-18 02:14:46,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:46,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-18 02:14:46,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-01-18 02:14:46,557 INFO L87 Difference]: Start difference. First operand 14589 states and 53201 transitions. Second operand has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 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-01-18 02:14:47,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:47,398 INFO L93 Difference]: Finished difference Result 29554 states and 107255 transitions. [2022-01-18 02:14:47,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 02:14:47,398 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 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 124 [2022-01-18 02:14:47,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:47,479 INFO L225 Difference]: With dead ends: 29554 [2022-01-18 02:14:47,479 INFO L226 Difference]: Without dead ends: 29404 [2022-01-18 02:14:47,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 239 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2022-01-18 02:14:47,479 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 839 mSDsluCounter, 2983 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:47,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [839 Valid, 3030 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 02:14:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29404 states. [2022-01-18 02:14:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29404 to 14601. [2022-01-18 02:14:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14600 states have (on average 3.6402739726027398) internal successors, (53148), 14600 states have internal predecessors, (53148), 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-01-18 02:14:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 53148 transitions. [2022-01-18 02:14:47,811 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 53148 transitions. Word has length 124 [2022-01-18 02:14:47,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:47,811 INFO L470 AbstractCegarLoop]: Abstraction has 14601 states and 53148 transitions. [2022-01-18 02:14:47,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 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-01-18 02:14:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 53148 transitions. [2022-01-18 02:14:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:14:47,835 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:47,835 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] [2022-01-18 02:14:47,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-01-18 02:14:48,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-01-18 02:14:48,035 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:14:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:48,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1308591088, now seen corresponding path program 16 times [2022-01-18 02:14:48,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:48,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175951700] [2022-01-18 02:14:48,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:48,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:14:48,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:48,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175951700] [2022-01-18 02:14:48,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175951700] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:48,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565399355] [2022-01-18 02:14:48,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 02:14:48,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:48,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:48,747 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:14:48,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-01-18 02:14:48,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 02:14:48,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:14:48,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-18 02:14:48,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:49,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 02:14:50,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:14:50,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:14:50,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:14:50,675 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:50,675 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 23 treesize of output 23 [2022-01-18 02:14:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:14:50,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:51,313 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-01-18 02:14:51,392 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) is different from false [2022-01-18 02:14:51,474 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 c_~A~0.offset)))))) is different from false [2022-01-18 02:14:51,505 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 c_~A~0.offset)) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 02:14:51,648 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) is different from false [2022-01-18 02:14:51,676 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 02:14:51,694 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0))))) is different from false [2022-01-18 02:14:51,958 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:51,958 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 61 treesize of output 50 [2022-01-18 02:14:51,966 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:51,967 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 194 treesize of output 194 [2022-01-18 02:14:51,976 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:51,976 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 182 treesize of output 162 [2022-01-18 02:14:51,986 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:51,986 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 150 treesize of output 146 [2022-01-18 02:14:51,998 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:51,998 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 70 treesize of output 75 [2022-01-18 02:14:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 02:14:53,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565399355] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:53,173 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:53,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 74 [2022-01-18 02:14:53,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552607025] [2022-01-18 02:14:53,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:53,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-01-18 02:14:53,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:53,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-01-18 02:14:53,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=569, Invalid=3872, Unknown=9, NotChecked=952, Total=5402 [2022-01-18 02:14:53,175 INFO L87 Difference]: Start difference. First operand 14601 states and 53148 transitions. Second operand has 74 states, 74 states have (on average 4.081081081081081) internal successors, (302), 74 states have internal predecessors, (302), 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-01-18 02:14:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:58,857 INFO L93 Difference]: Finished difference Result 32738 states and 118481 transitions. [2022-01-18 02:14:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-01-18 02:14:58,857 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 4.081081081081081) internal successors, (302), 74 states have internal predecessors, (302), 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 124 [2022-01-18 02:14:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:58,953 INFO L225 Difference]: With dead ends: 32738 [2022-01-18 02:14:58,953 INFO L226 Difference]: Without dead ends: 32138 [2022-01-18 02:14:58,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 211 SyntacticMatches, 11 SemanticMatches, 126 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 5131 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1838, Invalid=12701, Unknown=9, NotChecked=1708, Total=16256 [2022-01-18 02:14:58,954 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 2716 mSDsluCounter, 7567 mSDsCounter, 0 mSdLazyCounter, 3087 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2716 SdHoareTripleChecker+Valid, 7234 SdHoareTripleChecker+Invalid, 7415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4282 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:58,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2716 Valid, 7234 Invalid, 7415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3087 Invalid, 0 Unknown, 4282 Unchecked, 1.4s Time] [2022-01-18 02:14:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32138 states. [2022-01-18 02:14:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32138 to 15893. [2022-01-18 02:14:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15893 states, 15892 states have (on average 3.6546060911150264) internal successors, (58079), 15892 states have internal predecessors, (58079), 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-01-18 02:14:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15893 states to 15893 states and 58079 transitions. [2022-01-18 02:14:59,350 INFO L78 Accepts]: Start accepts. Automaton has 15893 states and 58079 transitions. Word has length 124 [2022-01-18 02:14:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:59,350 INFO L470 AbstractCegarLoop]: Abstraction has 15893 states and 58079 transitions. [2022-01-18 02:14:59,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 4.081081081081081) internal successors, (302), 74 states have internal predecessors, (302), 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-01-18 02:14:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 15893 states and 58079 transitions. [2022-01-18 02:14:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:14:59,379 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:59,379 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] [2022-01-18 02:14:59,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-01-18 02:14:59,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:59,579 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:14:59,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1704657420, now seen corresponding path program 17 times [2022-01-18 02:14:59,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:59,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340657554] [2022-01-18 02:14:59,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:59,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:15:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:15:00,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:15:00,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340657554] [2022-01-18 02:15:00,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340657554] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:15:00,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443951650] [2022-01-18 02:15:00,447 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:15:00,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:15:00,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:15:00,452 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:15:00,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-01-18 02:15:00,578 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:15:00,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:15:00,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-18 02:15:00,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:15:01,701 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:15:01,701 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 17 treesize of output 17 [2022-01-18 02:15:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:15:02,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:15:02,225 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:15:02,225 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 23 treesize of output 24 [2022-01-18 02:15:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:15:03,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443951650] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:15:03,177 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:15:03,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 22] total 61 [2022-01-18 02:15:03,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014129775] [2022-01-18 02:15:03,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:15:03,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-18 02:15:03,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:15:03,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-18 02:15:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=3228, Unknown=0, NotChecked=0, Total=3660 [2022-01-18 02:15:03,180 INFO L87 Difference]: Start difference. First operand 15893 states and 58079 transitions. Second operand has 61 states, 61 states have (on average 4.983606557377049) internal successors, (304), 61 states have internal predecessors, (304), 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-01-18 02:15:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:15:14,304 INFO L93 Difference]: Finished difference Result 51103 states and 187785 transitions. [2022-01-18 02:15:14,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-01-18 02:15:14,304 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.983606557377049) internal successors, (304), 61 states have internal predecessors, (304), 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 124 [2022-01-18 02:15:14,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:15:14,473 INFO L225 Difference]: With dead ends: 51103 [2022-01-18 02:15:14,473 INFO L226 Difference]: Without dead ends: 50803 [2022-01-18 02:15:14,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 210 SyntacticMatches, 9 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9608 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3107, Invalid=24283, Unknown=0, NotChecked=0, Total=27390 [2022-01-18 02:15:14,475 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 3205 mSDsluCounter, 11717 mSDsCounter, 0 mSdLazyCounter, 6954 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3205 SdHoareTripleChecker+Valid, 11021 SdHoareTripleChecker+Invalid, 9434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 6954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2336 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:15:14,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3205 Valid, 11021 Invalid, 9434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 6954 Invalid, 0 Unknown, 2336 Unchecked, 3.4s Time] [2022-01-18 02:15:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50803 states. [2022-01-18 02:15:14,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50803 to 14983. [2022-01-18 02:15:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14983 states, 14982 states have (on average 3.658590308370044) internal successors, (54813), 14982 states have internal predecessors, (54813), 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-01-18 02:15:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14983 states to 14983 states and 54813 transitions. [2022-01-18 02:15:15,057 INFO L78 Accepts]: Start accepts. Automaton has 14983 states and 54813 transitions. Word has length 124 [2022-01-18 02:15:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:15:15,058 INFO L470 AbstractCegarLoop]: Abstraction has 14983 states and 54813 transitions. [2022-01-18 02:15:15,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.983606557377049) internal successors, (304), 61 states have internal predecessors, (304), 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-01-18 02:15:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 14983 states and 54813 transitions. [2022-01-18 02:15:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:15:15,087 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:15:15,087 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] [2022-01-18 02:15:15,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-01-18 02:15:15,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-01-18 02:15:15,288 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:15:15,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:15:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1336949438, now seen corresponding path program 18 times [2022-01-18 02:15:15,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:15:15,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20625144] [2022-01-18 02:15:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:15:15,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:15:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:15:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:15:15,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:15:15,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20625144] [2022-01-18 02:15:15,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20625144] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:15:15,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372644149] [2022-01-18 02:15:15,954 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:15:15,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:15:15,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:15:15,955 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:15:15,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-01-18 02:15:16,095 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-01-18 02:15:16,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:15:16,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-18 02:15:16,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:15:16,579 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:15:16,579 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 27 treesize of output 27 [2022-01-18 02:15:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:15:16,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:15:17,345 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:15:17,345 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 23 treesize of output 24 [2022-01-18 02:15:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:15:17,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372644149] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:15:17,754 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:15:17,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-01-18 02:15:17,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634014026] [2022-01-18 02:15:17,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:15:17,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-18 02:15:17,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:15:17,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-18 02:15:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2193, Unknown=0, NotChecked=0, Total=2550 [2022-01-18 02:15:17,756 INFO L87 Difference]: Start difference. First operand 14983 states and 54813 transitions. Second operand has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 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-01-18 02:15:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:15:45,027 INFO L93 Difference]: Finished difference Result 90743 states and 331982 transitions. [2022-01-18 02:15:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 456 states. [2022-01-18 02:15:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 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 124 [2022-01-18 02:15:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:15:45,321 INFO L225 Difference]: With dead ends: 90743 [2022-01-18 02:15:45,322 INFO L226 Difference]: Without dead ends: 90443 [2022-01-18 02:15:45,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 255 SyntacticMatches, 20 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 108895 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=20436, Invalid=215274, Unknown=0, NotChecked=0, Total=235710 [2022-01-18 02:15:45,332 INFO L933 BasicCegarLoop]: 645 mSDtfsCounter, 3875 mSDsluCounter, 16372 mSDsCounter, 0 mSdLazyCounter, 10179 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3875 SdHoareTripleChecker+Valid, 14950 SdHoareTripleChecker+Invalid, 19637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 10179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9065 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:15:45,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3875 Valid, 14950 Invalid, 19637 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [393 Valid, 10179 Invalid, 0 Unknown, 9065 Unchecked, 5.0s Time] [2022-01-18 02:15:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90443 states. [2022-01-18 02:15:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90443 to 17855. [2022-01-18 02:15:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17855 states, 17854 states have (on average 3.694130166909376) internal successors, (65955), 17854 states have internal predecessors, (65955), 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-01-18 02:15:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17855 states to 17855 states and 65955 transitions. [2022-01-18 02:15:46,279 INFO L78 Accepts]: Start accepts. Automaton has 17855 states and 65955 transitions. Word has length 124 [2022-01-18 02:15:46,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:15:46,279 INFO L470 AbstractCegarLoop]: Abstraction has 17855 states and 65955 transitions. [2022-01-18 02:15:46,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 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-01-18 02:15:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 17855 states and 65955 transitions. [2022-01-18 02:15:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:15:46,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:15:46,312 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] [2022-01-18 02:15:46,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-01-18 02:15:46,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-01-18 02:15:46,512 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:15:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:15:46,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1679196940, now seen corresponding path program 19 times [2022-01-18 02:15:46,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:15:46,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649862506] [2022-01-18 02:15:46,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:15:46,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:15:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:15:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:15:47,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:15:47,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649862506] [2022-01-18 02:15:47,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649862506] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:15:47,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296801628] [2022-01-18 02:15:47,417 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 02:15:47,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:15:47,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:15:47,418 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:15:47,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-01-18 02:15:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:15:47,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-01-18 02:15:47,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:15:47,636 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-01-18 02:15:48,000 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:15:48,001 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 11 treesize of output 11 [2022-01-18 02:15:48,237 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-01-18 02:15:48,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:15:48,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:15:49,038 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-01-18 02:15:49,235 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:15:49,235 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 27 treesize of output 27 [2022-01-18 02:15:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:15:49,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:15:50,201 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-01-18 02:15:50,261 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) is different from false [2022-01-18 02:15:50,323 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 c_~A~0.offset) c_~res1~0))))) is different from false [2022-01-18 02:15:50,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 c_~A~0.offset)) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-01-18 02:15:50,452 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 02:15:50,476 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0))))) is different from false [2022-01-18 02:15:50,489 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))))) is different from false [2022-01-18 02:15:50,736 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:15:50,736 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 61 treesize of output 50 [2022-01-18 02:15:50,745 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:15:50,745 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 3254 treesize of output 3074 [2022-01-18 02:15:50,760 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:15:50,760 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 3062 treesize of output 2562 [2022-01-18 02:15:50,776 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:15:50,776 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 2550 treesize of output 2434 [2022-01-18 02:15:50,792 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:15:50,792 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 2422 treesize of output 2178 [2022-01-18 02:16:02,628 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-01-18 02:16:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 02:16:02,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296801628] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:16:02,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:16:02,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 31] total 79 [2022-01-18 02:16:02,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796851074] [2022-01-18 02:16:02,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:16:02,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-01-18 02:16:02,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:16:02,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-01-18 02:16:02,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=4629, Unknown=9, NotChecked=1022, Total=6162 [2022-01-18 02:16:02,655 INFO L87 Difference]: Start difference. First operand 17855 states and 65955 transitions. Second operand has 79 states, 79 states have (on average 4.012658227848101) internal successors, (317), 79 states have internal predecessors, (317), 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-01-18 02:16:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:16:21,667 INFO L93 Difference]: Finished difference Result 68810 states and 248981 transitions. [2022-01-18 02:16:21,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-01-18 02:16:21,668 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 4.012658227848101) internal successors, (317), 79 states have internal predecessors, (317), 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 124 [2022-01-18 02:16:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:16:21,895 INFO L225 Difference]: With dead ends: 68810 [2022-01-18 02:16:21,895 INFO L226 Difference]: Without dead ends: 67910 [2022-01-18 02:16:21,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 213 SyntacticMatches, 24 SemanticMatches, 249 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 25174 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=4694, Invalid=54617, Unknown=9, NotChecked=3430, Total=62750 [2022-01-18 02:16:21,898 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 4491 mSDsluCounter, 15312 mSDsCounter, 0 mSdLazyCounter, 9415 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4491 SdHoareTripleChecker+Valid, 14193 SdHoareTripleChecker+Invalid, 22086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 9415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12442 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-18 02:16:21,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4491 Valid, 14193 Invalid, 22086 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [229 Valid, 9415 Invalid, 0 Unknown, 12442 Unchecked, 4.7s Time] [2022-01-18 02:16:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67910 states. [2022-01-18 02:16:22,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67910 to 16397. [2022-01-18 02:16:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16397 states, 16396 states have (on average 3.6880336667479874) internal successors, (60469), 16396 states have internal predecessors, (60469), 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-01-18 02:16:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16397 states to 16397 states and 60469 transitions. [2022-01-18 02:16:22,651 INFO L78 Accepts]: Start accepts. Automaton has 16397 states and 60469 transitions. Word has length 124 [2022-01-18 02:16:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:16:22,651 INFO L470 AbstractCegarLoop]: Abstraction has 16397 states and 60469 transitions. [2022-01-18 02:16:22,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 4.012658227848101) internal successors, (317), 79 states have internal predecessors, (317), 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-01-18 02:16:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 16397 states and 60469 transitions. [2022-01-18 02:16:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:16:22,682 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:16:22,682 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] [2022-01-18 02:16:22,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-01-18 02:16:22,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-01-18 02:16:22,883 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:16:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:16:22,883 INFO L85 PathProgramCache]: Analyzing trace with hash 677970192, now seen corresponding path program 20 times [2022-01-18 02:16:22,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:16:22,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793361095] [2022-01-18 02:16:22,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:16:22,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:16:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:16:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:16:23,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:16:23,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793361095] [2022-01-18 02:16:23,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793361095] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:16:23,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987718491] [2022-01-18 02:16:23,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:16:23,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:16:23,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:16:23,488 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:16:23,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-01-18 02:16:23,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:16:23,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:16:23,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-18 02:16:23,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:16:24,080 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:16:24,080 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 27 treesize of output 27 [2022-01-18 02:16:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:16:24,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:16:24,788 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:16:24,789 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 23 treesize of output 24 [2022-01-18 02:16:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:16:25,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987718491] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:16:25,197 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:16:25,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-01-18 02:16:25,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415506628] [2022-01-18 02:16:25,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:16:25,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-18 02:16:25,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:16:25,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-18 02:16:25,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2283, Unknown=0, NotChecked=0, Total=2550 [2022-01-18 02:16:25,199 INFO L87 Difference]: Start difference. First operand 16397 states and 60469 transitions. Second operand has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 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-01-18 02:16:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:16:52,821 INFO L93 Difference]: Finished difference Result 116207 states and 425045 transitions. [2022-01-18 02:16:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 461 states. [2022-01-18 02:16:52,821 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 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 124 [2022-01-18 02:16:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:16:53,843 INFO L225 Difference]: With dead ends: 116207 [2022-01-18 02:16:53,843 INFO L226 Difference]: Without dead ends: 115649 [2022-01-18 02:16:53,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107252 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=17926, Invalid=219730, Unknown=0, NotChecked=0, Total=237656 [2022-01-18 02:16:53,851 INFO L933 BasicCegarLoop]: 726 mSDtfsCounter, 3625 mSDsluCounter, 20517 mSDsCounter, 0 mSdLazyCounter, 9186 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3625 SdHoareTripleChecker+Valid, 19002 SdHoareTripleChecker+Invalid, 31185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 9186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21666 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-01-18 02:16:53,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3625 Valid, 19002 Invalid, 31185 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [333 Valid, 9186 Invalid, 0 Unknown, 21666 Unchecked, 4.5s Time] [2022-01-18 02:16:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115649 states. [2022-01-18 02:16:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115649 to 16981. [2022-01-18 02:16:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16981 states, 16980 states have (on average 3.70547703180212) internal successors, (62919), 16980 states have internal predecessors, (62919), 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-01-18 02:16:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16981 states to 16981 states and 62919 transitions. [2022-01-18 02:16:55,320 INFO L78 Accepts]: Start accepts. Automaton has 16981 states and 62919 transitions. Word has length 124 [2022-01-18 02:16:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:16:55,320 INFO L470 AbstractCegarLoop]: Abstraction has 16981 states and 62919 transitions. [2022-01-18 02:16:55,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 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-01-18 02:16:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 16981 states and 62919 transitions. [2022-01-18 02:16:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:16:55,359 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:16:55,359 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] [2022-01-18 02:16:55,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-01-18 02:16:55,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:16:55,559 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:16:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:16:55,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2092648740, now seen corresponding path program 21 times [2022-01-18 02:16:55,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:16:55,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319971565] [2022-01-18 02:16:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:16:55,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:16:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:16:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:16:56,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:16:56,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319971565] [2022-01-18 02:16:56,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319971565] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:16:56,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333862965] [2022-01-18 02:16:56,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:16:56,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:16:56,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:16:56,155 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:16:56,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-01-18 02:16:56,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 02:16:56,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:16:56,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-18 02:16:56,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:16:56,832 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:16:56,833 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 27 treesize of output 27 [2022-01-18 02:16:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:16:57,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:16:57,531 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:16:57,531 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 23 treesize of output 24 [2022-01-18 02:16:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:16:57,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333862965] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:16:57,963 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:16:57,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 17] total 49 [2022-01-18 02:16:57,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824072824] [2022-01-18 02:16:57,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:16:57,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-01-18 02:16:57,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:16:57,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-01-18 02:16:57,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2097, Unknown=0, NotChecked=0, Total=2352 [2022-01-18 02:16:57,964 INFO L87 Difference]: Start difference. First operand 16981 states and 62919 transitions. Second operand has 49 states, 49 states have (on average 6.204081632653061) internal successors, (304), 49 states have internal predecessors, (304), 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-01-18 02:17:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:17:21,804 INFO L93 Difference]: Finished difference Result 93956 states and 341569 transitions. [2022-01-18 02:17:21,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 366 states. [2022-01-18 02:17:21,804 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 6.204081632653061) internal successors, (304), 49 states have internal predecessors, (304), 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 124 [2022-01-18 02:17:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:17:22,349 INFO L225 Difference]: With dead ends: 93956 [2022-01-18 02:17:22,349 INFO L226 Difference]: Without dead ends: 93371 [2022-01-18 02:17:22,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 243 SyntacticMatches, 6 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67865 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=13311, Invalid=138399, Unknown=0, NotChecked=0, Total=151710 [2022-01-18 02:17:22,355 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 3398 mSDsluCounter, 15353 mSDsCounter, 0 mSdLazyCounter, 8406 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3398 SdHoareTripleChecker+Valid, 14126 SdHoareTripleChecker+Invalid, 18378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 8406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9656 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-18 02:17:22,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3398 Valid, 14126 Invalid, 18378 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [316 Valid, 8406 Invalid, 0 Unknown, 9656 Unchecked, 4.2s Time] [2022-01-18 02:17:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93371 states. [2022-01-18 02:17:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93371 to 17001. [2022-01-18 02:17:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17001 states, 17000 states have (on average 3.7067058823529413) internal successors, (63014), 17000 states have internal predecessors, (63014), 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-01-18 02:17:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17001 states to 17001 states and 63014 transitions. [2022-01-18 02:17:23,606 INFO L78 Accepts]: Start accepts. Automaton has 17001 states and 63014 transitions. Word has length 124 [2022-01-18 02:17:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:17:23,607 INFO L470 AbstractCegarLoop]: Abstraction has 17001 states and 63014 transitions. [2022-01-18 02:17:23,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 6.204081632653061) internal successors, (304), 49 states have internal predecessors, (304), 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-01-18 02:17:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 17001 states and 63014 transitions. [2022-01-18 02:17:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:17:23,638 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:17:23,638 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] [2022-01-18 02:17:23,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-01-18 02:17:23,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:17:23,839 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:17:23,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:17:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1474847118, now seen corresponding path program 22 times [2022-01-18 02:17:23,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:17:23,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448818985] [2022-01-18 02:17:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:17:23,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:17:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:17:24,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:17:24,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:17:24,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448818985] [2022-01-18 02:17:24,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448818985] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:17:24,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104602467] [2022-01-18 02:17:24,411 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 02:17:24,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:17:24,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:17:24,412 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:17:24,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-01-18 02:17:24,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 02:17:24,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:17:24,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-18 02:17:24,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:17:25,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 02:17:25,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:17:26,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:17:26,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:17:26,351 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:17:26,352 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 27 treesize of output 27 [2022-01-18 02:17:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:17:26,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:17:27,036 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:17:27,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:17:27,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) c_~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) c_~res1~0) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:17:27,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:17:27,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:17:27,361 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:17:27,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 02:17:27,649 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:17:27,650 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 61 treesize of output 50 [2022-01-18 02:17:27,660 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:17:27,660 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 398 treesize of output 386 [2022-01-18 02:17:27,672 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:17:27,673 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 374 treesize of output 322 [2022-01-18 02:17:27,683 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:17:27,683 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 310 treesize of output 290 [2022-01-18 02:17:27,696 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:17:27,696 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 146 treesize of output 143 [2022-01-18 02:17:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 02:17:28,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104602467] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:17:28,752 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:17:28,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 77 [2022-01-18 02:17:28,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138877002] [2022-01-18 02:17:28,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:17:28,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-01-18 02:17:28,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:17:28,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-01-18 02:17:28,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=4366, Unknown=10, NotChecked=994, Total=5852 [2022-01-18 02:17:28,753 INFO L87 Difference]: Start difference. First operand 17001 states and 63014 transitions. Second operand has 77 states, 77 states have (on average 3.8051948051948052) internal successors, (293), 77 states have internal predecessors, (293), 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-01-18 02:17:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:17:36,384 INFO L93 Difference]: Finished difference Result 37388 states and 136707 transitions. [2022-01-18 02:17:36,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-18 02:17:36,384 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 3.8051948051948052) internal successors, (293), 77 states have internal predecessors, (293), 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 124 [2022-01-18 02:17:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:17:36,495 INFO L225 Difference]: With dead ends: 37388 [2022-01-18 02:17:36,495 INFO L226 Difference]: Without dead ends: 37238 [2022-01-18 02:17:36,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 205 SyntacticMatches, 8 SemanticMatches, 122 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 4502 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1332, Invalid=12258, Unknown=10, NotChecked=1652, Total=15252 [2022-01-18 02:17:36,496 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 1694 mSDsluCounter, 10497 mSDsCounter, 0 mSdLazyCounter, 3515 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 10041 SdHoareTripleChecker+Invalid, 8014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4444 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-18 02:17:36,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1694 Valid, 10041 Invalid, 8014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3515 Invalid, 0 Unknown, 4444 Unchecked, 1.5s Time] [2022-01-18 02:17:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37238 states. [2022-01-18 02:17:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37238 to 17561. [2022-01-18 02:17:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17561 states, 17560 states have (on average 3.715603644646925) internal successors, (65246), 17560 states have internal predecessors, (65246), 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-01-18 02:17:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17561 states to 17561 states and 65246 transitions. [2022-01-18 02:17:37,074 INFO L78 Accepts]: Start accepts. Automaton has 17561 states and 65246 transitions. Word has length 124 [2022-01-18 02:17:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:17:37,074 INFO L470 AbstractCegarLoop]: Abstraction has 17561 states and 65246 transitions. [2022-01-18 02:17:37,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 3.8051948051948052) internal successors, (293), 77 states have internal predecessors, (293), 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-01-18 02:17:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 17561 states and 65246 transitions. [2022-01-18 02:17:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:17:37,107 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:17:37,107 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] [2022-01-18 02:17:37,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-01-18 02:17:37,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-01-18 02:17:37,308 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:17:37,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:17:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1421602086, now seen corresponding path program 23 times [2022-01-18 02:17:37,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:17:37,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7415617] [2022-01-18 02:17:37,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:17:37,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:17:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:17:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:17:37,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:17:37,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7415617] [2022-01-18 02:17:37,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7415617] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:17:37,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533421443] [2022-01-18 02:17:37,883 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:17:37,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:17:37,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:17:37,885 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:17:37,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-01-18 02:17:38,001 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 02:17:38,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:17:38,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-18 02:17:38,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:17:38,071 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-01-18 02:17:38,105 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 02:17:38,106 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-01-18 02:17:38,369 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 02:17:38,369 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-01-18 02:17:38,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-18 02:17:38,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:17:38,979 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-01-18 02:17:39,071 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-01-18 02:17:39,266 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:17:39,266 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 27 treesize of output 27 [2022-01-18 02:17:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:17:39,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:17:40,173 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1435) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-01-18 02:17:40,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1435) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-01-18 02:17:40,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1435) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-01-18 02:17:40,586 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-01-18 02:17:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-18 02:17:40,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533421443] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:17:40,608 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:17:40,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 20] total 65 [2022-01-18 02:17:40,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020628251] [2022-01-18 02:17:40,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:17:40,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-01-18 02:17:40,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:17:40,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-01-18 02:17:40,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=3444, Unknown=3, NotChecked=366, Total=4160 [2022-01-18 02:17:40,610 INFO L87 Difference]: Start difference. First operand 17561 states and 65246 transitions. Second operand has 65 states, 65 states have (on average 4.630769230769231) internal successors, (301), 65 states have internal predecessors, (301), 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-01-18 02:18:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:18:17,747 INFO L93 Difference]: Finished difference Result 94532 states and 345562 transitions. [2022-01-18 02:18:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 519 states. [2022-01-18 02:18:17,748 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 4.630769230769231) internal successors, (301), 65 states have internal predecessors, (301), 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 124 [2022-01-18 02:18:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:18:18,306 INFO L225 Difference]: With dead ends: 94532 [2022-01-18 02:18:18,306 INFO L226 Difference]: Without dead ends: 94082 [2022-01-18 02:18:18,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 232 SyntacticMatches, 20 SemanticMatches, 560 ConstructedPredicates, 3 IntricatePredicates, 5 DeprecatedPredicates, 141464 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=22968, Invalid=288963, Unknown=3, NotChecked=3348, Total=315282 [2022-01-18 02:18:18,316 INFO L933 BasicCegarLoop]: 701 mSDtfsCounter, 5523 mSDsluCounter, 16567 mSDsCounter, 0 mSdLazyCounter, 9442 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5523 SdHoareTripleChecker+Valid, 15651 SdHoareTripleChecker+Invalid, 22439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 9442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12504 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-01-18 02:18:18,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5523 Valid, 15651 Invalid, 22439 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [493 Valid, 9442 Invalid, 0 Unknown, 12504 Unchecked, 4.8s Time] [2022-01-18 02:18:18,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94082 states. [2022-01-18 02:18:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94082 to 17409. [2022-01-18 02:18:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17409 states, 17408 states have (on average 3.7111672794117645) internal successors, (64604), 17408 states have internal predecessors, (64604), 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-01-18 02:18:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17409 states to 17409 states and 64604 transitions. [2022-01-18 02:18:19,606 INFO L78 Accepts]: Start accepts. Automaton has 17409 states and 64604 transitions. Word has length 124 [2022-01-18 02:18:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:18:19,606 INFO L470 AbstractCegarLoop]: Abstraction has 17409 states and 64604 transitions. [2022-01-18 02:18:19,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 4.630769230769231) internal successors, (301), 65 states have internal predecessors, (301), 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-01-18 02:18:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 17409 states and 64604 transitions. [2022-01-18 02:18:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:18:19,638 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:18:19,638 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] [2022-01-18 02:18:19,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-01-18 02:18:19,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-01-18 02:18:19,839 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:18:19,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:18:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1934802414, now seen corresponding path program 24 times [2022-01-18 02:18:19,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:18:19,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650633543] [2022-01-18 02:18:19,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:18:19,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:18:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:18:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:18:20,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:18:20,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650633543] [2022-01-18 02:18:20,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650633543] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:18:20,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099077969] [2022-01-18 02:18:20,390 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:18:20,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:18:20,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:18:20,391 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:18:20,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-01-18 02:18:20,525 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 02:18:20,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:18:20,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-18 02:18:20,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:18:21,115 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:18:21,115 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 27 treesize of output 27 [2022-01-18 02:18:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:18:21,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:18:21,778 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:18:21,778 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 23 treesize of output 24 [2022-01-18 02:18:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:18:22,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099077969] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:18:22,186 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:18:22,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-01-18 02:18:22,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355647753] [2022-01-18 02:18:22,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:18:22,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-18 02:18:22,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:18:22,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-18 02:18:22,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2022-01-18 02:18:22,188 INFO L87 Difference]: Start difference. First operand 17409 states and 64604 transitions. Second operand has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 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-01-18 02:18:45,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:18:45,621 INFO L93 Difference]: Finished difference Result 91418 states and 334526 transitions. [2022-01-18 02:18:45,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 385 states. [2022-01-18 02:18:45,622 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 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 124 [2022-01-18 02:18:45,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:18:46,133 INFO L225 Difference]: With dead ends: 91418 [2022-01-18 02:18:46,133 INFO L226 Difference]: Without dead ends: 90968 [2022-01-18 02:18:46,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 235 SyntacticMatches, 25 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76418 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=16789, Invalid=152543, Unknown=0, NotChecked=0, Total=169332 [2022-01-18 02:18:46,139 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 3637 mSDsluCounter, 14201 mSDsCounter, 0 mSdLazyCounter, 6797 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3637 SdHoareTripleChecker+Valid, 13314 SdHoareTripleChecker+Invalid, 19080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 6797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11962 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:18:46,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3637 Valid, 13314 Invalid, 19080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 6797 Invalid, 0 Unknown, 11962 Unchecked, 3.4s Time] [2022-01-18 02:18:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90968 states. [2022-01-18 02:18:47,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90968 to 17953. [2022-01-18 02:18:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17953 states, 17952 states have (on average 3.7199197860962565) internal successors, (66780), 17952 states have internal predecessors, (66780), 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-01-18 02:18:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 66780 transitions. [2022-01-18 02:18:47,411 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 66780 transitions. Word has length 124 [2022-01-18 02:18:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:18:47,411 INFO L470 AbstractCegarLoop]: Abstraction has 17953 states and 66780 transitions. [2022-01-18 02:18:47,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 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-01-18 02:18:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 66780 transitions. [2022-01-18 02:18:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 02:18:47,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:18:47,444 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] [2022-01-18 02:18:47,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-01-18 02:18:47,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-01-18 02:18:47,645 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 02:18:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:18:47,645 INFO L85 PathProgramCache]: Analyzing trace with hash -945486334, now seen corresponding path program 25 times [2022-01-18 02:18:47,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:18:47,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610683323] [2022-01-18 02:18:47,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:18:47,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:18:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:18:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:18:48,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:18:48,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610683323] [2022-01-18 02:18:48,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610683323] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:18:48,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127722968] [2022-01-18 02:18:48,220 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 02:18:48,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:18:48,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:18:48,221 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:18:48,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-01-18 02:18:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:18:48,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-01-18 02:18:48,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:18:48,445 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-01-18 02:18:48,883 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:18:48,883 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 11 treesize of output 11 [2022-01-18 02:18:49,101 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-01-18 02:18:49,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:18:49,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:18:49,882 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-01-18 02:18:50,068 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:18:50,068 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 27 treesize of output 27 [2022-01-18 02:18:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:18:50,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:18:50,899 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 02:18:50,961 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 02:18:51,027 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 c_~A~0.offset) c_~res1~0))))) is different from false [2022-01-18 02:18:51,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1503) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 c_~A~0.offset)))))) is different from false [2022-01-18 02:18:51,165 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1503) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) is different from false [2022-01-18 02:18:51,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1503) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) is different from false [2022-01-18 02:18:51,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1503) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1504) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1505) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 02:18:51,448 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:18:51,449 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 61 treesize of output 50 [2022-01-18 02:18:51,456 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:18:51,456 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 806 treesize of output 770 [2022-01-18 02:18:51,466 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:18:51,467 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 758 treesize of output 642 [2022-01-18 02:18:51,477 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:18:51,478 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 630 treesize of output 578 [2022-01-18 02:18:51,501 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:18:51,501 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 299 treesize of output 280 [2022-01-18 02:18:54,392 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-01-18 02:18:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 02:18:54,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127722968] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:18:54,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:18:54,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 31] total 79 [2022-01-18 02:18:54,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260510740] [2022-01-18 02:18:54,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:18:54,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-01-18 02:18:54,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:18:54,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-01-18 02:18:54,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=4512, Unknown=9, NotChecked=1022, Total=6162 [2022-01-18 02:18:54,418 INFO L87 Difference]: Start difference. First operand 17953 states and 66780 transitions. Second operand has 79 states, 79 states have (on average 3.8607594936708862) internal successors, (305), 79 states have internal predecessors, (305), 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) Received shutdown request... [2022-01-18 02:18:54,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 02:18:54,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=713, Invalid=5158, Unknown=9, NotChecked=1092, Total=6972 [2022-01-18 02:18:54,813 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 111 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:18:54,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 1021 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 285 Invalid, 0 Unknown, 399 Unchecked, 0.1s Time] [2022-01-18 02:18:54,814 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-18 02:18:54,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-01-18 02:18:54,833 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 02:18:54,833 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 02:18:55,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-01-18 02:18:55,019 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (17953states) and FLOYD_HOARE automaton (currently 13 states, 79 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 84 known predicates. [2022-01-18 02:18:55,021 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-18 02:18:55,021 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-18 02:18:55,021 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-18 02:18:55,023 INFO L732 BasicCegarLoop]: Path program histogram: [25, 9, 6, 1, 1, 1, 1, 1, 1] [2022-01-18 02:18:55,025 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 02:18:55,025 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 02:18:55,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 02:18:55 BasicIcfg [2022-01-18 02:18:55,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 02:18:55,027 INFO L158 Benchmark]: Toolchain (without parser) took 731278.93ms. Allocated memory was 367.0MB in the beginning and 4.6GB in the end (delta: 4.2GB). Free memory was 312.7MB in the beginning and 2.5GB in the end (delta: -2.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2022-01-18 02:18:55,027 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 367.0MB. Free memory is still 329.3MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 02:18:55,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.12ms. Allocated memory is still 367.0MB. Free memory was 312.4MB in the beginning and 337.7MB in the end (delta: -25.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.0GB. [2022-01-18 02:18:55,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.13ms. Allocated memory is still 367.0MB. Free memory was 337.7MB in the beginning and 335.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 02:18:55,027 INFO L158 Benchmark]: Boogie Preprocessor took 32.69ms. Allocated memory is still 367.0MB. Free memory was 335.6MB in the beginning and 333.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 02:18:55,027 INFO L158 Benchmark]: RCFGBuilder took 520.55ms. Allocated memory is still 367.0MB. Free memory was 333.8MB in the beginning and 306.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2022-01-18 02:18:55,028 INFO L158 Benchmark]: TraceAbstraction took 730418.84ms. Allocated memory was 367.0MB in the beginning and 4.6GB in the end (delta: 4.2GB). Free memory was 305.9MB in the beginning and 2.5GB in the end (delta: -2.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2022-01-18 02:18:55,028 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.11ms. Allocated memory is still 367.0MB. Free memory is still 329.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 264.12ms. Allocated memory is still 367.0MB. Free memory was 312.4MB in the beginning and 337.7MB in the end (delta: -25.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.13ms. Allocated memory is still 367.0MB. Free memory was 337.7MB in the beginning and 335.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.69ms. Allocated memory is still 367.0MB. Free memory was 335.6MB in the beginning and 333.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 520.55ms. Allocated memory is still 367.0MB. Free memory was 333.8MB in the beginning and 306.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 730418.84ms. Allocated memory was 367.0MB in the beginning and 4.6GB in the end (delta: 4.2GB). Free memory was 305.9MB in the beginning and 2.5GB in the end (delta: -2.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (17953states) and FLOYD_HOARE automaton (currently 13 states, 79 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 84 known predicates. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (17953states) and FLOYD_HOARE automaton (currently 13 states, 79 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 84 known predicates. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (17953states) and FLOYD_HOARE automaton (currently 13 states, 79 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 84 known predicates. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (17953states) and FLOYD_HOARE automaton (currently 13 states, 79 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 84 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 178 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 730.2s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 25, EmptinessCheckTime: 1.2s, AutomataDifference: 429.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88911 SdHoareTripleChecker+Valid, 83.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88911 mSDsluCounter, 338667 SdHoareTripleChecker+Invalid, 69.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 195097 IncrementalHoareTripleChecker+Unchecked, 354703 mSDsCounter, 4827 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178640 IncrementalHoareTripleChecker+Invalid, 378564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4827 mSolverCounterUnsat, 14553 mSDtfsCounter, 178640 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16584 GetRequests, 9083 SyntacticMatches, 394 SemanticMatches, 7106 ConstructedPredicates, 134 IntricatePredicates, 39 DeprecatedPredicates, 917902 ImplicationChecksByTransitivity, 353.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17953occurred in iteration=45, InterpolantAutomatonStates: 5479, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.5s AutomataMinimizationTime, 45 MinimizatonAttempts, 1162825 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 262.1s InterpolantComputationTime, 10627 NumberOfCodeBlocks, 10617 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 15541 ConstructedInterpolants, 1489 QuantifiedInterpolants, 188641 SizeOfPredicates, 1414 NumberOfNonLiveVariables, 13118 ConjunctsInSsa, 2410 ConjunctsInUnsatCore, 128 InterpolantComputations, 8 PerfectInterpolantSequences, 69/351 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown