/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-15 11:48:33,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 11:48:33,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 11:48:33,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 11:48:33,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 11:48:33,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 11:48:33,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 11:48:33,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 11:48:33,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 11:48:33,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 11:48:33,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 11:48:33,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 11:48:33,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 11:48:33,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 11:48:33,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 11:48:33,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 11:48:33,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 11:48:33,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 11:48:33,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 11:48:33,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 11:48:33,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 11:48:33,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 11:48:33,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 11:48:33,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 11:48:33,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 11:48:33,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 11:48:33,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 11:48:33,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 11:48:33,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 11:48:33,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 11:48:33,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 11:48:33,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 11:48:33,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 11:48:33,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 11:48:33,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 11:48:33,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 11:48:33,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 11:48:33,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 11:48:33,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 11:48:33,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 11:48:33,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 11:48:33,973 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-02-15 11:48:34,005 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 11:48:34,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 11:48:34,005 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-15 11:48:34,005 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-15 11:48:34,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-15 11:48:34,006 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-15 11:48:34,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-15 11:48:34,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-15 11:48:34,006 INFO L138 SettingsManager]: * Use SBE=true [2022-02-15 11:48:34,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 11:48:34,007 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 11:48:34,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 11:48:34,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 11:48:34,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 11:48:34,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 11:48:34,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 11:48:34,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 11:48:34,007 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 11:48:34,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 11:48:34,007 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 11:48:34,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 11:48:34,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 11:48:34,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 11:48:34,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 11:48:34,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 11:48:34,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 11:48:34,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 11:48:34,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-15 11:48:34,008 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-15 11:48:34,008 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 11:48:34,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-15 11:48:34,009 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-15 11:48:34,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 11:48:34,009 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-02-15 11:48:34,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 11:48:34,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 11:48:34,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 11:48:34,182 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 11:48:34,182 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 11:48:34,183 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-02-15 11:48:34,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe716e08/c9ab13b810934a888f84ec4668ef629b/FLAGf24d83e10 [2022-02-15 11:48:34,632 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 11:48:34,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-02-15 11:48:34,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe716e08/c9ab13b810934a888f84ec4668ef629b/FLAGf24d83e10 [2022-02-15 11:48:34,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe716e08/c9ab13b810934a888f84ec4668ef629b [2022-02-15 11:48:34,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 11:48:34,653 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 11:48:34,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 11:48:34,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 11:48:34,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 11:48:34,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:48:34" (1/1) ... [2022-02-15 11:48:34,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2230a280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34, skipping insertion in model container [2022-02-15 11:48:34,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:48:34" (1/1) ... [2022-02-15 11:48:34,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 11:48:34,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 11:48:34,833 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-02-15 11:48:34,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 11:48:34,845 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 11:48:34,858 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-02-15 11:48:34,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 11:48:34,872 INFO L208 MainTranslator]: Completed translation [2022-02-15 11:48:34,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34 WrapperNode [2022-02-15 11:48:34,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 11:48:34,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-15 11:48:34,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-15 11:48:34,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-15 11:48:34,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34" (1/1) ... [2022-02-15 11:48:34,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34" (1/1) ... [2022-02-15 11:48:34,901 INFO L137 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 200 [2022-02-15 11:48:34,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-15 11:48:34,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 11:48:34,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 11:48:34,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 11:48:34,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34" (1/1) ... [2022-02-15 11:48:34,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34" (1/1) ... [2022-02-15 11:48:34,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34" (1/1) ... [2022-02-15 11:48:34,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34" (1/1) ... [2022-02-15 11:48:34,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34" (1/1) ... [2022-02-15 11:48:34,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34" (1/1) ... [2022-02-15 11:48:34,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34" (1/1) ... [2022-02-15 11:48:34,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 11:48:34,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 11:48:34,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 11:48:34,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 11:48:34,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34" (1/1) ... [2022-02-15 11:48:34,944 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 11:48:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:48:34,961 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-02-15 11:48:34,982 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-02-15 11:48:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 11:48:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-15 11:48:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 11:48:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 11:48:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-15 11:48:35,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-15 11:48:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-15 11:48:35,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-15 11:48:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-15 11:48:35,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-15 11:48:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 11:48:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-15 11:48:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-15 11:48:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-15 11:48:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 11:48:35,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 11:48:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 11:48:35,021 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-15 11:48:35,084 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 11:48:35,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 11:48:35,283 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 11:48:35,405 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 11:48:35,405 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-15 11:48:35,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:48:35 BoogieIcfgContainer [2022-02-15 11:48:35,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 11:48:35,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 11:48:35,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 11:48:35,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 11:48:35,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 11:48:34" (1/3) ... [2022-02-15 11:48:35,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce1fde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:48:35, skipping insertion in model container [2022-02-15 11:48:35,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:34" (2/3) ... [2022-02-15 11:48:35,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce1fde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:48:35, skipping insertion in model container [2022-02-15 11:48:35,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:48:35" (3/3) ... [2022-02-15 11:48:35,412 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2022-02-15 11:48:35,415 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-15 11:48:35,415 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-15 11:48:35,415 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 11:48:35,416 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-15 11:48:35,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,460 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,460 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,460 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,460 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,460 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,464 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,464 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,464 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,464 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,464 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,464 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,466 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,466 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,466 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,469 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,469 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,469 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,469 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,469 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,470 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,470 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,470 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,470 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,470 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,470 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,471 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,471 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,471 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,471 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,471 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,471 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,471 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,471 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,471 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,471 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,472 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,472 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,472 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,473 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,473 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,473 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,473 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,473 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,473 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,473 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,474 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,474 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,474 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,474 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,474 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,474 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,474 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,474 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,475 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,475 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,475 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,475 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,475 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,476 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,476 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,476 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,476 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,476 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,476 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,476 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,476 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,476 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,477 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,477 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,477 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,478 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,478 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,478 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,478 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,478 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,478 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,478 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,479 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,479 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,479 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,479 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,491 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,491 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,493 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:48:35,495 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-02-15 11:48:35,526 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 11:48:35,530 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-15 11:48:35,531 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-15 11:48:35,566 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 156 transitions, 336 flow [2022-02-15 11:48:35,753 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-02-15 11:48:35,770 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-02-15 11:48:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:48:35,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:35,811 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-02-15 11:48:35,812 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:35,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:35,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1255483766, now seen corresponding path program 1 times [2022-02-15 11:48:35,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:35,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220729343] [2022-02-15 11:48:35,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:35,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:48:36,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:36,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220729343] [2022-02-15 11:48:36,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220729343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:48:36,034 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:48:36,034 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-15 11:48:36,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469776004] [2022-02-15 11:48:36,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:48:36,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-15 11:48:36,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:36,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-15 11:48:36,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-15 11:48:36,091 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-02-15 11:48:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:36,208 INFO L93 Difference]: Finished difference Result 5072 states and 17963 transitions. [2022-02-15 11:48:36,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-15 11:48:36,210 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-02-15 11:48:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:36,266 INFO L225 Difference]: With dead ends: 5072 [2022-02-15 11:48:36,267 INFO L226 Difference]: Without dead ends: 5068 [2022-02-15 11:48:36,268 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-02-15 11:48:36,272 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.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:48:36,273 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.0s Time] [2022-02-15 11:48:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2022-02-15 11:48:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 5068. [2022-02-15 11:48:36,573 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-02-15 11:48:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5068 states to 5068 states and 17959 transitions. [2022-02-15 11:48:36,632 INFO L78 Accepts]: Start accepts. Automaton has 5068 states and 17959 transitions. Word has length 105 [2022-02-15 11:48:36,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:36,632 INFO L470 AbstractCegarLoop]: Abstraction has 5068 states and 17959 transitions. [2022-02-15 11:48:36,634 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-02-15 11:48:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 5068 states and 17959 transitions. [2022-02-15 11:48:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:48:36,648 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:36,648 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-02-15 11:48:36,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 11:48:36,649 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:36,652 INFO L85 PathProgramCache]: Analyzing trace with hash 613749194, now seen corresponding path program 1 times [2022-02-15 11:48:36,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:36,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410418555] [2022-02-15 11:48:36,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:36,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:48:36,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:36,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410418555] [2022-02-15 11:48:36,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410418555] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:48:36,918 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:48:36,918 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 11:48:36,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178429837] [2022-02-15 11:48:36,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:48:36,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 11:48:36,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:36,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 11:48:36,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 11:48:36,921 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-02-15 11:48:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:37,176 INFO L93 Difference]: Finished difference Result 9970 states and 35356 transitions. [2022-02-15 11:48:37,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 11:48:37,177 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-02-15 11:48:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:37,259 INFO L225 Difference]: With dead ends: 9970 [2022-02-15 11:48:37,260 INFO L226 Difference]: Without dead ends: 9820 [2022-02-15 11:48:37,263 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-02-15 11:48:37,265 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-02-15 11:48:37,265 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-02-15 11:48:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2022-02-15 11:48:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 5678. [2022-02-15 11:48:37,489 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-02-15 11:48:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 20050 transitions. [2022-02-15 11:48:37,526 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 20050 transitions. Word has length 105 [2022-02-15 11:48:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:37,528 INFO L470 AbstractCegarLoop]: Abstraction has 5678 states and 20050 transitions. [2022-02-15 11:48:37,529 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-02-15 11:48:37,529 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 20050 transitions. [2022-02-15 11:48:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-15 11:48:37,549 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:37,549 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-02-15 11:48:37,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 11:48:37,549 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:37,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2081314034, now seen corresponding path program 1 times [2022-02-15 11:48:37,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:37,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912088104] [2022-02-15 11:48:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:37,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:48:37,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:37,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912088104] [2022-02-15 11:48:37,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912088104] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:48:37,779 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:48:37,779 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 11:48:37,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534989866] [2022-02-15 11:48:37,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:48:37,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 11:48:37,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 11:48:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-15 11:48:37,781 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-02-15 11:48:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:38,103 INFO L93 Difference]: Finished difference Result 8818 states and 30445 transitions. [2022-02-15 11:48:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 11:48:38,103 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-02-15 11:48:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:38,132 INFO L225 Difference]: With dead ends: 8818 [2022-02-15 11:48:38,133 INFO L226 Difference]: Without dead ends: 8728 [2022-02-15 11:48:38,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-02-15 11:48:38,134 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.2s IncrementalHoareTripleChecker+Time [2022-02-15 11:48:38,134 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.2s Time] [2022-02-15 11:48:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2022-02-15 11:48:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 6938. [2022-02-15 11:48:38,323 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-02-15 11:48:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 24405 transitions. [2022-02-15 11:48:38,347 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 24405 transitions. Word has length 111 [2022-02-15 11:48:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:38,347 INFO L470 AbstractCegarLoop]: Abstraction has 6938 states and 24405 transitions. [2022-02-15 11:48:38,347 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-02-15 11:48:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 24405 transitions. [2022-02-15 11:48:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-15 11:48:38,364 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:38,364 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-02-15 11:48:38,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 11:48:38,365 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:38,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1189826400, now seen corresponding path program 1 times [2022-02-15 11:48:38,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:38,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192646158] [2022-02-15 11:48:38,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:38,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:48:38,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:38,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192646158] [2022-02-15 11:48:38,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192646158] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:48:38,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:48:38,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 11:48:38,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518131296] [2022-02-15 11:48:38,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:48:38,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 11:48:38,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:38,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 11:48:38,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-15 11:48:38,624 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-02-15 11:48:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:39,073 INFO L93 Difference]: Finished difference Result 7558 states and 25776 transitions. [2022-02-15 11:48:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 11:48:39,073 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-02-15 11:48:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:39,096 INFO L225 Difference]: With dead ends: 7558 [2022-02-15 11:48:39,096 INFO L226 Difference]: Without dead ends: 7294 [2022-02-15 11:48:39,096 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-02-15 11:48:39,097 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-02-15 11:48:39,097 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-02-15 11:48:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2022-02-15 11:48:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 6848. [2022-02-15 11:48:39,238 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-02-15 11:48:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6848 states to 6848 states and 23731 transitions. [2022-02-15 11:48:39,260 INFO L78 Accepts]: Start accepts. Automaton has 6848 states and 23731 transitions. Word has length 111 [2022-02-15 11:48:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:39,260 INFO L470 AbstractCegarLoop]: Abstraction has 6848 states and 23731 transitions. [2022-02-15 11:48:39,260 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-02-15 11:48:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 6848 states and 23731 transitions. [2022-02-15 11:48:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-15 11:48:39,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:39,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:48:39,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 11:48:39,282 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash -805575258, now seen corresponding path program 1 times [2022-02-15 11:48:39,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:39,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807281679] [2022-02-15 11:48:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:39,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:48:39,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:39,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807281679] [2022-02-15 11:48:39,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807281679] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:48:39,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:48:39,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 11:48:39,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609591811] [2022-02-15 11:48:39,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:48:39,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 11:48:39,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:39,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 11:48:39,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-15 11:48:39,341 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-02-15 11:48:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:39,489 INFO L93 Difference]: Finished difference Result 5971 states and 20798 transitions. [2022-02-15 11:48:39,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 11:48:39,489 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-02-15 11:48:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:39,506 INFO L225 Difference]: With dead ends: 5971 [2022-02-15 11:48:39,506 INFO L226 Difference]: Without dead ends: 5684 [2022-02-15 11:48:39,507 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-02-15 11:48:39,510 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.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:48:39,511 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.0s Time] [2022-02-15 11:48:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5684 states. [2022-02-15 11:48:39,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5684 to 5679. [2022-02-15 11:48:39,639 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-02-15 11:48:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 20051 transitions. [2022-02-15 11:48:39,656 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 20051 transitions. Word has length 111 [2022-02-15 11:48:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:39,657 INFO L470 AbstractCegarLoop]: Abstraction has 5679 states and 20051 transitions. [2022-02-15 11:48:39,657 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-02-15 11:48:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 20051 transitions. [2022-02-15 11:48:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-15 11:48:39,675 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:39,675 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-02-15 11:48:39,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 11:48:39,676 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1704257340, now seen corresponding path program 1 times [2022-02-15 11:48:39,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:39,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772142532] [2022-02-15 11:48:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:39,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:39,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:39,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772142532] [2022-02-15 11:48:39,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772142532] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:39,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995942136] [2022-02-15 11:48:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:39,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:39,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:48:39,751 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-02-15 11:48:39,752 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-02-15 11:48:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:39,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-15 11:48:39,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:48:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:40,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:48:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:40,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995942136] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:40,283 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 11:48:40,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-02-15 11:48:40,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747401810] [2022-02-15 11:48:40,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:48:40,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 11:48:40,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:40,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 11:48:40,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-02-15 11:48:40,284 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-02-15 11:48:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:40,414 INFO L93 Difference]: Finished difference Result 5775 states and 20516 transitions. [2022-02-15 11:48:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 11:48:40,415 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-02-15 11:48:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:40,431 INFO L225 Difference]: With dead ends: 5775 [2022-02-15 11:48:40,431 INFO L226 Difference]: Without dead ends: 5775 [2022-02-15 11:48:40,432 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-02-15 11:48:40,435 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 248 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:48:40,435 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.0s Time] [2022-02-15 11:48:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2022-02-15 11:48:40,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5535. [2022-02-15 11:48:40,536 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-02-15 11:48:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 19652 transitions. [2022-02-15 11:48:40,552 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 19652 transitions. Word has length 118 [2022-02-15 11:48:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:40,552 INFO L470 AbstractCegarLoop]: Abstraction has 5535 states and 19652 transitions. [2022-02-15 11:48:40,553 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-02-15 11:48:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 19652 transitions. [2022-02-15 11:48:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-15 11:48:40,565 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:40,565 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-02-15 11:48:40,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-15 11:48:40,782 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-02-15 11:48:40,784 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:40,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1314971180, now seen corresponding path program 1 times [2022-02-15 11:48:40,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:40,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779431606] [2022-02-15 11:48:40,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:40,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:40,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:40,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779431606] [2022-02-15 11:48:40,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779431606] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:40,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944619505] [2022-02-15 11:48:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:40,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:40,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:48:40,862 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-02-15 11:48:40,863 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-02-15 11:48:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:40,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-15 11:48:40,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:48:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:41,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:48:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:41,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944619505] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:41,389 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 11:48:41,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-02-15 11:48:41,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543174360] [2022-02-15 11:48:41,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:48:41,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 11:48:41,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:41,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 11:48:41,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-02-15 11:48:41,390 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-02-15 11:48:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:41,587 INFO L93 Difference]: Finished difference Result 7577 states and 27120 transitions. [2022-02-15 11:48:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 11:48:41,588 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-02-15 11:48:41,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:41,612 INFO L225 Difference]: With dead ends: 7577 [2022-02-15 11:48:41,612 INFO L226 Difference]: Without dead ends: 7577 [2022-02-15 11:48:41,613 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-02-15 11:48:41,613 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.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:48:41,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 576 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 11:48:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2022-02-15 11:48:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 5864. [2022-02-15 11:48:41,766 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-02-15 11:48:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 20823 transitions. [2022-02-15 11:48:41,782 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 20823 transitions. Word has length 118 [2022-02-15 11:48:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:41,782 INFO L470 AbstractCegarLoop]: Abstraction has 5864 states and 20823 transitions. [2022-02-15 11:48:41,783 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-02-15 11:48:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 20823 transitions. [2022-02-15 11:48:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-15 11:48:41,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:41,795 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-02-15 11:48:41,811 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-02-15 11:48:42,008 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-02-15 11:48:42,009 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:42,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash 267659860, now seen corresponding path program 2 times [2022-02-15 11:48:42,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:42,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640945135] [2022-02-15 11:48:42,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:42,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:42,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:42,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640945135] [2022-02-15 11:48:42,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640945135] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:42,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095612119] [2022-02-15 11:48:42,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 11:48:42,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:42,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:48:42,087 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-02-15 11:48:42,088 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-02-15 11:48:42,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:48:42,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:48:42,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-15 11:48:42,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:48:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:42,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:48:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:42,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095612119] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:48:42,537 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:48:42,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-02-15 11:48:42,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610182853] [2022-02-15 11:48:42,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:48:42,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-15 11:48:42,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:42,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-15 11:48:42,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-02-15 11:48:42,538 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-02-15 11:48:43,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:43,513 INFO L93 Difference]: Finished difference Result 26682 states and 97534 transitions. [2022-02-15 11:48:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-15 11:48:43,513 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-02-15 11:48:43,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:43,635 INFO L225 Difference]: With dead ends: 26682 [2022-02-15 11:48:43,635 INFO L226 Difference]: Without dead ends: 26682 [2022-02-15 11:48:43,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=570, Invalid=1686, Unknown=0, NotChecked=0, Total=2256 [2022-02-15 11:48:43,636 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.3s IncrementalHoareTripleChecker+Time [2022-02-15 11:48:43,637 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.3s Time] [2022-02-15 11:48:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26682 states. [2022-02-15 11:48:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26682 to 5911. [2022-02-15 11:48:43,925 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-02-15 11:48:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 21091 transitions. [2022-02-15 11:48:44,050 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 21091 transitions. Word has length 118 [2022-02-15 11:48:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:44,051 INFO L470 AbstractCegarLoop]: Abstraction has 5911 states and 21091 transitions. [2022-02-15 11:48:44,051 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-02-15 11:48:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 21091 transitions. [2022-02-15 11:48:44,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-15 11:48:44,063 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:44,063 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-02-15 11:48:44,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-15 11:48:44,280 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-02-15 11:48:44,280 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:44,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:44,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1570091000, now seen corresponding path program 3 times [2022-02-15 11:48:44,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:44,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754236744] [2022-02-15 11:48:44,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:44,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:44,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-02-15 11:48:44,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:44,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754236744] [2022-02-15 11:48:44,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754236744] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:44,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984598933] [2022-02-15 11:48:44,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 11:48:44,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:44,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:48:44,388 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-02-15 11:48:44,414 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-02-15 11:48:44,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-15 11:48:44,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:48:44,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-15 11:48:44,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:48:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:44,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:48:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:44,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984598933] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:48:44,813 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:48:44,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-02-15 11:48:44,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922641706] [2022-02-15 11:48:44,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:48:44,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 11:48:44,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:44,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 11:48:44,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-02-15 11:48:44,815 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-02-15 11:48:45,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:45,541 INFO L93 Difference]: Finished difference Result 18477 states and 67462 transitions. [2022-02-15 11:48:45,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-15 11:48:45,541 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-02-15 11:48:45,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:45,674 INFO L225 Difference]: With dead ends: 18477 [2022-02-15 11:48:45,674 INFO L226 Difference]: Without dead ends: 18477 [2022-02-15 11:48:45,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=970, Unknown=0, NotChecked=0, Total=1332 [2022-02-15 11:48:45,676 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.3s IncrementalHoareTripleChecker+Time [2022-02-15 11:48:45,677 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.3s Time] [2022-02-15 11:48:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18477 states. [2022-02-15 11:48:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18477 to 6055. [2022-02-15 11:48:45,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-02-15 11:48:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6055 states to 6055 states and 21572 transitions. [2022-02-15 11:48:45,931 INFO L78 Accepts]: Start accepts. Automaton has 6055 states and 21572 transitions. Word has length 118 [2022-02-15 11:48:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:45,931 INFO L470 AbstractCegarLoop]: Abstraction has 6055 states and 21572 transitions. [2022-02-15 11:48:45,931 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-02-15 11:48:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 6055 states and 21572 transitions. [2022-02-15 11:48:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-15 11:48:45,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:45,946 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-02-15 11:48:45,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-15 11:48:46,162 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-02-15 11:48:46,162 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:46,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2139413420, now seen corresponding path program 4 times [2022-02-15 11:48:46,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:46,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620519830] [2022-02-15 11:48:46,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:46,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:46,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:46,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620519830] [2022-02-15 11:48:46,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620519830] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:46,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843497005] [2022-02-15 11:48:46,251 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-15 11:48:46,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:46,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:48:46,268 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-02-15 11:48:46,269 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-02-15 11:48:46,345 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-15 11:48:46,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:48:46,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-15 11:48:46,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:48:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:46,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:48:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:46,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843497005] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:46,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 11:48:46,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2022-02-15 11:48:46,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219244605] [2022-02-15 11:48:46,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:48:46,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 11:48:46,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:46,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 11:48:46,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-02-15 11:48:46,805 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-02-15 11:48:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:47,046 INFO L93 Difference]: Finished difference Result 12871 states and 46133 transitions. [2022-02-15 11:48:47,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 11:48:47,047 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-02-15 11:48:47,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:47,089 INFO L225 Difference]: With dead ends: 12871 [2022-02-15 11:48:47,089 INFO L226 Difference]: Without dead ends: 12871 [2022-02-15 11:48:47,090 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-02-15 11:48:47,090 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-02-15 11:48:47,091 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-02-15 11:48:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12871 states. [2022-02-15 11:48:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12871 to 6215. [2022-02-15 11:48:47,294 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-02-15 11:48:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 22325 transitions. [2022-02-15 11:48:47,314 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 22325 transitions. Word has length 118 [2022-02-15 11:48:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:47,315 INFO L470 AbstractCegarLoop]: Abstraction has 6215 states and 22325 transitions. [2022-02-15 11:48:47,315 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-02-15 11:48:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 22325 transitions. [2022-02-15 11:48:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-15 11:48:47,331 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:47,332 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-02-15 11:48:47,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-15 11:48:47,548 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-02-15 11:48:47,548 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:47,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash -836982280, now seen corresponding path program 5 times [2022-02-15 11:48:47,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:47,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995416266] [2022-02-15 11:48:47,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:47,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:47,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:47,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995416266] [2022-02-15 11:48:47,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995416266] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:47,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098384281] [2022-02-15 11:48:47,630 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-15 11:48:47,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:47,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:48:47,631 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-02-15 11:48:47,633 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-02-15 11:48:47,714 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:48:47,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:48:47,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-15 11:48:47,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:48:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:47,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:48:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:48,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098384281] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:48:48,037 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:48:48,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-02-15 11:48:48,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971062623] [2022-02-15 11:48:48,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:48:48,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 11:48:48,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:48,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 11:48:48,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-02-15 11:48:48,038 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-02-15 11:48:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:49,031 INFO L93 Difference]: Finished difference Result 22956 states and 82999 transitions. [2022-02-15 11:48:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-15 11:48:49,032 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-02-15 11:48:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:49,108 INFO L225 Difference]: With dead ends: 22956 [2022-02-15 11:48:49,108 INFO L226 Difference]: Without dead ends: 22956 [2022-02-15 11:48:49,108 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-02-15 11:48:49,109 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-02-15 11:48:49,109 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-02-15 11:48:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22956 states. [2022-02-15 11:48:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22956 to 6168. [2022-02-15 11:48:49,413 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-02-15 11:48:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6168 states to 6168 states and 22057 transitions. [2022-02-15 11:48:49,433 INFO L78 Accepts]: Start accepts. Automaton has 6168 states and 22057 transitions. Word has length 118 [2022-02-15 11:48:49,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:49,433 INFO L470 AbstractCegarLoop]: Abstraction has 6168 states and 22057 transitions. [2022-02-15 11:48:49,433 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-02-15 11:48:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6168 states and 22057 transitions. [2022-02-15 11:48:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-15 11:48:49,445 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:49,445 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-02-15 11:48:49,463 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-02-15 11:48:49,655 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-02-15 11:48:49,655 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1449163496, now seen corresponding path program 6 times [2022-02-15 11:48:49,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:49,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571960835] [2022-02-15 11:48:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:49,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:49,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:49,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571960835] [2022-02-15 11:48:49,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571960835] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:49,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883936612] [2022-02-15 11:48:49,741 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-15 11:48:49,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:49,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:48:49,742 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-02-15 11:48:49,743 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-02-15 11:48:49,823 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-02-15 11:48:49,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:48:49,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-15 11:48:49,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:48:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:50,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:48:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:50,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883936612] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:48:50,195 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:48:50,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-02-15 11:48:50,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715017803] [2022-02-15 11:48:50,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:48:50,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 11:48:50,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:50,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 11:48:50,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-02-15 11:48:50,197 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-02-15 11:48:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:50,756 INFO L93 Difference]: Finished difference Result 14859 states and 53179 transitions. [2022-02-15 11:48:50,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-15 11:48:50,757 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-02-15 11:48:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:50,802 INFO L225 Difference]: With dead ends: 14859 [2022-02-15 11:48:50,802 INFO L226 Difference]: Without dead ends: 14859 [2022-02-15 11:48:50,803 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-02-15 11:48:50,803 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 535 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-02-15 11:48:50,803 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-02-15 11:48:50,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2022-02-15 11:48:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 6510. [2022-02-15 11:48:51,035 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-02-15 11:48:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 23066 transitions. [2022-02-15 11:48:51,054 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 23066 transitions. Word has length 118 [2022-02-15 11:48:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:51,054 INFO L470 AbstractCegarLoop]: Abstraction has 6510 states and 23066 transitions. [2022-02-15 11:48:51,054 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-02-15 11:48:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 23066 transitions. [2022-02-15 11:48:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:48:51,067 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:51,067 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-02-15 11:48:51,084 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-02-15 11:48:51,284 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-02-15 11:48:51,284 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:51,284 INFO L85 PathProgramCache]: Analyzing trace with hash 372116376, now seen corresponding path program 1 times [2022-02-15 11:48:51,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:51,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932072015] [2022-02-15 11:48:51,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:51,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:51,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:51,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932072015] [2022-02-15 11:48:51,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932072015] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:51,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127166513] [2022-02-15 11:48:51,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:51,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:51,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:48:51,742 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-02-15 11:48:51,746 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-02-15 11:48:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:51,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-15 11:48:51,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:48:51,907 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-02-15 11:48:51,947 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-15 11:48:51,947 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-02-15 11:48:52,320 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:48:52,320 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-02-15 11:48:52,499 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-02-15 11:48:52,776 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-02-15 11:48:53,018 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-02-15 11:48:53,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:48:53,080 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-02-15 11:48:53,168 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-02-15 11:48:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:48:53,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:48:53,386 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-02-15 11:48:53,423 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-02-15 11:48:53,461 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-02-15 11:48:53,467 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-02-15 11:48:53,477 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-02-15 11:48:53,487 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-02-15 11:48:53,544 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-02-15 11:48:53,554 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-02-15 11:48:53,561 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-02-15 11:48:53,599 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:48:53,599 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-02-15 11:48:53,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 790 treesize of output 726 [2022-02-15 11:48:53,608 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-02-15 11:48:53,615 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-02-15 11:48:53,633 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-02-15 11:48:56,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-15 11:48:56,245 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-02-15 11:48:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-15 11:48:56,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127166513] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:48:56,267 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:48:56,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 22] total 54 [2022-02-15 11:48:56,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24836306] [2022-02-15 11:48:56,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:48:56,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-15 11:48:56,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:56,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-15 11:48:56,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1797, Unknown=9, NotChecked=846, Total=2862 [2022-02-15 11:48:56,269 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-02-15 11:48:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:58,873 INFO L93 Difference]: Finished difference Result 18736 states and 66973 transitions. [2022-02-15 11:48:58,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-15 11:48:58,873 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-02-15 11:48:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:58,927 INFO L225 Difference]: With dead ends: 18736 [2022-02-15 11:48:58,927 INFO L226 Difference]: Without dead ends: 18586 [2022-02-15 11:48:58,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 217 SyntacticMatches, 11 SemanticMatches, 81 ConstructedPredicates, 9 IntricatePredicates, 3 DeprecatedPredicates, 1559 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=668, Invalid=4761, Unknown=9, NotChecked=1368, Total=6806 [2022-02-15 11:48:58,929 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 1626 mSDsluCounter, 5401 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 11:48:58,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1626 Valid, 5230 Invalid, 6137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2090 Invalid, 0 Unknown, 4004 Unchecked, 0.9s Time] [2022-02-15 11:48:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18586 states. [2022-02-15 11:48:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18586 to 9408. [2022-02-15 11:48:59,169 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-02-15 11:48:59,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9408 states to 9408 states and 33629 transitions. [2022-02-15 11:48:59,196 INFO L78 Accepts]: Start accepts. Automaton has 9408 states and 33629 transitions. Word has length 124 [2022-02-15 11:48:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:59,196 INFO L470 AbstractCegarLoop]: Abstraction has 9408 states and 33629 transitions. [2022-02-15 11:48:59,196 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-02-15 11:48:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9408 states and 33629 transitions. [2022-02-15 11:48:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:48:59,214 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:59,214 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-02-15 11:48:59,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-15 11:48:59,414 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-02-15 11:48:59,415 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:48:59,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1263604010, now seen corresponding path program 1 times [2022-02-15 11:48:59,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:59,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783825870] [2022-02-15 11:48:59,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:59,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:49:00,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:00,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783825870] [2022-02-15 11:49:00,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783825870] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:00,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434685219] [2022-02-15 11:49:00,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:00,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:00,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:00,202 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-02-15 11:49:00,203 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-02-15 11:49:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:00,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 85 conjunts are in the unsatisfiable core [2022-02-15 11:49:00,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:00,399 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-02-15 11:49:00,454 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-15 11:49:00,455 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-02-15 11:49:00,887 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:49:00,888 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-02-15 11:49:01,087 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-02-15 11:49:01,851 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-02-15 11:49:02,352 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-02-15 11:49:02,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:49:02,514 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-02-15 11:49:02,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-15 11:49:02,699 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:49:02,699 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-02-15 11:49:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:49:02,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:04,562 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:49:04,562 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-02-15 11:49:04,572 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:49:04,573 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-02-15 11:49:04,579 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-02-15 11:49:04,585 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-02-15 11:49:04,596 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:49:04,596 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-02-15 11:49:06,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-15 11:49:06,952 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-02-15 11:49:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:49:06,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434685219] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:06,974 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:06,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 32] total 83 [2022-02-15 11:49:06,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394311498] [2022-02-15 11:49:06,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:06,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-02-15 11:49:06,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:06,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-02-15 11:49:06,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=6217, Unknown=74, NotChecked=0, Total=6806 [2022-02-15 11:49:06,977 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-02-15 11:49:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:13,951 INFO L93 Difference]: Finished difference Result 36669 states and 132152 transitions. [2022-02-15 11:49:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-02-15 11:49:13,951 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-02-15 11:49:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:14,165 INFO L225 Difference]: With dead ends: 36669 [2022-02-15 11:49:14,165 INFO L226 Difference]: Without dead ends: 36369 [2022-02-15 11:49:14,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5892 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2233, Invalid=17715, Unknown=74, NotChecked=0, Total=20022 [2022-02-15 11:49:14,169 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 3268 mSDsluCounter, 10626 mSDsCounter, 0 mSdLazyCounter, 4953 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:49:14,169 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.1s Time] [2022-02-15 11:49:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36369 states. [2022-02-15 11:49:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36369 to 11810. [2022-02-15 11:49:14,545 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-02-15 11:49:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11810 states to 11810 states and 42359 transitions. [2022-02-15 11:49:14,579 INFO L78 Accepts]: Start accepts. Automaton has 11810 states and 42359 transitions. Word has length 124 [2022-02-15 11:49:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:14,580 INFO L470 AbstractCegarLoop]: Abstraction has 11810 states and 42359 transitions. [2022-02-15 11:49:14,580 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-02-15 11:49:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 11810 states and 42359 transitions. [2022-02-15 11:49:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:49:14,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:14,601 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-02-15 11:49:14,617 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-02-15 11:49:14,801 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-02-15 11:49:14,802 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:49:14,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash 541534492, now seen corresponding path program 2 times [2022-02-15 11:49:14,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:14,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467348887] [2022-02-15 11:49:14,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:14,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:49:15,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:15,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467348887] [2022-02-15 11:49:15,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467348887] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:15,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240509126] [2022-02-15 11:49:15,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 11:49:15,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:15,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:15,271 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-02-15 11:49:15,271 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-02-15 11:49:15,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:49:15,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:49:15,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-15 11:49:15,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:16,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:49:16,064 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-02-15 11:49:16,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:49:16,135 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-02-15 11:49:16,228 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-02-15 11:49:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:16,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:16,415 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-02-15 11:49:16,431 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-02-15 11:49:16,449 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:49:16,450 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-02-15 11:49:16,452 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-02-15 11:49:16,460 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-02-15 11:49:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:16,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240509126] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:16,989 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:16,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 20] total 51 [2022-02-15 11:49:16,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975789505] [2022-02-15 11:49:16,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:16,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-15 11:49:16,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:16,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-15 11:49:16,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2127, Unknown=2, NotChecked=190, Total=2550 [2022-02-15 11:49:16,991 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-02-15 11:49:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:18,716 INFO L93 Difference]: Finished difference Result 18584 states and 66824 transitions. [2022-02-15 11:49:18,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-15 11:49:18,717 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-02-15 11:49:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:18,767 INFO L225 Difference]: With dead ends: 18584 [2022-02-15 11:49:18,767 INFO L226 Difference]: Without dead ends: 18434 [2022-02-15 11:49:18,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=628, Invalid=4070, Unknown=2, NotChecked=270, Total=4970 [2022-02-15 11:49:18,769 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-02-15 11:49:18,769 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-02-15 11:49:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18434 states. [2022-02-15 11:49:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18434 to 12232. [2022-02-15 11:49:19,070 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-02-15 11:49:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12232 states to 12232 states and 43931 transitions. [2022-02-15 11:49:19,101 INFO L78 Accepts]: Start accepts. Automaton has 12232 states and 43931 transitions. Word has length 124 [2022-02-15 11:49:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:19,101 INFO L470 AbstractCegarLoop]: Abstraction has 12232 states and 43931 transitions. [2022-02-15 11:49:19,101 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-02-15 11:49:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 12232 states and 43931 transitions. [2022-02-15 11:49:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:49:19,121 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:19,122 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-02-15 11:49:19,137 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-02-15 11:49:19,332 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-02-15 11:49:19,332 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:49:19,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1105715552, now seen corresponding path program 3 times [2022-02-15 11:49:19,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:19,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073299097] [2022-02-15 11:49:19,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:19,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:19,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:19,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073299097] [2022-02-15 11:49:19,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073299097] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:19,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116659649] [2022-02-15 11:49:19,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 11:49:19,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:19,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:19,650 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-02-15 11:49:19,651 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-02-15 11:49:19,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-15 11:49:19,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:49:19,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-15 11:49:19,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:20,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:49:20,386 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-02-15 11:49:20,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:49:20,455 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-02-15 11:49:20,545 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-02-15 11:49:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:20,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:20,728 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-02-15 11:49:20,745 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-02-15 11:49:20,773 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:49:20,773 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-02-15 11:49:20,778 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-02-15 11:49:20,781 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-02-15 11:49:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:21,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116659649] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:21,280 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:21,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 46 [2022-02-15 11:49:21,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680230288] [2022-02-15 11:49:21,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:21,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-02-15 11:49:21,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:21,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-02-15 11:49:21,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1701, Unknown=2, NotChecked=170, Total=2070 [2022-02-15 11:49:21,282 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-02-15 11:49:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:23,355 INFO L93 Difference]: Finished difference Result 37903 states and 136252 transitions. [2022-02-15 11:49:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-15 11:49:23,356 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-02-15 11:49:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:23,482 INFO L225 Difference]: With dead ends: 37903 [2022-02-15 11:49:23,483 INFO L226 Difference]: Without dead ends: 37603 [2022-02-15 11:49:23,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 222 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=739, Invalid=5429, Unknown=2, NotChecked=310, Total=6480 [2022-02-15 11:49:23,485 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 1655 mSDsluCounter, 5704 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-02-15 11:49:23,485 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-02-15 11:49:23,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37603 states. [2022-02-15 11:49:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37603 to 12580. [2022-02-15 11:49:23,983 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-02-15 11:49:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 45309 transitions. [2022-02-15 11:49:24,018 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 45309 transitions. Word has length 124 [2022-02-15 11:49:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:24,019 INFO L470 AbstractCegarLoop]: Abstraction has 12580 states and 45309 transitions. [2022-02-15 11:49:24,019 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-02-15 11:49:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 45309 transitions. [2022-02-15 11:49:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:49:24,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:24,044 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-02-15 11:49:24,076 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-02-15 11:49:24,261 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-02-15 11:49:24,262 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:49:24,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:24,263 INFO L85 PathProgramCache]: Analyzing trace with hash 879013074, now seen corresponding path program 4 times [2022-02-15 11:49:24,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:24,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346344549] [2022-02-15 11:49:24,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:24,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:24,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:24,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346344549] [2022-02-15 11:49:24,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346344549] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:24,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657480716] [2022-02-15 11:49:24,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-15 11:49:24,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:24,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:24,664 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-02-15 11:49:24,665 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-02-15 11:49:24,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-15 11:49:24,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:49:24,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 66 conjunts are in the unsatisfiable core [2022-02-15 11:49:24,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:25,202 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-02-15 11:49:25,440 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-02-15 11:49:25,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:49:25,585 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-02-15 11:49:25,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:49:25,644 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-02-15 11:49:25,744 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-02-15 11:49:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:49:25,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:25,941 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-02-15 11:49:25,961 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-02-15 11:49:25,983 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-02-15 11:49:25,993 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-02-15 11:49:26,002 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-02-15 11:49:26,046 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-02-15 11:49:26,054 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-02-15 11:49:26,060 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-02-15 11:49:26,113 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:49:26,114 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-02-15 11:49:26,116 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-02-15 11:49:26,121 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-02-15 11:49:26,125 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-02-15 11:49:26,128 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-02-15 11:49:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-15 11:49:26,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657480716] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:26,494 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:26,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 22] total 54 [2022-02-15 11:49:26,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944348191] [2022-02-15 11:49:26,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:26,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-15 11:49:26,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:26,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-15 11:49:26,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1875, Unknown=8, NotChecked=760, Total=2862 [2022-02-15 11:49:26,496 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-02-15 11:49:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:28,502 INFO L93 Difference]: Finished difference Result 30299 states and 108654 transitions. [2022-02-15 11:49:28,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-15 11:49:28,502 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-02-15 11:49:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:28,592 INFO L225 Difference]: With dead ends: 30299 [2022-02-15 11:49:28,592 INFO L226 Difference]: Without dead ends: 30149 [2022-02-15 11:49:28,593 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-02-15 11:49:28,594 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-02-15 11:49:28,594 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-02-15 11:49:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30149 states. [2022-02-15 11:49:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30149 to 12580. [2022-02-15 11:49:28,993 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-02-15 11:49:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 45309 transitions. [2022-02-15 11:49:29,030 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 45309 transitions. Word has length 124 [2022-02-15 11:49:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:29,030 INFO L470 AbstractCegarLoop]: Abstraction has 12580 states and 45309 transitions. [2022-02-15 11:49:29,030 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-02-15 11:49:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 45309 transitions. [2022-02-15 11:49:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:49:29,056 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:29,056 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-02-15 11:49:29,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-15 11:49:29,271 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-02-15 11:49:29,271 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:49:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -732266808, now seen corresponding path program 2 times [2022-02-15 11:49:29,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:29,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734785306] [2022-02-15 11:49:29,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:29,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:49:30,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:30,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734785306] [2022-02-15 11:49:30,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734785306] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:30,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342383963] [2022-02-15 11:49:30,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 11:49:30,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:30,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:30,011 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-02-15 11:49:30,011 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-02-15 11:49:30,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:49:30,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:49:30,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 67 conjunts are in the unsatisfiable core [2022-02-15 11:49:30,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:30,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:49:30,856 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-02-15 11:49:30,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:49:30,941 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-02-15 11:49:31,185 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:49:31,185 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-02-15 11:49:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:31,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:31,935 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-02-15 11:49:32,012 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-02-15 11:49:32,063 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:49:32,063 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-02-15 11:49:32,068 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-02-15 11:49:32,072 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-02-15 11:49:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:32,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342383963] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:32,814 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:32,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 70 [2022-02-15 11:49:32,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122783574] [2022-02-15 11:49:32,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:32,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-02-15 11:49:32,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:32,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-02-15 11:49:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=4049, Unknown=2, NotChecked=266, Total=4830 [2022-02-15 11:49:32,816 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-02-15 11:50:11,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:50:11,054 INFO L93 Difference]: Finished difference Result 89801 states and 326321 transitions. [2022-02-15 11:50:11,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 473 states. [2022-02-15 11:50:11,054 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-02-15 11:50:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:50:11,470 INFO L225 Difference]: With dead ends: 89801 [2022-02-15 11:50:11,470 INFO L226 Difference]: Without dead ends: 89201 [2022-02-15 11:50:11,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 210 SyntacticMatches, 8 SemanticMatches, 521 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 118518 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=21399, Invalid=249527, Unknown=2, NotChecked=2078, Total=273006 [2022-02-15 11:50:11,481 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 4982 mSDsluCounter, 20796 mSDsCounter, 0 mSdLazyCounter, 18787 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s 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-02-15 11:50:11,481 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-02-15 11:50:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89201 states. [2022-02-15 11:50:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89201 to 12803. [2022-02-15 11:50:12,433 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-02-15 11:50:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12803 states to 12803 states and 46313 transitions. [2022-02-15 11:50:12,470 INFO L78 Accepts]: Start accepts. Automaton has 12803 states and 46313 transitions. Word has length 124 [2022-02-15 11:50:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:50:12,471 INFO L470 AbstractCegarLoop]: Abstraction has 12803 states and 46313 transitions. [2022-02-15 11:50:12,471 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-02-15 11:50:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 12803 states and 46313 transitions. [2022-02-15 11:50:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:50:12,498 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:50:12,498 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-02-15 11:50:12,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-15 11:50:12,698 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-02-15 11:50:12,699 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:50:12,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:50:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1913273718, now seen corresponding path program 3 times [2022-02-15 11:50:12,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:50:12,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096887348] [2022-02-15 11:50:12,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:50:12,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:50:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:50:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:50:13,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:50:13,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096887348] [2022-02-15 11:50:13,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096887348] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:50:13,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838828877] [2022-02-15 11:50:13,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 11:50:13,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:50:13,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:50:13,473 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-02-15 11:50:13,473 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-02-15 11:50:13,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-15 11:50:13,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:50:13,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 67 conjunts are in the unsatisfiable core [2022-02-15 11:50:13,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:50:14,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:50:14,374 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-02-15 11:50:14,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:50:14,463 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-02-15 11:50:14,614 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:50:14,615 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-02-15 11:50:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:50:15,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:50:15,451 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-02-15 11:50:15,523 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-02-15 11:50:15,576 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:50:15,577 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-02-15 11:50:15,584 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-02-15 11:50:15,592 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-02-15 11:50:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:50:16,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838828877] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:50:16,458 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:50:16,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 70 [2022-02-15 11:50:16,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368180125] [2022-02-15 11:50:16,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:50:16,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-02-15 11:50:16,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:50:16,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-02-15 11:50:16,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=4046, Unknown=2, NotChecked=266, Total=4830 [2022-02-15 11:50:16,459 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-02-15 11:50:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:50:47,797 INFO L93 Difference]: Finished difference Result 72952 states and 266277 transitions. [2022-02-15 11:50:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 431 states. [2022-02-15 11:50:47,798 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-02-15 11:50:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:50:48,058 INFO L225 Difference]: With dead ends: 72952 [2022-02-15 11:50:48,058 INFO L226 Difference]: Without dead ends: 72652 [2022-02-15 11:50:48,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 220 SyntacticMatches, 33 SemanticMatches, 477 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 101099 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=20521, Invalid=206537, Unknown=2, NotChecked=1902, Total=228962 [2022-02-15 11:50:48,067 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.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:50:48,067 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.4s Time] [2022-02-15 11:50:48,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72652 states. [2022-02-15 11:50:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72652 to 13141. [2022-02-15 11:50:48,895 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-02-15 11:50:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13141 states to 13141 states and 47721 transitions. [2022-02-15 11:50:48,932 INFO L78 Accepts]: Start accepts. Automaton has 13141 states and 47721 transitions. Word has length 124 [2022-02-15 11:50:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:50:48,932 INFO L470 AbstractCegarLoop]: Abstraction has 13141 states and 47721 transitions. [2022-02-15 11:50:48,932 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-02-15 11:50:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 13141 states and 47721 transitions. [2022-02-15 11:50:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:50:48,959 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:50:48,959 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-02-15 11:50:49,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-02-15 11:50:49,312 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-02-15 11:50:49,312 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:50:49,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:50:49,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1254294472, now seen corresponding path program 4 times [2022-02-15 11:50:49,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:50:49,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953415272] [2022-02-15 11:50:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:50:49,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:50:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:50:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:50:49,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:50:49,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953415272] [2022-02-15 11:50:49,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953415272] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:50:49,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413073682] [2022-02-15 11:50:49,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-15 11:50:49,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:50:49,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:50:49,996 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-02-15 11:50:49,996 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-02-15 11:50:50,083 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-15 11:50:50,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:50:50,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-15 11:50:50,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:50:50,700 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-02-15 11:50:51,178 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-02-15 11:50:51,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:50:51,403 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-02-15 11:50:51,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:50:51,490 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-02-15 11:50:51,635 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:50:51,635 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-02-15 11:50:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:50:51,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:50:52,298 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-02-15 11:50:52,370 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-02-15 11:50:52,427 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-02-15 11:50:52,449 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-02-15 11:50:52,473 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-02-15 11:50:52,635 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-02-15 11:50:52,660 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-02-15 11:50:52,674 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-02-15 11:50:52,916 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:50:52,916 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-02-15 11:50:52,923 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:50:52,924 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-02-15 11:50:52,927 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-02-15 11:50:52,931 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-02-15 11:50:52,989 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:50:52,989 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-02-15 11:50:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-15 11:50:54,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413073682] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:50:54,074 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:50:54,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 85 [2022-02-15 11:50:54,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144065196] [2022-02-15 11:50:54,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:50:54,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-02-15 11:50:54,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:50:54,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-02-15 11:50:54,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=5417, Unknown=11, NotChecked=1256, Total=7140 [2022-02-15 11:50:54,075 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-02-15 11:51:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:51:04,306 INFO L93 Difference]: Finished difference Result 35886 states and 129652 transitions. [2022-02-15 11:51:04,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-02-15 11:51:04,307 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-02-15 11:51:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:51:04,420 INFO L225 Difference]: With dead ends: 35886 [2022-02-15 11:51:04,421 INFO L226 Difference]: Without dead ends: 35736 [2022-02-15 11:51:04,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 146 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 6265 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1665, Invalid=17816, Unknown=11, NotChecked=2264, Total=21756 [2022-02-15 11:51:04,423 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-02-15 11:51:04,423 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-02-15 11:51:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35736 states. [2022-02-15 11:51:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35736 to 13355. [2022-02-15 11:51:04,942 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-02-15 11:51:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13355 states to 13355 states and 48542 transitions. [2022-02-15 11:51:04,982 INFO L78 Accepts]: Start accepts. Automaton has 13355 states and 48542 transitions. Word has length 124 [2022-02-15 11:51:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:51:04,982 INFO L470 AbstractCegarLoop]: Abstraction has 13355 states and 48542 transitions. [2022-02-15 11:51:04,982 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-02-15 11:51:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 13355 states and 48542 transitions. [2022-02-15 11:51:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:51:05,010 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:51:05,010 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-02-15 11:51:05,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-15 11:51:05,211 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-02-15 11:51:05,211 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:51:05,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:51:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2051171398, now seen corresponding path program 5 times [2022-02-15 11:51:05,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:51:05,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531051603] [2022-02-15 11:51:05,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:51:05,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:51:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:51:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:51:06,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:51:06,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531051603] [2022-02-15 11:51:06,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531051603] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:51:06,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311786] [2022-02-15 11:51:06,022 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-15 11:51:06,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:51:06,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:51:06,023 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-02-15 11:51:06,024 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-02-15 11:51:06,115 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-15 11:51:06,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:51:06,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 83 conjunts are in the unsatisfiable core [2022-02-15 11:51:06,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:51:06,157 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-02-15 11:51:06,188 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-15 11:51:06,189 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-02-15 11:51:06,238 INFO L353 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-02-15 11:51:06,238 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-02-15 11:51:06,740 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-02-15 11:51:06,741 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-02-15 11:51:06,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, 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-02-15 11:51:07,380 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-02-15 11:51:07,667 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-02-15 11:51:07,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:51:07,767 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-02-15 11:51:07,920 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:51:07,920 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-02-15 11:51:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:51:08,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:51:08,655 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-02-15 11:51:08,710 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-02-15 11:51:08,760 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-02-15 11:51:08,775 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-02-15 11:51:08,789 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-02-15 11:51:08,817 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-02-15 11:51:08,956 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-02-15 11:51:08,989 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-02-15 11:51:09,006 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-02-15 11:51:09,290 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:51:09,290 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-02-15 11:51:09,298 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:51:09,299 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-02-15 11:51:09,306 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-02-15 11:51:09,313 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-02-15 11:51:09,326 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:51:09,326 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-02-15 11:51:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-15 11:51:14,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311786] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:51:14,597 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:51:14,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 34] total 85 [2022-02-15 11:51:14,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348107324] [2022-02-15 11:51:14,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:51:14,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-02-15 11:51:14,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:51:14,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-02-15 11:51:14,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=5300, Unknown=11, NotChecked=1404, Total=7140 [2022-02-15 11:51:14,599 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-02-15 11:51:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:51:22,008 INFO L93 Difference]: Finished difference Result 23721 states and 85469 transitions. [2022-02-15 11:51:22,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-15 11:51:22,009 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-02-15 11:51:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:51:22,078 INFO L225 Difference]: With dead ends: 23721 [2022-02-15 11:51:22,079 INFO L226 Difference]: Without dead ends: 23571 [2022-02-15 11:51:22,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 9 SemanticMatches, 121 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 3779 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1212, Invalid=11695, Unknown=11, NotChecked=2088, Total=15006 [2022-02-15 11:51:22,080 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1355 mSDsluCounter, 8168 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:51:22,081 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.1s Time] [2022-02-15 11:51:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23571 states. [2022-02-15 11:51:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23571 to 13311. [2022-02-15 11:51:22,415 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-02-15 11:51:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13311 states to 13311 states and 48345 transitions. [2022-02-15 11:51:22,454 INFO L78 Accepts]: Start accepts. Automaton has 13311 states and 48345 transitions. Word has length 124 [2022-02-15 11:51:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:51:22,455 INFO L470 AbstractCegarLoop]: Abstraction has 13311 states and 48345 transitions. [2022-02-15 11:51:22,455 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-02-15 11:51:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 13311 states and 48345 transitions. [2022-02-15 11:51:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:51:22,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:51:22,482 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-02-15 11:51:22,498 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-02-15 11:51:22,683 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-02-15 11:51:22,683 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:51:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:51:22,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1783840602, now seen corresponding path program 6 times [2022-02-15 11:51:22,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:51:22,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942815654] [2022-02-15 11:51:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:51:22,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:51:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:51:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:51:23,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:51:23,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942815654] [2022-02-15 11:51:23,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942815654] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:51:23,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271546357] [2022-02-15 11:51:23,413 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-15 11:51:23,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:51:23,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:51:23,414 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-02-15 11:51:23,415 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-02-15 11:51:23,508 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-15 11:51:23,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:51:23,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-15 11:51:23,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:51:23,561 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-02-15 11:51:23,761 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:51:23,761 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-02-15 11:51:24,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:51:24,245 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-02-15 11:51:24,319 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-02-15 11:51:24,454 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:51:24,454 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-02-15 11:51:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:51:24,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:51:25,239 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-02-15 11:51:25,295 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-02-15 11:51:25,344 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:51:25,344 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-02-15 11:51:25,347 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-02-15 11:51:25,351 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-02-15 11:51:26,457 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-02-15 11:51:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:51:26,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271546357] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:51:26,517 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:51:26,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-02-15 11:51:26,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643421369] [2022-02-15 11:51:26,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:51:26,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-02-15 11:51:26,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:51:26,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-02-15 11:51:26,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=4287, Unknown=2, NotChecked=270, Total=4970 [2022-02-15 11:51:26,518 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-02-15 11:51:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:51:43,702 INFO L93 Difference]: Finished difference Result 46956 states and 170767 transitions. [2022-02-15 11:51:43,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2022-02-15 11:51:43,703 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-02-15 11:51:43,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:51:43,858 INFO L225 Difference]: With dead ends: 46956 [2022-02-15 11:51:43,858 INFO L226 Difference]: Without dead ends: 46521 [2022-02-15 11:51:43,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 213 SyntacticMatches, 24 SemanticMatches, 249 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 22581 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=7433, Invalid=54325, Unknown=2, NotChecked=990, Total=62750 [2022-02-15 11:51:43,863 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 2911 mSDsluCounter, 17291 mSDsCounter, 0 mSdLazyCounter, 6481 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 2.9s IncrementalHoareTripleChecker+Time [2022-02-15 11:51:43,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2911 Valid, 16356 Invalid, 18788 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [133 Valid, 6481 Invalid, 0 Unknown, 12174 Unchecked, 2.9s Time] [2022-02-15 11:51:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46521 states. [2022-02-15 11:51:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46521 to 13892. [2022-02-15 11:51:44,453 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-02-15 11:51:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13892 states to 13892 states and 50756 transitions. [2022-02-15 11:51:44,492 INFO L78 Accepts]: Start accepts. Automaton has 13892 states and 50756 transitions. Word has length 124 [2022-02-15 11:51:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:51:44,492 INFO L470 AbstractCegarLoop]: Abstraction has 13892 states and 50756 transitions. [2022-02-15 11:51:44,493 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-02-15 11:51:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 13892 states and 50756 transitions. [2022-02-15 11:51:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:51:44,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:51:44,521 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-02-15 11:51:44,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-02-15 11:51:44,721 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-02-15 11:51:44,722 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:51:44,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:51:44,722 INFO L85 PathProgramCache]: Analyzing trace with hash -369162054, now seen corresponding path program 7 times [2022-02-15 11:51:44,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:51:44,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546538896] [2022-02-15 11:51:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:51:44,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:51:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:51:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:51:45,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:51:45,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546538896] [2022-02-15 11:51:45,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546538896] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:51:45,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954958481] [2022-02-15 11:51:45,462 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-15 11:51:45,462 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:51:45,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:51:45,463 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-02-15 11:51:45,464 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-02-15 11:51:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:51:45,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 77 conjunts are in the unsatisfiable core [2022-02-15 11:51:45,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:51:46,234 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-02-15 11:51:46,734 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-02-15 11:51:46,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:51:46,980 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-02-15 11:51:47,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:51:47,080 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-02-15 11:51:47,232 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:51:47,233 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-02-15 11:51:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:51:47,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:51:48,035 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-02-15 11:51:48,107 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-02-15 11:51:48,183 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-02-15 11:51:48,208 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-02-15 11:51:48,237 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-02-15 11:51:48,365 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-02-15 11:51:48,401 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-02-15 11:51:48,419 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-02-15 11:51:48,690 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:51:48,690 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-02-15 11:51:48,700 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:51:48,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 410 treesize of output 374 [2022-02-15 11:51:48,705 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-02-15 11:51:48,710 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-02-15 11:51:48,720 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:51:48,720 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-02-15 11:51:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-15 11:51:50,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954958481] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:51:50,559 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:51:50,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 84 [2022-02-15 11:51:50,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782499995] [2022-02-15 11:51:50,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:51:50,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-02-15 11:51:50,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:51:50,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-02-15 11:51:50,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=5244, Unknown=10, NotChecked=1240, Total=6972 [2022-02-15 11:51:50,560 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-02-15 11:51:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:51:56,264 INFO L93 Difference]: Finished difference Result 32580 states and 118215 transitions. [2022-02-15 11:51:56,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-02-15 11:51:56,265 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-02-15 11:51:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:51:56,367 INFO L225 Difference]: With dead ends: 32580 [2022-02-15 11:51:56,368 INFO L226 Difference]: Without dead ends: 32430 [2022-02-15 11:51:56,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 136 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 5413 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1476, Invalid=15316, Unknown=10, NotChecked=2104, Total=18906 [2022-02-15 11:51:56,370 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 1804 mSDsluCounter, 9411 mSDsCounter, 0 mSdLazyCounter, 4238 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2022-02-15 11:51:56,370 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.7s Time] [2022-02-15 11:51:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32430 states. [2022-02-15 11:51:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32430 to 13886. [2022-02-15 11:51:56,865 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-02-15 11:51:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13886 states to 13886 states and 50685 transitions. [2022-02-15 11:51:56,905 INFO L78 Accepts]: Start accepts. Automaton has 13886 states and 50685 transitions. Word has length 124 [2022-02-15 11:51:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:51:56,905 INFO L470 AbstractCegarLoop]: Abstraction has 13886 states and 50685 transitions. [2022-02-15 11:51:56,905 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-02-15 11:51:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 13886 states and 50685 transitions. [2022-02-15 11:51:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:51:56,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:51:56,934 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-02-15 11:51:56,950 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-02-15 11:51:57,135 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-02-15 11:51:57,135 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:51:57,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:51:57,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1457504890, now seen corresponding path program 8 times [2022-02-15 11:51:57,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:51:57,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161766153] [2022-02-15 11:51:57,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:51:57,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:51:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:51:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:51:57,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:51:57,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161766153] [2022-02-15 11:51:57,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161766153] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:51:57,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607943685] [2022-02-15 11:51:57,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 11:51:57,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:51:57,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:51:57,891 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-02-15 11:51:57,895 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-02-15 11:51:57,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:51:57,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:51:57,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 73 conjunts are in the unsatisfiable core [2022-02-15 11:51:57,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:51:58,030 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-02-15 11:51:58,061 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-15 11:51:58,061 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-02-15 11:51:58,254 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-15 11:51:58,255 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-02-15 11:51:58,750 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-02-15 11:51:58,821 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-02-15 11:51:58,951 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:51:58,951 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-02-15 11:51:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:51:59,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:51:59,753 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-02-15 11:51:59,813 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-02-15 11:51:59,867 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:51:59,867 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-02-15 11:51:59,882 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-02-15 11:51:59,887 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-02-15 11:52:00,909 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-02-15 11:52:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:52:00,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607943685] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:52:00,931 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:52:00,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-02-15 11:52:00,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482330301] [2022-02-15 11:52:00,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:52:00,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-02-15 11:52:00,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:52:00,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-02-15 11:52:00,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=4257, Unknown=2, NotChecked=270, Total=4970 [2022-02-15 11:52:00,933 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-02-15 11:52:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:52:19,299 INFO L93 Difference]: Finished difference Result 45671 states and 167359 transitions. [2022-02-15 11:52:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2022-02-15 11:52:19,299 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-02-15 11:52:19,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:52:19,452 INFO L225 Difference]: With dead ends: 45671 [2022-02-15 11:52:19,452 INFO L226 Difference]: Without dead ends: 45371 [2022-02-15 11:52:19,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 220 SyntacticMatches, 15 SemanticMatches, 275 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 28816 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=10241, Invalid=65115, Unknown=2, NotChecked=1094, Total=76452 [2022-02-15 11:52:19,456 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 2925 mSDsluCounter, 13205 mSDsCounter, 0 mSdLazyCounter, 5462 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.6s IncrementalHoareTripleChecker+Time [2022-02-15 11:52:19,456 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.6s Time] [2022-02-15 11:52:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45371 states. [2022-02-15 11:52:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45371 to 14264. [2022-02-15 11:52:20,045 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-02-15 11:52:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14264 states to 14264 states and 52076 transitions. [2022-02-15 11:52:20,085 INFO L78 Accepts]: Start accepts. Automaton has 14264 states and 52076 transitions. Word has length 124 [2022-02-15 11:52:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:52:20,086 INFO L470 AbstractCegarLoop]: Abstraction has 14264 states and 52076 transitions. [2022-02-15 11:52:20,086 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-02-15 11:52:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 14264 states and 52076 transitions. [2022-02-15 11:52:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:52:20,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:52:20,113 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-02-15 11:52:20,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-02-15 11:52:20,313 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-02-15 11:52:20,313 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:52:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:52:20,314 INFO L85 PathProgramCache]: Analyzing trace with hash -89866212, now seen corresponding path program 9 times [2022-02-15 11:52:20,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:52:20,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777622429] [2022-02-15 11:52:20,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:52:20,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:52:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:52:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:52:21,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:52:21,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777622429] [2022-02-15 11:52:21,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777622429] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:52:21,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429965329] [2022-02-15 11:52:21,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 11:52:21,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:52:21,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:52:21,075 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-02-15 11:52:21,076 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-02-15 11:52:21,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-15 11:52:21,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:52:21,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-15 11:52:21,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:52:21,240 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-02-15 11:52:21,279 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-15 11:52:21,280 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-02-15 11:52:21,537 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-15 11:52:21,538 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-02-15 11:52:21,701 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-02-15 11:52:21,961 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-02-15 11:52:22,166 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-02-15 11:52:22,239 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-02-15 11:52:22,378 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:52:22,379 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-02-15 11:52:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:52:22,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:52:23,178 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-02-15 11:52:23,240 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-02-15 11:52:23,292 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-02-15 11:52:23,306 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-02-15 11:52:23,319 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-02-15 11:52:23,343 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-02-15 11:52:23,459 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-02-15 11:52:23,484 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-02-15 11:52:23,498 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-02-15 11:52:23,571 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:52:23,572 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-02-15 11:52:23,580 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-15 11:52:23,581 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-02-15 11:52:23,591 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-02-15 11:52:23,598 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-02-15 11:52:23,612 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-15 11:52:23,612 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-02-15 11:52:27,406 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-02-15 11:52:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-15 11:52:27,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429965329] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:52:27,428 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:52:27,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 28] total 75 [2022-02-15 11:52:27,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255108721] [2022-02-15 11:52:27,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:52:27,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-02-15 11:52:27,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:52:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-02-15 11:52:27,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3909, Unknown=9, NotChecked=1224, Total=5550 [2022-02-15 11:52:27,429 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-02-15 11:52:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:52:46,497 INFO L93 Difference]: Finished difference Result 40970 states and 149500 transitions. [2022-02-15 11:52:46,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-02-15 11:52:46,498 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-02-15 11:52:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:52:46,624 INFO L225 Difference]: With dead ends: 40970 [2022-02-15 11:52:46,624 INFO L226 Difference]: Without dead ends: 40670 [2022-02-15 11:52:46,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 228 SyntacticMatches, 15 SemanticMatches, 259 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 23295 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=7904, Invalid=55375, Unknown=9, NotChecked=4572, Total=67860 [2022-02-15 11:52:46,628 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 3010 mSDsluCounter, 11920 mSDsCounter, 0 mSdLazyCounter, 5288 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.6s IncrementalHoareTripleChecker+Time [2022-02-15 11:52:46,628 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.6s Time] [2022-02-15 11:52:46,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40670 states. [2022-02-15 11:52:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40670 to 14094. [2022-02-15 11:52:47,097 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-02-15 11:52:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14094 states to 14094 states and 51368 transitions. [2022-02-15 11:52:47,138 INFO L78 Accepts]: Start accepts. Automaton has 14094 states and 51368 transitions. Word has length 124 [2022-02-15 11:52:47,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:52:47,138 INFO L470 AbstractCegarLoop]: Abstraction has 14094 states and 51368 transitions. [2022-02-15 11:52:47,138 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-02-15 11:52:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 14094 states and 51368 transitions. [2022-02-15 11:52:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:52:47,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:52:47,166 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-02-15 11:52:47,183 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-02-15 11:52:47,366 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-02-15 11:52:47,366 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:52:47,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:52:47,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1002033640, now seen corresponding path program 10 times [2022-02-15 11:52:47,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:52:47,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308967382] [2022-02-15 11:52:47,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:52:47,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:52:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:52:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:52:48,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:52:48,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308967382] [2022-02-15 11:52:48,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308967382] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:52:48,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696303432] [2022-02-15 11:52:48,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-15 11:52:48,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:52:48,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:52:48,137 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-02-15 11:52:48,137 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-02-15 11:52:48,232 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-15 11:52:48,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:52:48,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-15 11:52:48,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:52:48,858 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-02-15 11:52:49,329 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-02-15 11:52:49,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:52:49,544 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-02-15 11:52:49,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:52:49,633 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-02-15 11:52:49,780 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:52:49,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 27 treesize of output 27 [2022-02-15 11:52:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:52:50,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:52:50,392 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-02-15 11:52:50,447 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-02-15 11:52:50,509 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-02-15 11:52:50,538 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-02-15 11:52:50,567 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-02-15 11:52:50,688 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-02-15 11:52:50,712 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-02-15 11:52:50,726 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-02-15 11:52:50,992 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:52:50,993 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-02-15 11:52:51,001 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:52:51,003 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-02-15 11:52:51,013 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-02-15 11:52:51,019 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-02-15 11:52:51,031 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:52:51,032 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-02-15 11:52:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-15 11:52:58,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696303432] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:52:58,353 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:52:58,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 85 [2022-02-15 11:52:58,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027929105] [2022-02-15 11:52:58,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:52:58,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-02-15 11:52:58,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:52:58,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-02-15 11:52:58,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=5341, Unknown=11, NotChecked=1256, Total=7140 [2022-02-15 11:52:58,354 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-02-15 11:53:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:53:11,984 INFO L93 Difference]: Finished difference Result 29759 states and 107876 transitions. [2022-02-15 11:53:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-02-15 11:53:11,984 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-02-15 11:53:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:53:12,083 INFO L225 Difference]: With dead ends: 29759 [2022-02-15 11:53:12,084 INFO L226 Difference]: Without dead ends: 29609 [2022-02-15 11:53:12,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 199 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 4914 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1504, Invalid=13769, Unknown=11, NotChecked=2008, Total=17292 [2022-02-15 11:53:12,085 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.5s IncrementalHoareTripleChecker+Time [2022-02-15 11:53:12,085 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.5s Time] [2022-02-15 11:53:12,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2022-02-15 11:53:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 14606. [2022-02-15 11:53:12,456 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-02-15 11:53:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14606 states to 14606 states and 53544 transitions. [2022-02-15 11:53:12,497 INFO L78 Accepts]: Start accepts. Automaton has 14606 states and 53544 transitions. Word has length 124 [2022-02-15 11:53:12,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:53:12,498 INFO L470 AbstractCegarLoop]: Abstraction has 14606 states and 53544 transitions. [2022-02-15 11:53:12,498 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-02-15 11:53:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 14606 states and 53544 transitions. [2022-02-15 11:53:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:53:12,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:53:12,527 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-02-15 11:53:12,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-02-15 11:53:12,727 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-02-15 11:53:12,728 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:53:12,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:53:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash 727737786, now seen corresponding path program 11 times [2022-02-15 11:53:12,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:53:12,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211050948] [2022-02-15 11:53:12,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:53:12,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:53:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:53:13,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:53:13,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211050948] [2022-02-15 11:53:13,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211050948] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:53:13,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259231074] [2022-02-15 11:53:13,447 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-15 11:53:13,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:13,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:53:13,448 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-02-15 11:53:13,448 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-02-15 11:53:13,548 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:53:13,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:53:13,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 84 conjunts are in the unsatisfiable core [2022-02-15 11:53:13,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:53:14,196 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-02-15 11:53:14,713 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-02-15 11:53:15,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:53:15,003 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-02-15 11:53:15,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:53:15,120 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-02-15 11:53:15,297 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:53:15,297 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-02-15 11:53:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:53:15,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:53:16,021 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-02-15 11:53:16,078 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-02-15 11:53:16,134 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-02-15 11:53:16,149 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-02-15 11:53:16,164 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-02-15 11:53:16,194 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-02-15 11:53:16,339 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-02-15 11:53:16,372 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-02-15 11:53:16,392 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-02-15 11:53:16,722 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:53:16,722 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-02-15 11:53:16,730 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:53:16,730 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-02-15 11:53:16,737 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-02-15 11:53:16,744 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-02-15 11:53:16,756 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:53:16,756 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-02-15 11:53:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-15 11:53:18,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259231074] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:53:18,060 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:53:18,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 84 [2022-02-15 11:53:18,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061260328] [2022-02-15 11:53:18,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:53:18,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-02-15 11:53:18,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:53:18,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-02-15 11:53:18,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=5056, Unknown=11, NotChecked=1386, Total=6972 [2022-02-15 11:53:18,062 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-02-15 11:53:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:53:26,640 INFO L93 Difference]: Finished difference Result 34843 states and 126620 transitions. [2022-02-15 11:53:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-02-15 11:53:26,641 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-02-15 11:53:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:53:26,746 INFO L225 Difference]: With dead ends: 34843 [2022-02-15 11:53:26,746 INFO L226 Difference]: Without dead ends: 34693 [2022-02-15 11:53:26,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 197 SyntacticMatches, 6 SemanticMatches, 136 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 5269 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1574, Invalid=14963, Unknown=11, NotChecked=2358, Total=18906 [2022-02-15 11:53:26,748 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 1979 mSDsluCounter, 8524 mSDsCounter, 0 mSdLazyCounter, 4307 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1979 SdHoareTripleChecker+Valid, 8159 SdHoareTripleChecker+Invalid, 8240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 4307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3801 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 11:53:26,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1979 Valid, 8159 Invalid, 8240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 4307 Invalid, 0 Unknown, 3801 Unchecked, 1.8s Time] [2022-02-15 11:53:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34693 states. [2022-02-15 11:53:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34693 to 14314. [2022-02-15 11:53:27,161 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-02-15 11:53:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 52217 transitions. [2022-02-15 11:53:27,200 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 52217 transitions. Word has length 124 [2022-02-15 11:53:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:53:27,201 INFO L470 AbstractCegarLoop]: Abstraction has 14314 states and 52217 transitions. [2022-02-15 11:53:27,201 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-02-15 11:53:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 52217 transitions. [2022-02-15 11:53:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:53:27,227 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:53:27,228 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-02-15 11:53:27,244 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-02-15 11:53:27,428 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-02-15 11:53:27,428 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:53:27,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:53:27,429 INFO L85 PathProgramCache]: Analyzing trace with hash 929729368, now seen corresponding path program 12 times [2022-02-15 11:53:27,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:53:27,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950008519] [2022-02-15 11:53:27,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:53:27,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:53:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:53:28,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:53:28,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950008519] [2022-02-15 11:53:28,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950008519] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:53:28,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044801031] [2022-02-15 11:53:28,185 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-15 11:53:28,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:28,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:53:28,186 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-02-15 11:53:28,187 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-02-15 11:53:28,284 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-02-15 11:53:28,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:53:28,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-15 11:53:28,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:53:28,328 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-02-15 11:53:28,361 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-15 11:53:28,361 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-02-15 11:53:28,552 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-15 11:53:28,552 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-02-15 11:53:29,004 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-02-15 11:53:29,077 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-02-15 11:53:29,342 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:53:29,344 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-02-15 11:53:29,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:53:29,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:53:29,921 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-02-15 11:53:29,976 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-02-15 11:53:30,022 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:53:30,022 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-02-15 11:53:30,029 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-02-15 11:53:30,032 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-02-15 11:53:30,948 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-02-15 11:53:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:53:30,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044801031] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:53:30,968 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:53:30,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 68 [2022-02-15 11:53:30,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611816907] [2022-02-15 11:53:30,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:53:30,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-02-15 11:53:30,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:53:30,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-02-15 11:53:30,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=3889, Unknown=2, NotChecked=258, Total=4556 [2022-02-15 11:53:30,970 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-02-15 11:53:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:53:39,810 INFO L93 Difference]: Finished difference Result 34356 states and 125418 transitions. [2022-02-15 11:53:39,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-15 11:53:39,810 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-02-15 11:53:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:53:39,910 INFO L225 Difference]: With dead ends: 34356 [2022-02-15 11:53:39,910 INFO L226 Difference]: Without dead ends: 34347 [2022-02-15 11:53:39,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 221 SyntacticMatches, 12 SemanticMatches, 159 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 7929 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3779, Invalid=21349, Unknown=2, NotChecked=630, Total=25760 [2022-02-15 11:53:39,913 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 2572 mSDsluCounter, 9887 mSDsCounter, 0 mSdLazyCounter, 4111 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-02-15 11:53:39,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2572 Valid, 9666 Invalid, 8060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4111 Invalid, 0 Unknown, 3890 Unchecked, 1.9s Time] [2022-02-15 11:53:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34347 states. [2022-02-15 11:53:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34347 to 15582. [2022-02-15 11:53:40,443 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-02-15 11:53:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15582 states to 15582 states and 57063 transitions. [2022-02-15 11:53:40,488 INFO L78 Accepts]: Start accepts. Automaton has 15582 states and 57063 transitions. Word has length 124 [2022-02-15 11:53:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:53:40,488 INFO L470 AbstractCegarLoop]: Abstraction has 15582 states and 57063 transitions. [2022-02-15 11:53:40,488 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-02-15 11:53:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 15582 states and 57063 transitions. [2022-02-15 11:53:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:53:40,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:53:40,519 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-02-15 11:53:40,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-02-15 11:53:40,719 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-02-15 11:53:40,719 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:53:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:53:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1843297594, now seen corresponding path program 13 times [2022-02-15 11:53:40,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:53:40,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486489094] [2022-02-15 11:53:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:53:40,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:53:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:53:41,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:53:41,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486489094] [2022-02-15 11:53:41,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486489094] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:53:41,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165979695] [2022-02-15 11:53:41,465 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-15 11:53:41,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:41,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:53:41,466 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-02-15 11:53:41,466 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-02-15 11:53:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:41,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 84 conjunts are in the unsatisfiable core [2022-02-15 11:53:41,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:53:41,627 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-02-15 11:53:41,664 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-15 11:53:41,664 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-02-15 11:53:42,009 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-15 11:53:42,009 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-02-15 11:53:42,223 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-02-15 11:53:42,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, 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-02-15 11:53:42,928 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-02-15 11:53:43,024 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-02-15 11:53:43,212 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:53:43,213 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-02-15 11:53:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:53:43,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:53:43,866 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-02-15 11:53:43,923 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-02-15 11:53:43,976 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-02-15 11:53:44,001 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-02-15 11:53:44,026 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-02-15 11:53:44,154 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-02-15 11:53:44,184 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-02-15 11:53:44,201 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-02-15 11:53:44,437 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:53:44,438 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-02-15 11:53:44,447 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:53:44,447 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-02-15 11:53:44,458 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-02-15 11:53:44,469 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-02-15 11:53:44,488 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:53:44,490 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-02-15 11:54:09,611 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-02-15 11:54:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-15 11:54:09,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165979695] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:54:09,632 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:54:09,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 81 [2022-02-15 11:54:09,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703947172] [2022-02-15 11:54:09,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:54:09,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-02-15 11:54:09,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:54:09,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-02-15 11:54:09,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=4785, Unknown=11, NotChecked=1192, Total=6480 [2022-02-15 11:54:09,634 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-02-15 11:54:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:54:14,422 INFO L93 Difference]: Finished difference Result 32775 states and 118600 transitions. [2022-02-15 11:54:14,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-15 11:54:14,422 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-02-15 11:54:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:54:14,520 INFO L225 Difference]: With dead ends: 32775 [2022-02-15 11:54:14,521 INFO L226 Difference]: Without dead ends: 32475 [2022-02-15 11:54:14,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 205 SyntacticMatches, 8 SemanticMatches, 127 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 4676 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1459, Invalid=13082, Unknown=11, NotChecked=1960, Total=16512 [2022-02-15 11:54:14,522 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 1584 mSDsluCounter, 9207 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-02-15 11:54:14,523 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.2s Time] [2022-02-15 11:54:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32475 states. [2022-02-15 11:54:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32475 to 15001. [2022-02-15 11:54:14,935 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-02-15 11:54:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15001 states to 15001 states and 54711 transitions. [2022-02-15 11:54:14,979 INFO L78 Accepts]: Start accepts. Automaton has 15001 states and 54711 transitions. Word has length 124 [2022-02-15 11:54:14,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:54:14,979 INFO L470 AbstractCegarLoop]: Abstraction has 15001 states and 54711 transitions. [2022-02-15 11:54:14,979 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-02-15 11:54:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 15001 states and 54711 transitions. [2022-02-15 11:54:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:54:15,009 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:54:15,009 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-02-15 11:54:15,028 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-02-15 11:54:15,209 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-02-15 11:54:15,210 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:54:15,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:54:15,210 INFO L85 PathProgramCache]: Analyzing trace with hash -673379146, now seen corresponding path program 14 times [2022-02-15 11:54:15,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:54:15,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896442654] [2022-02-15 11:54:15,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:54:15,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:54:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:54:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:54:15,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:54:15,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896442654] [2022-02-15 11:54:15,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896442654] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:54:15,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294584900] [2022-02-15 11:54:15,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 11:54:15,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:54:15,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:54:15,997 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-02-15 11:54:15,997 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-02-15 11:54:16,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:54:16,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:54:16,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-15 11:54:16,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:54:16,152 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-02-15 11:54:16,343 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:54:16,343 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-02-15 11:54:16,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:54:16,814 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-02-15 11:54:16,887 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-02-15 11:54:17,080 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:54:17,081 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-02-15 11:54:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:54:17,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:54:17,686 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-02-15 11:54:17,741 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-02-15 11:54:17,789 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:54:17,790 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-02-15 11:54:17,792 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-02-15 11:54:17,796 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-02-15 11:54:18,821 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-02-15 11:54:18,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-02-15 11:54:18,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294584900] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:54:18,878 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:54:18,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 67 [2022-02-15 11:54:18,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755670094] [2022-02-15 11:54:18,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:54:18,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-02-15 11:54:18,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:54:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-02-15 11:54:18,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=3772, Unknown=2, NotChecked=254, Total=4422 [2022-02-15 11:54:18,880 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-02-15 11:54:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:54:29,364 INFO L93 Difference]: Finished difference Result 33145 states and 121092 transitions. [2022-02-15 11:54:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-02-15 11:54:29,364 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-02-15 11:54:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:54:29,470 INFO L225 Difference]: With dead ends: 33145 [2022-02-15 11:54:29,470 INFO L226 Difference]: Without dead ends: 33130 [2022-02-15 11:54:29,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 213 SyntacticMatches, 16 SemanticMatches, 156 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 7416 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=3518, Invalid=20668, Unknown=2, NotChecked=618, Total=24806 [2022-02-15 11:54:29,471 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 2313 mSDsluCounter, 11725 mSDsCounter, 0 mSdLazyCounter, 5658 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:54:29,472 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.4s Time] [2022-02-15 11:54:29,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33130 states. [2022-02-15 11:54:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33130 to 14998. [2022-02-15 11:54:29,883 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-02-15 11:54:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14998 states to 14998 states and 54703 transitions. [2022-02-15 11:54:29,927 INFO L78 Accepts]: Start accepts. Automaton has 14998 states and 54703 transitions. Word has length 124 [2022-02-15 11:54:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:54:29,927 INFO L470 AbstractCegarLoop]: Abstraction has 14998 states and 54703 transitions. [2022-02-15 11:54:29,927 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-02-15 11:54:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 14998 states and 54703 transitions. [2022-02-15 11:54:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:54:29,957 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:54:29,957 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-02-15 11:54:29,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-02-15 11:54:30,157 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-02-15 11:54:30,157 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:54:30,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:54:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1592604130, now seen corresponding path program 15 times [2022-02-15 11:54:30,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:54:30,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100187713] [2022-02-15 11:54:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:54:30,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:54:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:54:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:54:30,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:54:30,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100187713] [2022-02-15 11:54:30,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100187713] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:54:30,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818357019] [2022-02-15 11:54:30,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 11:54:30,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:54:30,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:54:30,842 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-02-15 11:54:30,843 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-02-15 11:54:30,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-15 11:54:30,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:54:30,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 79 conjunts are in the unsatisfiable core [2022-02-15 11:54:30,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:54:31,038 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-02-15 11:54:31,297 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:54:31,297 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-02-15 11:54:31,468 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-02-15 11:54:31,787 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-02-15 11:54:32,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:54:32,042 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-02-15 11:54:32,138 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-02-15 11:54:32,380 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:54:32,380 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-02-15 11:54:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:54:32,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:54:33,012 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-02-15 11:54:33,073 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-02-15 11:54:33,130 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-02-15 11:54:33,145 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-02-15 11:54:33,157 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-02-15 11:54:33,182 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-02-15 11:54:33,362 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-02-15 11:54:33,400 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-02-15 11:54:33,413 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-02-15 11:54:33,473 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:54:33,474 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-02-15 11:54:33,482 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-15 11:54:33,482 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-02-15 11:54:33,492 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-02-15 11:54:33,503 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-15 11:54:33,503 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-02-15 11:54:33,513 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-02-15 11:55:25,482 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-02-15 11:55:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-15 11:55:25,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818357019] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:55:25,539 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:55:25,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 28] total 73 [2022-02-15 11:55:25,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239231664] [2022-02-15 11:55:25,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:55:25,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-02-15 11:55:25,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:55:25,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-02-15 11:55:25,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=3647, Unknown=9, NotChecked=1188, Total=5256 [2022-02-15 11:55:25,540 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-02-15 11:55:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:55:34,646 INFO L93 Difference]: Finished difference Result 48904 states and 177911 transitions. [2022-02-15 11:55:34,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-02-15 11:55:34,647 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-02-15 11:55:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:55:34,797 INFO L225 Difference]: With dead ends: 48904 [2022-02-15 11:55:34,797 INFO L226 Difference]: Without dead ends: 48754 [2022-02-15 11:55:34,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 211 SyntacticMatches, 8 SemanticMatches, 186 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 12282 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=3025, Invalid=28864, Unknown=9, NotChecked=3258, Total=35156 [2022-02-15 11:55:34,800 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 2340 mSDsluCounter, 11278 mSDsCounter, 0 mSdLazyCounter, 7571 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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.2s IncrementalHoareTripleChecker+Time [2022-02-15 11:55:34,800 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.2s Time] [2022-02-15 11:55:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48754 states. [2022-02-15 11:55:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48754 to 13945. [2022-02-15 11:55:35,393 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-02-15 11:55:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13945 states to 13945 states and 50756 transitions. [2022-02-15 11:55:35,432 INFO L78 Accepts]: Start accepts. Automaton has 13945 states and 50756 transitions. Word has length 124 [2022-02-15 11:55:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:55:35,432 INFO L470 AbstractCegarLoop]: Abstraction has 13945 states and 50756 transitions. [2022-02-15 11:55:35,432 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-02-15 11:55:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 13945 states and 50756 transitions. [2022-02-15 11:55:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:55:35,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:55:35,458 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-02-15 11:55:35,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-02-15 11:55:35,659 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-02-15 11:55:35,659 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:55:35,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:55:35,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1814647960, now seen corresponding path program 5 times [2022-02-15 11:55:35,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:55:35,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425720047] [2022-02-15 11:55:35,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:55:35,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:55:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:55:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:35,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:55:35,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425720047] [2022-02-15 11:55:35,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425720047] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:55:35,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974969239] [2022-02-15 11:55:35,903 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-15 11:55:35,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:55:35,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:55:35,905 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-02-15 11:55:35,905 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-02-15 11:55:36,008 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:55:36,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:55:36,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 69 conjunts are in the unsatisfiable core [2022-02-15 11:55:36,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:55:36,442 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-02-15 11:55:36,722 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-02-15 11:55:36,853 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-02-15 11:55:36,933 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-02-15 11:55:37,057 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-02-15 11:55:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:55:37,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:55:37,250 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-02-15 11:55:37,267 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-02-15 11:55:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-02-15 11:55:37,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974969239] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:55:37,380 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:55:37,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 13] total 39 [2022-02-15 11:55:37,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631457386] [2022-02-15 11:55:37,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:55:37,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-15 11:55:37,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:55:37,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-15 11:55:37,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1161, Unknown=2, NotChecked=142, Total=1482 [2022-02-15 11:55:37,381 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-02-15 11:55:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:55:38,990 INFO L93 Difference]: Finished difference Result 25805 states and 94321 transitions. [2022-02-15 11:55:38,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-15 11:55:38,990 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-02-15 11:55:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:55:39,066 INFO L225 Difference]: With dead ends: 25805 [2022-02-15 11:55:39,066 INFO L226 Difference]: Without dead ends: 25655 [2022-02-15 11:55:39,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 227 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=576, Invalid=3590, Unknown=2, NotChecked=254, Total=4422 [2022-02-15 11:55:39,067 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-02-15 11:55:39,067 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-02-15 11:55:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25655 states. [2022-02-15 11:55:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25655 to 14379. [2022-02-15 11:55:39,451 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-02-15 11:55:39,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14379 states to 14379 states and 52377 transitions. [2022-02-15 11:55:39,491 INFO L78 Accepts]: Start accepts. Automaton has 14379 states and 52377 transitions. Word has length 124 [2022-02-15 11:55:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:55:39,491 INFO L470 AbstractCegarLoop]: Abstraction has 14379 states and 52377 transitions. [2022-02-15 11:55:39,491 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-02-15 11:55:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 14379 states and 52377 transitions. [2022-02-15 11:55:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:55:39,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:55:39,518 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-02-15 11:55:39,537 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-02-15 11:55:39,718 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-02-15 11:55:39,719 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:55:39,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:55:39,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1340158932, now seen corresponding path program 6 times [2022-02-15 11:55:39,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:55:39,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912191177] [2022-02-15 11:55:39,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:55:39,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:55:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:55:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:39,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:55:39,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912191177] [2022-02-15 11:55:39,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912191177] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:55:39,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303150565] [2022-02-15 11:55:39,941 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-15 11:55:39,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:55:39,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:55:39,942 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-02-15 11:55:39,967 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-02-15 11:55:40,072 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-02-15 11:55:40,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:55:40,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-02-15 11:55:40,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:55:40,489 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-02-15 11:55:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:40,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:55:40,619 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:55:40,619 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-02-15 11:55:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:40,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303150565] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:55:40,794 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:55:40,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 24 [2022-02-15 11:55:40,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520231323] [2022-02-15 11:55:40,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:55:40,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-15 11:55:40,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:55:40,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-15 11:55:40,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-02-15 11:55:40,795 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-02-15 11:55:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:55:41,753 INFO L93 Difference]: Finished difference Result 34527 states and 125047 transitions. [2022-02-15 11:55:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-15 11:55:41,753 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-02-15 11:55:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:55:41,857 INFO L225 Difference]: With dead ends: 34527 [2022-02-15 11:55:41,857 INFO L226 Difference]: Without dead ends: 34377 [2022-02-15 11:55:41,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=402, Invalid=2354, Unknown=0, NotChecked=0, Total=2756 [2022-02-15 11:55:41,858 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.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:55:41,858 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.4s Time] [2022-02-15 11:55:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34377 states. [2022-02-15 11:55:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34377 to 14583. [2022-02-15 11:55:42,350 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-02-15 11:55:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14583 states to 14583 states and 53127 transitions. [2022-02-15 11:55:42,389 INFO L78 Accepts]: Start accepts. Automaton has 14583 states and 53127 transitions. Word has length 124 [2022-02-15 11:55:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:55:42,390 INFO L470 AbstractCegarLoop]: Abstraction has 14583 states and 53127 transitions. [2022-02-15 11:55:42,390 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-02-15 11:55:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 14583 states and 53127 transitions. [2022-02-15 11:55:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:55:42,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:55:42,417 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-02-15 11:55:42,433 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-02-15 11:55:42,617 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-02-15 11:55:42,617 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:55:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:55:42,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1904339992, now seen corresponding path program 7 times [2022-02-15 11:55:42,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:55:42,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208408195] [2022-02-15 11:55:42,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:55:42,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:55:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:55:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:42,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:55:42,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208408195] [2022-02-15 11:55:42,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208408195] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:55:42,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313076526] [2022-02-15 11:55:42,832 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-15 11:55:42,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:55:42,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:55:42,833 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-02-15 11:55:42,834 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-02-15 11:55:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:55:42,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-15 11:55:42,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:55:43,311 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-02-15 11:55:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:43,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:55:43,441 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:55:43,441 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-02-15 11:55:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:43,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313076526] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:55:43,617 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:55:43,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 11] total 26 [2022-02-15 11:55:43,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621579669] [2022-02-15 11:55:43,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:55:43,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-15 11:55:43,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:55:43,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-15 11:55:43,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-02-15 11:55:43,618 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-02-15 11:55:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:55:44,442 INFO L93 Difference]: Finished difference Result 30539 states and 110704 transitions. [2022-02-15 11:55:44,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-15 11:55:44,442 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-02-15 11:55:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:55:44,646 INFO L225 Difference]: With dead ends: 30539 [2022-02-15 11:55:44,647 INFO L226 Difference]: Without dead ends: 30389 [2022-02-15 11:55:44,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=349, Invalid=1907, Unknown=0, NotChecked=0, Total=2256 [2022-02-15 11:55:44,647 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 813 mSDsluCounter, 3306 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-02-15 11:55:44,647 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-02-15 11:55:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30389 states. [2022-02-15 11:55:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30389 to 14507. [2022-02-15 11:55:44,984 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-02-15 11:55:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14507 states to 14507 states and 52847 transitions. [2022-02-15 11:55:45,025 INFO L78 Accepts]: Start accepts. Automaton has 14507 states and 52847 transitions. Word has length 124 [2022-02-15 11:55:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:55:45,025 INFO L470 AbstractCegarLoop]: Abstraction has 14507 states and 52847 transitions. [2022-02-15 11:55:45,025 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-02-15 11:55:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 14507 states and 52847 transitions. [2022-02-15 11:55:45,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:55:45,053 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:55:45,053 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-02-15 11:55:45,069 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-02-15 11:55:45,253 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-02-15 11:55:45,253 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:55:45,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:55:45,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1045504418, now seen corresponding path program 8 times [2022-02-15 11:55:45,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:55:45,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46251865] [2022-02-15 11:55:45,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:55:45,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:55:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:55:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:45,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:55:45,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46251865] [2022-02-15 11:55:45,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46251865] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:55:45,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237603627] [2022-02-15 11:55:45,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 11:55:45,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:55:45,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:55:45,481 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-02-15 11:55:45,482 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-02-15 11:55:45,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:55:45,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:55:45,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-02-15 11:55:45,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:55:45,973 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-02-15 11:55:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:46,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:55:46,111 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:55:46,111 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-02-15 11:55:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:46,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237603627] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:55:46,288 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:55:46,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 24 [2022-02-15 11:55:46,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701786077] [2022-02-15 11:55:46,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:55:46,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-15 11:55:46,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:55:46,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-15 11:55:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-02-15 11:55:46,289 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-02-15 11:55:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:55:47,342 INFO L93 Difference]: Finished difference Result 37419 states and 135757 transitions. [2022-02-15 11:55:47,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-02-15 11:55:47,342 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-02-15 11:55:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:55:47,464 INFO L225 Difference]: With dead ends: 37419 [2022-02-15 11:55:47,464 INFO L226 Difference]: Without dead ends: 37269 [2022-02-15 11:55:47,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=2191, Unknown=0, NotChecked=0, Total=2550 [2022-02-15 11:55:47,465 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1294 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-02-15 11:55:47,465 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-02-15 11:55:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37269 states. [2022-02-15 11:55:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37269 to 14589. [2022-02-15 11:55:47,929 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-02-15 11:55:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14589 states to 14589 states and 53201 transitions. [2022-02-15 11:55:47,970 INFO L78 Accepts]: Start accepts. Automaton has 14589 states and 53201 transitions. Word has length 124 [2022-02-15 11:55:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:55:47,970 INFO L470 AbstractCegarLoop]: Abstraction has 14589 states and 53201 transitions. [2022-02-15 11:55:47,970 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-02-15 11:55:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 14589 states and 53201 transitions. [2022-02-15 11:55:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:55:47,998 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:55:47,998 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-02-15 11:55:48,014 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-02-15 11:55:48,198 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-02-15 11:55:48,198 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:55:48,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:55:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash -708025836, now seen corresponding path program 9 times [2022-02-15 11:55:48,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:55:48,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606188348] [2022-02-15 11:55:48,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:55:48,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:55:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:55:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:48,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:55:48,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606188348] [2022-02-15 11:55:48,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606188348] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:55:48,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390462263] [2022-02-15 11:55:48,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 11:55:48,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:55:48,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:55:48,421 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-02-15 11:55:48,421 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-02-15 11:55:48,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-15 11:55:48,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:55:48,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-02-15 11:55:48,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:55:48,932 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-02-15 11:55:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:48,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:55:49,073 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:55:49,073 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-02-15 11:55:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:55:49,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390462263] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:55:49,257 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:55:49,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 25 [2022-02-15 11:55:49,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84568911] [2022-02-15 11:55:49,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:55:49,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-15 11:55:49,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:55:49,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-15 11:55:49,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-02-15 11:55:49,259 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-02-15 11:55:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:55:50,098 INFO L93 Difference]: Finished difference Result 29554 states and 107255 transitions. [2022-02-15 11:55:50,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-15 11:55:50,098 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-02-15 11:55:50,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:55:50,181 INFO L225 Difference]: With dead ends: 29554 [2022-02-15 11:55:50,182 INFO L226 Difference]: Without dead ends: 29404 [2022-02-15 11:55:50,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 239 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2022-02-15 11:55:50,182 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-02-15 11:55:50,182 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-02-15 11:55:50,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29404 states. [2022-02-15 11:55:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29404 to 14601. [2022-02-15 11:55:50,522 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-02-15 11:55:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 53148 transitions. [2022-02-15 11:55:50,561 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 53148 transitions. Word has length 124 [2022-02-15 11:55:50,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:55:50,561 INFO L470 AbstractCegarLoop]: Abstraction has 14601 states and 53148 transitions. [2022-02-15 11:55:50,562 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-02-15 11:55:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 53148 transitions. [2022-02-15 11:55:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:55:50,589 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:55:50,589 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-02-15 11:55:50,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-02-15 11:55:50,789 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-02-15 11:55:50,789 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:55:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:55:50,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1308591088, now seen corresponding path program 16 times [2022-02-15 11:55:50,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:55:50,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236897346] [2022-02-15 11:55:50,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:55:50,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:55:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:55:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:55:51,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:55:51,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236897346] [2022-02-15 11:55:51,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236897346] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:55:51,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663389183] [2022-02-15 11:55:51,325 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-15 11:55:51,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:55:51,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:55:51,326 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-02-15 11:55:51,326 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-02-15 11:55:51,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-15 11:55:51,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:55:51,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-15 11:55:51,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:55:52,052 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-02-15 11:55:52,509 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-02-15 11:55:52,724 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-02-15 11:55:52,823 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-02-15 11:55:53,077 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:55:53,077 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-02-15 11:55:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:55:53,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:55:53,624 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-02-15 11:55:53,683 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-02-15 11:55:53,745 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-02-15 11:55:53,769 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-02-15 11:55:53,879 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-02-15 11:55:53,902 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-02-15 11:55:53,914 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-02-15 11:55:54,134 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:55:54,134 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-02-15 11:55:54,141 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:55:54,141 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-02-15 11:55:54,148 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:55:54,149 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-02-15 11:55:54,157 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:55:54,157 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-02-15 11:55:54,166 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:55:54,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 70 treesize of output 75 [2022-02-15 11:55:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-15 11:55:55,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663389183] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:55:55,026 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:55:55,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 74 [2022-02-15 11:55:55,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330857575] [2022-02-15 11:55:55,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:55:55,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-02-15 11:55:55,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:55:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-02-15 11:55:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=569, Invalid=3872, Unknown=9, NotChecked=952, Total=5402 [2022-02-15 11:55:55,028 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-02-15 11:55:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:55:59,992 INFO L93 Difference]: Finished difference Result 32738 states and 118481 transitions. [2022-02-15 11:55:59,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-02-15 11:55:59,992 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-02-15 11:55:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:56:00,076 INFO L225 Difference]: With dead ends: 32738 [2022-02-15 11:56:00,076 INFO L226 Difference]: Without dead ends: 32138 [2022-02-15 11:56:00,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 211 SyntacticMatches, 11 SemanticMatches, 126 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 5131 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1838, Invalid=12701, Unknown=9, NotChecked=1708, Total=16256 [2022-02-15 11:56:00,077 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 2716 mSDsluCounter, 7567 mSDsCounter, 0 mSdLazyCounter, 3087 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-02-15 11:56:00,077 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.3s Time] [2022-02-15 11:56:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32138 states. [2022-02-15 11:56:00,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32138 to 15893. [2022-02-15 11:56:00,438 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-02-15 11:56:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15893 states to 15893 states and 58079 transitions. [2022-02-15 11:56:00,480 INFO L78 Accepts]: Start accepts. Automaton has 15893 states and 58079 transitions. Word has length 124 [2022-02-15 11:56:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:56:00,480 INFO L470 AbstractCegarLoop]: Abstraction has 15893 states and 58079 transitions. [2022-02-15 11:56:00,480 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-02-15 11:56:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 15893 states and 58079 transitions. [2022-02-15 11:56:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:56:00,507 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:56:00,508 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-02-15 11:56:00,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-02-15 11:56:00,708 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-02-15 11:56:00,708 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:56:00,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:56:00,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1704657420, now seen corresponding path program 17 times [2022-02-15 11:56:00,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:56:00,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662364277] [2022-02-15 11:56:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:56:00,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:56:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:56:01,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-02-15 11:56:01,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:56:01,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662364277] [2022-02-15 11:56:01,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662364277] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:56:01,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152219408] [2022-02-15 11:56:01,425 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-15 11:56:01,425 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:56:01,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:56:01,426 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-02-15 11:56:01,427 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-02-15 11:56:01,530 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:56:01,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:56:01,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-15 11:56:01,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:56:02,530 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:56:02,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-02-15 11:56:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:56:02,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:56:02,999 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:56:02,999 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-02-15 11:56:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:56:03,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152219408] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:56:03,838 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:56:03,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 22] total 61 [2022-02-15 11:56:03,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345151985] [2022-02-15 11:56:03,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:56:03,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-02-15 11:56:03,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:56:03,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-02-15 11:56:03,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=3228, Unknown=0, NotChecked=0, Total=3660 [2022-02-15 11:56:03,839 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-02-15 11:56:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:56:13,982 INFO L93 Difference]: Finished difference Result 51103 states and 187785 transitions. [2022-02-15 11:56:13,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-15 11:56:13,982 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-02-15 11:56:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:56:14,139 INFO L225 Difference]: With dead ends: 51103 [2022-02-15 11:56:14,139 INFO L226 Difference]: Without dead ends: 50803 [2022-02-15 11:56:14,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 210 SyntacticMatches, 9 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9608 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3107, Invalid=24283, Unknown=0, NotChecked=0, Total=27390 [2022-02-15 11:56:14,141 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 3205 mSDsluCounter, 11717 mSDsCounter, 0 mSdLazyCounter, 6954 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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.2s IncrementalHoareTripleChecker+Time [2022-02-15 11:56:14,141 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.2s Time] [2022-02-15 11:56:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50803 states. [2022-02-15 11:56:14,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50803 to 14983. [2022-02-15 11:56:14,656 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-02-15 11:56:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14983 states to 14983 states and 54813 transitions. [2022-02-15 11:56:14,698 INFO L78 Accepts]: Start accepts. Automaton has 14983 states and 54813 transitions. Word has length 124 [2022-02-15 11:56:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:56:14,698 INFO L470 AbstractCegarLoop]: Abstraction has 14983 states and 54813 transitions. [2022-02-15 11:56:14,698 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-02-15 11:56:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 14983 states and 54813 transitions. [2022-02-15 11:56:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:56:14,725 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:56:14,726 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-02-15 11:56:14,744 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-02-15 11:56:14,926 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-02-15 11:56:14,926 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:56:14,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:56:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1336949438, now seen corresponding path program 18 times [2022-02-15 11:56:14,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:56:14,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744112968] [2022-02-15 11:56:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:56:14,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:56:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:56:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:56:15,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:56:15,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744112968] [2022-02-15 11:56:15,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744112968] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:56:15,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436307692] [2022-02-15 11:56:15,676 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-15 11:56:15,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:56:15,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:56:15,677 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-02-15 11:56:15,678 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-02-15 11:56:15,788 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-02-15 11:56:15,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:56:15,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 54 conjunts are in the unsatisfiable core [2022-02-15 11:56:15,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:56:16,356 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:56:16,357 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-02-15 11:56:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:56:16,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:56:17,039 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:56:17,039 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-02-15 11:56:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:56:17,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436307692] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:56:17,409 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:56:17,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-02-15 11:56:17,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869856570] [2022-02-15 11:56:17,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:56:17,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-15 11:56:17,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:56:17,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-15 11:56:17,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2193, Unknown=0, NotChecked=0, Total=2550 [2022-02-15 11:56:17,410 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-02-15 11:56:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:56:42,502 INFO L93 Difference]: Finished difference Result 90743 states and 331982 transitions. [2022-02-15 11:56:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 456 states. [2022-02-15 11:56:42,503 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-02-15 11:56:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:56:42,984 INFO L225 Difference]: With dead ends: 90743 [2022-02-15 11:56:42,984 INFO L226 Difference]: Without dead ends: 90443 [2022-02-15 11:56:42,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 255 SyntacticMatches, 20 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 108895 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=20436, Invalid=215274, Unknown=0, NotChecked=0, Total=235710 [2022-02-15 11:56:42,993 INFO L933 BasicCegarLoop]: 645 mSDtfsCounter, 3875 mSDsluCounter, 16372 mSDsCounter, 0 mSdLazyCounter, 10179 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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, 4.6s IncrementalHoareTripleChecker+Time [2022-02-15 11:56:42,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3875 Valid, 14950 Invalid, 19637 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [393 Valid, 10179 Invalid, 0 Unknown, 9065 Unchecked, 4.6s Time] [2022-02-15 11:56:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90443 states. [2022-02-15 11:56:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90443 to 17855. [2022-02-15 11:56:44,007 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-02-15 11:56:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17855 states to 17855 states and 65955 transitions. [2022-02-15 11:56:44,062 INFO L78 Accepts]: Start accepts. Automaton has 17855 states and 65955 transitions. Word has length 124 [2022-02-15 11:56:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:56:44,062 INFO L470 AbstractCegarLoop]: Abstraction has 17855 states and 65955 transitions. [2022-02-15 11:56:44,063 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-02-15 11:56:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 17855 states and 65955 transitions. [2022-02-15 11:56:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:56:44,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:56:44,095 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-02-15 11:56:44,112 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-02-15 11:56:44,295 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-02-15 11:56:44,295 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:56:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:56:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1679196940, now seen corresponding path program 19 times [2022-02-15 11:56:44,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:56:44,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895287050] [2022-02-15 11:56:44,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:56:44,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:56:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:56:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:56:45,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:56:45,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895287050] [2022-02-15 11:56:45,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895287050] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:56:45,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238773212] [2022-02-15 11:56:45,063 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-15 11:56:45,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:56:45,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:56:45,064 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-02-15 11:56:45,065 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-02-15 11:56:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:56:45,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-02-15 11:56:45,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:56:45,269 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-02-15 11:56:45,600 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:56:45,600 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-02-15 11:56:45,814 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-02-15 11:56:46,300 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-02-15 11:56:46,466 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-02-15 11:56:46,560 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-02-15 11:56:46,743 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:56:46,743 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-02-15 11:56:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:56:47,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:56:47,530 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-02-15 11:56:47,588 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-02-15 11:56:47,648 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-02-15 11:56:47,671 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-02-15 11:56:47,789 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-02-15 11:56:47,812 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-02-15 11:56:47,825 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-02-15 11:56:48,063 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:56:48,063 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-02-15 11:56:48,099 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:56:48,100 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-02-15 11:56:48,115 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:56:48,115 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-02-15 11:56:48,131 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:56:48,131 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-02-15 11:56:48,147 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:56:48,147 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-02-15 11:56:59,602 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-02-15 11:56:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-15 11:56:59,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238773212] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:56:59,626 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:56:59,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 31] total 79 [2022-02-15 11:56:59,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60598852] [2022-02-15 11:56:59,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:56:59,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-02-15 11:56:59,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:56:59,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-02-15 11:56:59,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=4629, Unknown=9, NotChecked=1022, Total=6162 [2022-02-15 11:56:59,627 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-02-15 11:57:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:57:17,766 INFO L93 Difference]: Finished difference Result 68810 states and 248981 transitions. [2022-02-15 11:57:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-02-15 11:57:17,766 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-02-15 11:57:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:57:17,994 INFO L225 Difference]: With dead ends: 68810 [2022-02-15 11:57:17,995 INFO L226 Difference]: Without dead ends: 67910 [2022-02-15 11:57:17,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 213 SyntacticMatches, 24 SemanticMatches, 249 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 25174 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=4694, Invalid=54617, Unknown=9, NotChecked=3430, Total=62750 [2022-02-15 11:57:17,997 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 4491 mSDsluCounter, 15312 mSDsCounter, 0 mSdLazyCounter, 9415 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4491 SdHoareTripleChecker+Valid, 14193 SdHoareTripleChecker+Invalid, 22086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 9415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12442 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-02-15 11:57:17,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4491 Valid, 14193 Invalid, 22086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 9415 Invalid, 0 Unknown, 12442 Unchecked, 4.2s Time] [2022-02-15 11:57:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67910 states. [2022-02-15 11:57:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67910 to 16397. [2022-02-15 11:57:18,655 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-02-15 11:57:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16397 states to 16397 states and 60469 transitions. [2022-02-15 11:57:18,705 INFO L78 Accepts]: Start accepts. Automaton has 16397 states and 60469 transitions. Word has length 124 [2022-02-15 11:57:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:57:18,705 INFO L470 AbstractCegarLoop]: Abstraction has 16397 states and 60469 transitions. [2022-02-15 11:57:18,705 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-02-15 11:57:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 16397 states and 60469 transitions. [2022-02-15 11:57:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:57:18,735 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:57:18,735 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-02-15 11:57:18,752 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-02-15 11:57:18,936 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-02-15 11:57:18,936 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:57:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:57:18,936 INFO L85 PathProgramCache]: Analyzing trace with hash 677970192, now seen corresponding path program 20 times [2022-02-15 11:57:18,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:57:18,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452985570] [2022-02-15 11:57:18,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:57:18,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:57:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:57:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:57:19,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:57:19,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452985570] [2022-02-15 11:57:19,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452985570] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:57:19,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339399339] [2022-02-15 11:57:19,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 11:57:19,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:57:19,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:57:19,427 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-02-15 11:57:19,428 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-02-15 11:57:19,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:57:19,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:57:19,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-15 11:57:19,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:57:19,967 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:57:19,968 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-02-15 11:57:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:57:20,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:57:20,585 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:57:20,585 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-02-15 11:57:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:57:20,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339399339] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:57:20,959 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:57:20,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-02-15 11:57:20,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330981475] [2022-02-15 11:57:20,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:57:20,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-15 11:57:20,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:57:20,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-15 11:57:20,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2283, Unknown=0, NotChecked=0, Total=2550 [2022-02-15 11:57:20,960 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-02-15 11:57:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:57:46,602 INFO L93 Difference]: Finished difference Result 116207 states and 425045 transitions. [2022-02-15 11:57:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 461 states. [2022-02-15 11:57:46,603 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-02-15 11:57:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:57:47,234 INFO L225 Difference]: With dead ends: 116207 [2022-02-15 11:57:47,234 INFO L226 Difference]: Without dead ends: 115649 [2022-02-15 11:57:47,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107252 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=17926, Invalid=219730, Unknown=0, NotChecked=0, Total=237656 [2022-02-15 11:57:47,242 INFO L933 BasicCegarLoop]: 726 mSDtfsCounter, 3625 mSDsluCounter, 20517 mSDsCounter, 0 mSdLazyCounter, 9186 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:57:47,242 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.0s Time] [2022-02-15 11:57:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115649 states. [2022-02-15 11:57:48,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115649 to 16981. [2022-02-15 11:57:48,626 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-02-15 11:57:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16981 states to 16981 states and 62919 transitions. [2022-02-15 11:57:48,673 INFO L78 Accepts]: Start accepts. Automaton has 16981 states and 62919 transitions. Word has length 124 [2022-02-15 11:57:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:57:48,673 INFO L470 AbstractCegarLoop]: Abstraction has 16981 states and 62919 transitions. [2022-02-15 11:57:48,673 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-02-15 11:57:48,674 INFO L276 IsEmpty]: Start isEmpty. Operand 16981 states and 62919 transitions. [2022-02-15 11:57:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:57:48,704 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:57:48,705 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-02-15 11:57:48,721 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-02-15 11:57:48,905 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-02-15 11:57:48,905 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:57:48,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:57:48,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2092648740, now seen corresponding path program 21 times [2022-02-15 11:57:48,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:57:48,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783278489] [2022-02-15 11:57:48,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:57:48,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:57:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:57:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:57:49,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:57:49,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783278489] [2022-02-15 11:57:49,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783278489] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:57:49,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115502208] [2022-02-15 11:57:49,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 11:57:49,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:57:49,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:57:49,511 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-02-15 11:57:49,511 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-02-15 11:57:49,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-15 11:57:49,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:57:49,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-15 11:57:49,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:57:50,074 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:57:50,074 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-02-15 11:57:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:57:50,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:57:50,708 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:57:50,708 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-02-15 11:57:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:57:51,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115502208] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:57:51,071 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:57:51,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 17] total 49 [2022-02-15 11:57:51,072 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863527788] [2022-02-15 11:57:51,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:57:51,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-15 11:57:51,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:57:51,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-15 11:57:51,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2097, Unknown=0, NotChecked=0, Total=2352 [2022-02-15 11:57:51,073 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-02-15 11:58:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:58:12,699 INFO L93 Difference]: Finished difference Result 93956 states and 341569 transitions. [2022-02-15 11:58:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 366 states. [2022-02-15 11:58:12,700 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-02-15 11:58:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:58:13,020 INFO L225 Difference]: With dead ends: 93956 [2022-02-15 11:58:13,020 INFO L226 Difference]: Without dead ends: 93371 [2022-02-15 11:58:13,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 243 SyntacticMatches, 6 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67865 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=13311, Invalid=138399, Unknown=0, NotChecked=0, Total=151710 [2022-02-15 11:58:13,026 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 3398 mSDsluCounter, 15353 mSDsCounter, 0 mSdLazyCounter, 8406 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3398 SdHoareTripleChecker+Valid, 14126 SdHoareTripleChecker+Invalid, 18378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 8406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9656 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-02-15 11:58:13,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3398 Valid, 14126 Invalid, 18378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 8406 Invalid, 0 Unknown, 9656 Unchecked, 3.8s Time] [2022-02-15 11:58:13,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93371 states. [2022-02-15 11:58:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93371 to 17001. [2022-02-15 11:58:14,303 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-02-15 11:58:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17001 states to 17001 states and 63014 transitions. [2022-02-15 11:58:14,354 INFO L78 Accepts]: Start accepts. Automaton has 17001 states and 63014 transitions. Word has length 124 [2022-02-15 11:58:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:58:14,354 INFO L470 AbstractCegarLoop]: Abstraction has 17001 states and 63014 transitions. [2022-02-15 11:58:14,355 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-02-15 11:58:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 17001 states and 63014 transitions. [2022-02-15 11:58:14,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:58:14,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:58:14,388 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-02-15 11:58:14,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-02-15 11:58:14,603 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-02-15 11:58:14,603 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:58:14,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:58:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1474847118, now seen corresponding path program 22 times [2022-02-15 11:58:14,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:58:14,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447570095] [2022-02-15 11:58:14,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:58:14,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:58:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:58:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:58:15,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:58:15,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447570095] [2022-02-15 11:58:15,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447570095] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:58:15,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292175131] [2022-02-15 11:58:15,200 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-15 11:58:15,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:58:15,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:58:15,201 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-02-15 11:58:15,201 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-02-15 11:58:15,313 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-15 11:58:15,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:58:15,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-15 11:58:15,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:58:15,951 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-02-15 11:58:16,418 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-02-15 11:58:16,584 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-02-15 11:58:16,689 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-02-15 11:58:16,857 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:58:16,857 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-02-15 11:58:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:58:17,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:58:17,469 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-02-15 11:58:17,525 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-02-15 11:58:17,588 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-02-15 11:58:17,610 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-02-15 11:58:17,710 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-02-15 11:58:17,733 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-02-15 11:58:17,745 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-02-15 11:58:17,995 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:58:17,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2022-02-15 11:58:18,001 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:58:18,002 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-02-15 11:58:18,009 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:58:18,009 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-02-15 11:58:18,017 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:58:18,018 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-02-15 11:58:18,028 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:58:18,028 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-02-15 11:58:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-15 11:58:19,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292175131] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:58:19,012 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:58:19,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 77 [2022-02-15 11:58:19,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971268865] [2022-02-15 11:58:19,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:58:19,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-02-15 11:58:19,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:58:19,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-02-15 11:58:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=4366, Unknown=10, NotChecked=994, Total=5852 [2022-02-15 11:58:19,013 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-02-15 11:58:26,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:58:26,115 INFO L93 Difference]: Finished difference Result 37388 states and 136707 transitions. [2022-02-15 11:58:26,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-02-15 11:58:26,115 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-02-15 11:58:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:58:26,213 INFO L225 Difference]: With dead ends: 37388 [2022-02-15 11:58:26,213 INFO L226 Difference]: Without dead ends: 37238 [2022-02-15 11:58:26,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 205 SyntacticMatches, 8 SemanticMatches, 122 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 4502 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1332, Invalid=12258, Unknown=10, NotChecked=1652, Total=15252 [2022-02-15 11:58:26,214 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 1694 mSDsluCounter, 10497 mSDsCounter, 0 mSdLazyCounter, 3515 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:58:26,215 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.4s Time] [2022-02-15 11:58:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37238 states. [2022-02-15 11:58:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37238 to 17561. [2022-02-15 11:58:26,636 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-02-15 11:58:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17561 states to 17561 states and 65246 transitions. [2022-02-15 11:58:26,683 INFO L78 Accepts]: Start accepts. Automaton has 17561 states and 65246 transitions. Word has length 124 [2022-02-15 11:58:26,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:58:26,683 INFO L470 AbstractCegarLoop]: Abstraction has 17561 states and 65246 transitions. [2022-02-15 11:58:26,683 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-02-15 11:58:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 17561 states and 65246 transitions. [2022-02-15 11:58:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:58:26,715 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:58:26,715 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-02-15 11:58:26,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-02-15 11:58:26,915 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-02-15 11:58:26,915 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:58:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:58:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1421602086, now seen corresponding path program 23 times [2022-02-15 11:58:26,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:58:26,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167032876] [2022-02-15 11:58:26,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:58:26,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:58:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:58:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:58:27,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:58:27,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167032876] [2022-02-15 11:58:27,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167032876] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:58:27,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144990767] [2022-02-15 11:58:27,514 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-15 11:58:27,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:58:27,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:58:27,517 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-02-15 11:58:27,517 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-02-15 11:58:27,628 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-15 11:58:27,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:58:27,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-15 11:58:27,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:58:27,691 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-02-15 11:58:27,723 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-15 11:58:27,723 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-02-15 11:58:27,962 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-15 11:58:27,962 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-02-15 11:58:28,096 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-02-15 11:58:28,345 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-02-15 11:58:28,507 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-02-15 11:58:28,587 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-02-15 11:58:28,762 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:58:28,763 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-02-15 11:58:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:58:29,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:58:29,485 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-02-15 11:58:29,542 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-02-15 11:58:29,594 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-02-15 11:58:29,872 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-02-15 11:58:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-02-15 11:58:29,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144990767] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:58:29,893 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:58:29,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 20] total 65 [2022-02-15 11:58:29,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738473806] [2022-02-15 11:58:29,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:58:29,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-02-15 11:58:29,893 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:58:29,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-02-15 11:58:29,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=3444, Unknown=3, NotChecked=366, Total=4160 [2022-02-15 11:58:29,894 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-02-15 11:59:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:59:04,381 INFO L93 Difference]: Finished difference Result 94532 states and 345562 transitions. [2022-02-15 11:59:04,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 519 states. [2022-02-15 11:59:04,382 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-02-15 11:59:04,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:59:04,702 INFO L225 Difference]: With dead ends: 94532 [2022-02-15 11:59:04,702 INFO L226 Difference]: Without dead ends: 94082 [2022-02-15 11:59:04,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 232 SyntacticMatches, 20 SemanticMatches, 560 ConstructedPredicates, 3 IntricatePredicates, 5 DeprecatedPredicates, 141469 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=22968, Invalid=288963, Unknown=3, NotChecked=3348, Total=315282 [2022-02-15 11:59:04,716 INFO L933 BasicCegarLoop]: 701 mSDtfsCounter, 5523 mSDsluCounter, 16567 mSDsCounter, 0 mSdLazyCounter, 9442 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:59:04,716 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.4s Time] [2022-02-15 11:59:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94082 states. [2022-02-15 11:59:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94082 to 17409. [2022-02-15 11:59:05,979 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-02-15 11:59:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17409 states to 17409 states and 64604 transitions. [2022-02-15 11:59:06,029 INFO L78 Accepts]: Start accepts. Automaton has 17409 states and 64604 transitions. Word has length 124 [2022-02-15 11:59:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:59:06,030 INFO L470 AbstractCegarLoop]: Abstraction has 17409 states and 64604 transitions. [2022-02-15 11:59:06,030 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-02-15 11:59:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 17409 states and 64604 transitions. [2022-02-15 11:59:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:59:06,063 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:59:06,063 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-02-15 11:59:06,079 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-02-15 11:59:06,263 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-02-15 11:59:06,263 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:59:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:59:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1934802414, now seen corresponding path program 24 times [2022-02-15 11:59:06,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:59:06,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481416805] [2022-02-15 11:59:06,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:59:06,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:59:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:59:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:59:06,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:59:06,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481416805] [2022-02-15 11:59:06,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481416805] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:59:06,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022334922] [2022-02-15 11:59:06,760 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-15 11:59:06,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:59:06,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:59:06,762 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-02-15 11:59:06,763 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-02-15 11:59:06,883 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-15 11:59:06,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:59:06,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-15 11:59:06,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:59:07,313 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:59:07,314 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-02-15 11:59:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:59:07,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:59:07,919 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:59:07,919 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-02-15 11:59:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:59:08,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022334922] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:59:08,289 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:59:08,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-02-15 11:59:08,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519127301] [2022-02-15 11:59:08,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:59:08,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-15 11:59:08,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:59:08,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-15 11:59:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2022-02-15 11:59:08,291 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-02-15 11:59:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:59:30,107 INFO L93 Difference]: Finished difference Result 91418 states and 334526 transitions. [2022-02-15 11:59:30,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 385 states. [2022-02-15 11:59:30,108 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-02-15 11:59:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:59:30,411 INFO L225 Difference]: With dead ends: 91418 [2022-02-15 11:59:30,411 INFO L226 Difference]: Without dead ends: 90968 [2022-02-15 11:59:30,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 235 SyntacticMatches, 25 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76418 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=16789, Invalid=152543, Unknown=0, NotChecked=0, Total=169332 [2022-02-15 11:59:30,420 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 3637 mSDsluCounter, 14201 mSDsCounter, 0 mSdLazyCounter, 6797 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:59:30,420 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.1s Time] [2022-02-15 11:59:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90968 states. [2022-02-15 11:59:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90968 to 17953. [2022-02-15 11:59:31,630 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-02-15 11:59:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 66780 transitions. [2022-02-15 11:59:31,679 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 66780 transitions. Word has length 124 [2022-02-15 11:59:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:59:31,679 INFO L470 AbstractCegarLoop]: Abstraction has 17953 states and 66780 transitions. [2022-02-15 11:59:31,679 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-02-15 11:59:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 66780 transitions. [2022-02-15 11:59:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:59:31,713 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:59:31,713 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-02-15 11:59:31,729 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-02-15 11:59:31,913 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-02-15 11:59:31,913 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:59:31,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:59:31,914 INFO L85 PathProgramCache]: Analyzing trace with hash -945486334, now seen corresponding path program 25 times [2022-02-15 11:59:31,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:59:31,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88145883] [2022-02-15 11:59:31,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:59:31,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:59:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:59:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:59:32,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:59:32,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88145883] [2022-02-15 11:59:32,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88145883] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:59:32,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689670604] [2022-02-15 11:59:32,439 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-15 11:59:32,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:59:32,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:59:32,440 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-02-15 11:59:32,441 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-02-15 11:59:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:59:32,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-02-15 11:59:32,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:59:32,649 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-02-15 11:59:32,977 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:59:32,978 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-02-15 11:59:33,184 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-02-15 11:59:33,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-15 11:59:33,822 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-02-15 11:59:33,919 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-02-15 11:59:34,094 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:59:34,094 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-02-15 11:59:34,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:59:34,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:59:34,850 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-02-15 11:59:34,913 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-02-15 11:59:34,980 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-02-15 11:59:35,005 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-02-15 11:59:35,205 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-02-15 11:59:35,228 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-02-15 11:59:35,241 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-02-15 11:59:35,468 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:59:35,469 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-02-15 11:59:35,493 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:59:35,494 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-02-15 11:59:35,503 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:59:35,504 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-02-15 11:59:35,514 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:59:35,515 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-02-15 11:59:35,526 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:59:35,527 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-02-15 11:59:38,787 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-02-15 11:59:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-15 11:59:38,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689670604] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:59:38,809 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:59:38,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 31] total 79 [2022-02-15 11:59:38,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547439389] [2022-02-15 11:59:38,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:59:38,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-02-15 11:59:38,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:59:38,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-02-15 11:59:38,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=4512, Unknown=9, NotChecked=1022, Total=6162 [2022-02-15 11:59:38,811 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) [2022-02-15 11:59:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:59:44,423 INFO L93 Difference]: Finished difference Result 48464 states and 177716 transitions. [2022-02-15 11:59:44,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-02-15 11:59:44,423 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 124 [2022-02-15 11:59:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:59:44,574 INFO L225 Difference]: With dead ends: 48464 [2022-02-15 11:59:44,574 INFO L226 Difference]: Without dead ends: 48164 [2022-02-15 11:59:44,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 205 SyntacticMatches, 9 SemanticMatches, 146 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 7117 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1996, Invalid=17763, Unknown=9, NotChecked=1988, Total=21756 [2022-02-15 11:59:44,575 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 2342 mSDsluCounter, 12006 mSDsCounter, 0 mSdLazyCounter, 3905 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 11244 SdHoareTripleChecker+Invalid, 11249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7254 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-15 11:59:44,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2342 Valid, 11244 Invalid, 11249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3905 Invalid, 0 Unknown, 7254 Unchecked, 1.6s Time] [2022-02-15 11:59:44,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48164 states. [2022-02-15 11:59:45,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48164 to 18137. [2022-02-15 11:59:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18137 states, 18136 states have (on average 3.720004411116012) internal successors, (67466), 18136 states have internal predecessors, (67466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:59:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18137 states to 18137 states and 67466 transitions. [2022-02-15 11:59:45,162 INFO L78 Accepts]: Start accepts. Automaton has 18137 states and 67466 transitions. Word has length 124 [2022-02-15 11:59:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:59:45,162 INFO L470 AbstractCegarLoop]: Abstraction has 18137 states and 67466 transitions. [2022-02-15 11:59:45,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2022-02-15 11:59:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 18137 states and 67466 transitions. [2022-02-15 11:59:45,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 11:59:45,196 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:59:45,196 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-02-15 11:59:45,213 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-02-15 11:59:45,397 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-02-15 11:59:45,397 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 11:59:45,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:59:45,397 INFO L85 PathProgramCache]: Analyzing trace with hash 724968554, now seen corresponding path program 26 times [2022-02-15 11:59:45,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:59:45,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918005791] [2022-02-15 11:59:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:59:45,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:59:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:59:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:59:45,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:59:45,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918005791] [2022-02-15 11:59:45,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918005791] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:59:45,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055959431] [2022-02-15 11:59:45,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 11:59:45,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:59:45,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:59:45,878 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:59:45,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-02-15 11:59:45,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:59:45,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:59:45,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-15 11:59:45,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:59:46,467 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:59:46,467 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-02-15 11:59:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:59:46,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:59:47,137 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:59:47,137 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-02-15 11:59:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:59:47,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055959431] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:59:47,548 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:59:47,548 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-02-15 11:59:47,548 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832920324] [2022-02-15 11:59:47,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:59:47,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-15 11:59:47,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:59:47,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-15 11:59:47,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2176, Unknown=0, NotChecked=0, Total=2550 [2022-02-15 11:59:47,549 INFO L87 Difference]: Start difference. First operand 18137 states and 67466 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-02-15 12:00:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 12:00:06,301 INFO L93 Difference]: Finished difference Result 75431 states and 278135 transitions. [2022-02-15 12:00:06,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 345 states. [2022-02-15 12:00:06,302 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-02-15 12:00:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 12:00:06,590 INFO L225 Difference]: With dead ends: 75431 [2022-02-15 12:00:06,591 INFO L226 Difference]: Without dead ends: 75131 [2022-02-15 12:00:06,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 267 SyntacticMatches, 27 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 66614 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=15372, Invalid=125628, Unknown=0, NotChecked=0, Total=141000 [2022-02-15 12:00:06,598 INFO L933 BasicCegarLoop]: 466 mSDtfsCounter, 3744 mSDsluCounter, 11413 mSDsCounter, 0 mSdLazyCounter, 5681 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3744 SdHoareTripleChecker+Valid, 10847 SdHoareTripleChecker+Invalid, 15326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 5681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9348 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-15 12:00:06,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3744 Valid, 10847 Invalid, 15326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 5681 Invalid, 0 Unknown, 9348 Unchecked, 2.9s Time] [2022-02-15 12:00:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75131 states. [2022-02-15 12:00:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75131 to 19778. [2022-02-15 12:00:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19778 states, 19777 states have (on average 3.7325681347019266) internal successors, (73819), 19777 states have internal predecessors, (73819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 12:00:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19778 states to 19778 states and 73819 transitions. [2022-02-15 12:00:07,680 INFO L78 Accepts]: Start accepts. Automaton has 19778 states and 73819 transitions. Word has length 124 [2022-02-15 12:00:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 12:00:07,680 INFO L470 AbstractCegarLoop]: Abstraction has 19778 states and 73819 transitions. [2022-02-15 12:00:07,681 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-02-15 12:00:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 19778 states and 73819 transitions. [2022-02-15 12:00:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 12:00:07,722 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 12:00:07,722 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-02-15 12:00:07,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-02-15 12:00:07,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 12:00:07,922 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 12:00:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 12:00:07,923 INFO L85 PathProgramCache]: Analyzing trace with hash -941104392, now seen corresponding path program 27 times [2022-02-15 12:00:07,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 12:00:07,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180364485] [2022-02-15 12:00:07,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 12:00:07,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 12:00:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 12:00:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 12:00:08,448 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 12:00:08,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180364485] [2022-02-15 12:00:08,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180364485] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 12:00:08,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868664687] [2022-02-15 12:00:08,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 12:00:08,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 12:00:08,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 12:00:08,450 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 12:00:08,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-02-15 12:00:08,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-15 12:00:08,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 12:00:08,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 58 conjunts are in the unsatisfiable core [2022-02-15 12:00:08,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 12:00:09,298 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 12:00:09,299 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 25 treesize of output 25 [2022-02-15 12:00:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 12:00:09,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 12:00:10,211 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 12:00:10,211 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-02-15 12:00:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 12:00:10,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868664687] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 12:00:10,672 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 12:00:10,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 17] total 54 [2022-02-15 12:00:10,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829087084] [2022-02-15 12:00:10,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 12:00:10,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-15 12:00:10,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 12:00:10,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-15 12:00:10,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=2482, Unknown=0, NotChecked=0, Total=2862 [2022-02-15 12:00:10,674 INFO L87 Difference]: Start difference. First operand 19778 states and 73819 transitions. Second operand has 54 states, 54 states have (on average 5.648148148148148) internal successors, (305), 54 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-02-15 12:00:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 12:00:30,167 INFO L93 Difference]: Finished difference Result 75856 states and 279292 transitions. [2022-02-15 12:00:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 312 states. [2022-02-15 12:00:30,167 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.648148148148148) internal successors, (305), 54 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-02-15 12:00:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 12:00:30,410 INFO L225 Difference]: With dead ends: 75856 [2022-02-15 12:00:30,410 INFO L226 Difference]: Without dead ends: 75556 [2022-02-15 12:00:30,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 228 SyntacticMatches, 20 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56551 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=13291, Invalid=109559, Unknown=0, NotChecked=0, Total=122850 [2022-02-15 12:00:30,415 INFO L933 BasicCegarLoop]: 458 mSDtfsCounter, 3860 mSDsluCounter, 11231 mSDsCounter, 0 mSdLazyCounter, 7698 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3860 SdHoareTripleChecker+Valid, 10683 SdHoareTripleChecker+Invalid, 11738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 7698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3755 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-02-15 12:00:30,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3860 Valid, 10683 Invalid, 11738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 7698 Invalid, 0 Unknown, 3755 Unchecked, 3.8s Time] [2022-02-15 12:00:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75556 states. [2022-02-15 12:00:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75556 to 18430. [2022-02-15 12:00:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18430 states, 18429 states have (on average 3.7268978240816106) internal successors, (68683), 18429 states have internal predecessors, (68683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 12:00:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18430 states to 18430 states and 68683 transitions. [2022-02-15 12:00:31,433 INFO L78 Accepts]: Start accepts. Automaton has 18430 states and 68683 transitions. Word has length 124 [2022-02-15 12:00:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 12:00:31,433 INFO L470 AbstractCegarLoop]: Abstraction has 18430 states and 68683 transitions. [2022-02-15 12:00:31,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.648148148148148) internal successors, (305), 54 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-02-15 12:00:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 18430 states and 68683 transitions. [2022-02-15 12:00:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 12:00:31,466 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 12:00:31,466 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-02-15 12:00:31,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-02-15 12:00:31,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-02-15 12:00:31,666 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 12:00:31,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 12:00:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash 65989308, now seen corresponding path program 28 times [2022-02-15 12:00:31,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 12:00:31,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993959466] [2022-02-15 12:00:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 12:00:31,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 12:00:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 12:00:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 12:00:32,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 12:00:32,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993959466] [2022-02-15 12:00:32,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993959466] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 12:00:32,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849245600] [2022-02-15 12:00:32,277 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-15 12:00:32,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 12:00:32,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 12:00:32,278 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 12:00:32,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-02-15 12:00:32,396 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-15 12:00:32,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 12:00:32,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-15 12:00:32,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 12:00:33,070 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-02-15 12:00:33,527 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-02-15 12:00:33,702 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-02-15 12:00:33,807 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-02-15 12:00:33,983 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 12:00:33,984 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-02-15 12:00:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 12:00:34,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 12:00:34,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1606 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) 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))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-15 12:00:34,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (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_1605) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) 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))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-15 12:00:34,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (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_1605) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) 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-02-15 12:00:34,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (~M~0 Int) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (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_1604) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1605) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) 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-02-15 12:00:34,854 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (~M~0 Int) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (Array Int Int))) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1604) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1605) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-15 12:00:34,878 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (~M~0 Int) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (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_1604) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1605) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) |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|)) (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-15 12:00:34,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1604 (Array Int Int)) (~M~0 Int) (v_ArrVal_1606 (Array Int Int)) (v_ArrVal_1605 (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_1604) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1605) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1606) |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))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-15 12:00:35,121 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 12:00:35,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2022-02-15 12:00:35,128 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 12:00:35,128 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-02-15 12:00:35,135 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 12:00:35,135 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-02-15 12:00:35,143 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 12:00:35,143 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-02-15 12:00:35,152 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 12:00:35,152 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-02-15 12:00:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-15 12:00:36,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849245600] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 12:00:36,157 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 12:00:36,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 78 [2022-02-15 12:00:36,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404334094] [2022-02-15 12:00:36,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 12:00:36,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-02-15 12:00:36,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 12:00:36,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-02-15 12:00:36,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=4455, Unknown=10, NotChecked=1008, Total=6006 [2022-02-15 12:00:36,159 INFO L87 Difference]: Start difference. First operand 18430 states and 68683 transitions. Second operand has 78 states, 78 states have (on average 3.769230769230769) internal successors, (294), 78 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-02-15 12:00:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 12:00:44,808 INFO L93 Difference]: Finished difference Result 39809 states and 145982 transitions. [2022-02-15 12:00:44,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-02-15 12:00:44,824 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 3.769230769230769) internal successors, (294), 78 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-02-15 12:00:44,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 12:00:44,953 INFO L225 Difference]: With dead ends: 39809 [2022-02-15 12:00:44,953 INFO L226 Difference]: Without dead ends: 39509 [2022-02-15 12:00:44,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 210 SyntacticMatches, 16 SemanticMatches, 138 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 6678 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1948, Invalid=15626, Unknown=10, NotChecked=1876, Total=19460 [2022-02-15 12:00:44,955 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 2395 mSDsluCounter, 8972 mSDsCounter, 0 mSdLazyCounter, 3128 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 8635 SdHoareTripleChecker+Invalid, 7051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3849 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-15 12:00:44,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2395 Valid, 8635 Invalid, 7051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3128 Invalid, 0 Unknown, 3849 Unchecked, 1.4s Time] [2022-02-15 12:00:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39509 states. [2022-02-15 12:00:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39509 to 18618. [2022-02-15 12:00:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18618 states, 18617 states have (on average 3.729064833216952) internal successors, (69424), 18617 states have internal predecessors, (69424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 12:00:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 69424 transitions. [2022-02-15 12:00:45,558 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 69424 transitions. Word has length 124 [2022-02-15 12:00:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 12:00:45,559 INFO L470 AbstractCegarLoop]: Abstraction has 18618 states and 69424 transitions. [2022-02-15 12:00:45,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.769230769230769) internal successors, (294), 78 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-02-15 12:00:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 69424 transitions. [2022-02-15 12:00:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 12:00:45,597 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 12:00:45,597 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-02-15 12:00:45,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-02-15 12:00:45,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-02-15 12:00:45,798 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 12:00:45,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 12:00:45,798 INFO L85 PathProgramCache]: Analyzing trace with hash 862866234, now seen corresponding path program 29 times [2022-02-15 12:00:45,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 12:00:45,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499409514] [2022-02-15 12:00:45,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 12:00:45,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 12:00:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 12:00:46,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-02-15 12:00:46,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 12:00:46,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499409514] [2022-02-15 12:00:46,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499409514] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 12:00:46,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670175736] [2022-02-15 12:00:46,423 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-15 12:00:46,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 12:00:46,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 12:00:46,424 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 12:00:46,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-02-15 12:00:46,558 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-15 12:00:46,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 12:00:46,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-15 12:00:46,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 12:00:47,792 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 12:00:47,792 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 25 treesize of output 25 [2022-02-15 12:00:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 12:00:48,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 12:00:48,278 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 12:00:48,278 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-02-15 12:00:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 12:00:49,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670175736] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 12:00:49,326 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 12:00:49,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 22] total 63 [2022-02-15 12:00:49,327 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674277032] [2022-02-15 12:00:49,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 12:00:49,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-02-15 12:00:49,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 12:00:49,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-02-15 12:00:49,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=3497, Unknown=0, NotChecked=0, Total=3906 [2022-02-15 12:00:49,328 INFO L87 Difference]: Start difference. First operand 18618 states and 69424 transitions. Second operand has 63 states, 63 states have (on average 4.285714285714286) internal successors, (270), 63 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 12:00:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 12:00:52,437 INFO L93 Difference]: Finished difference Result 35127 states and 130024 transitions. [2022-02-15 12:00:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-02-15 12:00:52,438 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.285714285714286) internal successors, (270), 63 states have internal predecessors, (270), 0 states have call successors, (0), 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-02-15 12:00:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 12:00:52,552 INFO L225 Difference]: With dead ends: 35127 [2022-02-15 12:00:52,552 INFO L226 Difference]: Without dead ends: 34977 [2022-02-15 12:00:52,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 211 SyntacticMatches, 8 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3931 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1333, Invalid=10009, Unknown=0, NotChecked=0, Total=11342 [2022-02-15 12:00:52,553 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 2007 mSDsluCounter, 6868 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 6643 SdHoareTripleChecker+Invalid, 3624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1449 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-15 12:00:52,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2007 Valid, 6643 Invalid, 3624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2108 Invalid, 0 Unknown, 1449 Unchecked, 1.0s Time] [2022-02-15 12:00:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2022-02-15 12:00:53,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18710. [2022-02-15 12:00:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18710 states, 18709 states have (on average 3.7289539793682187) internal successors, (69765), 18709 states have internal predecessors, (69765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 12:00:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18710 states to 18710 states and 69765 transitions. [2022-02-15 12:00:53,129 INFO L78 Accepts]: Start accepts. Automaton has 18710 states and 69765 transitions. Word has length 124 [2022-02-15 12:00:53,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 12:00:53,129 INFO L470 AbstractCegarLoop]: Abstraction has 18710 states and 69765 transitions. [2022-02-15 12:00:53,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.285714285714286) internal successors, (270), 63 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 12:00:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 18710 states and 69765 transitions. [2022-02-15 12:00:53,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-15 12:00:53,260 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 12:00:53,261 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-02-15 12:00:53,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-02-15 12:00:53,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-02-15 12:00:53,461 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-15 12:00:53,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 12:00:53,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1322821530, now seen corresponding path program 30 times [2022-02-15 12:00:53,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 12:00:53,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857758071] [2022-02-15 12:00:53,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 12:00:53,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 12:00:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 12:00:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 12:00:54,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 12:00:54,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857758071] [2022-02-15 12:00:54,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857758071] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 12:00:54,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354011737] [2022-02-15 12:00:54,012 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-15 12:00:54,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 12:00:54,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 12:00:54,014 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 12:00:54,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-02-15 12:00:54,143 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-15 12:00:54,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 12:00:54,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 76 conjunts are in the unsatisfiable core [2022-02-15 12:00:54,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 12:00:54,250 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-02-15 12:00:54,532 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 12:00:54,533 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-02-15 12:00:54,679 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-02-15 12:00:54,999 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-02-15 12:00:55,168 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-02-15 12:00:55,252 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-02-15 12:00:55,453 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 12:00:55,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 23 treesize of output 23 [2022-02-15 12:00:55,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 12:00:55,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 12:00:56,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1676 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1676) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-15 12:00:56,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1676 (Array Int Int)) (~M~0 Int) (v_ArrVal_1675 (Array Int Int))) (or (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1675) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1676) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-15 12:00:56,369 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1676 (Array Int Int)) (~M~0 Int) (v_ArrVal_1675 (Array Int 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_1675) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1676) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-02-15 12:00:56,620 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-02-15 12:00:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-02-15 12:00:56,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354011737] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 12:00:56,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 12:00:56,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 20] total 66 [2022-02-15 12:00:56,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533679173] [2022-02-15 12:00:56,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 12:00:56,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-02-15 12:00:56,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 12:00:56,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-02-15 12:00:56,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=3468, Unknown=3, NotChecked=372, Total=4290 [2022-02-15 12:00:56,644 INFO L87 Difference]: Start difference. First operand 18710 states and 69765 transitions. Second operand has 66 states, 66 states have (on average 4.803030303030303) internal successors, (317), 66 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) Received shutdown request... [2022-02-15 12:01:01,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-02-15 12:01:01,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 213 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3745 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1926, Invalid=11423, Unknown=3, NotChecked=690, Total=14042 [2022-02-15 12:01:01,611 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 1477 mSDsluCounter, 3331 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 3313 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1064 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 12:01:01,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 3313 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1712 Invalid, 0 Unknown, 1064 Unchecked, 0.7s Time] [2022-02-15 12:01:01,612 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-02-15 12:01:01,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-02-15 12:01:01,636 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-02-15 12:01:01,636 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-15 12:01:01,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 12:01:01,828 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (18710states) and FLOYD_HOARE automaton (currently 62 states, 66 states before enhancement),while ReachableStatesComputation was computing reachable states (1013 states constructed, input type IntersectNwa). [2022-02-15 12:01:01,829 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-02-15 12:01:01,830 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-02-15 12:01:01,830 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-02-15 12:01:01,832 INFO L732 BasicCegarLoop]: Path program histogram: [30, 9, 6, 1, 1, 1, 1, 1, 1] [2022-02-15 12:01:01,833 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-15 12:01:01,833 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 12:01:01,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:01:01 BasicIcfg [2022-02-15 12:01:01,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 12:01:01,834 INFO L158 Benchmark]: Toolchain (without parser) took 747182.07ms. Allocated memory was 216.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 167.0MB in the beginning and 364.2MB in the end (delta: -197.2MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-02-15 12:01:01,835 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory is still 183.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 12:01:01,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.28ms. Allocated memory is still 216.0MB. Free memory was 166.8MB in the beginning and 190.3MB in the end (delta: -23.5MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. [2022-02-15 12:01:01,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.30ms. Allocated memory is still 216.0MB. Free memory was 190.3MB in the beginning and 188.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 12:01:01,835 INFO L158 Benchmark]: Boogie Preprocessor took 28.33ms. Allocated memory is still 216.0MB. Free memory was 188.0MB in the beginning and 186.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 12:01:01,835 INFO L158 Benchmark]: RCFGBuilder took 475.55ms. Allocated memory is still 216.0MB. Free memory was 186.4MB in the beginning and 159.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-02-15 12:01:01,835 INFO L158 Benchmark]: TraceAbstraction took 746426.75ms. Allocated memory was 216.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 158.6MB in the beginning and 364.2MB in the end (delta: -205.5MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-02-15 12:01:01,835 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory is still 183.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.28ms. Allocated memory is still 216.0MB. Free memory was 166.8MB in the beginning and 190.3MB in the end (delta: -23.5MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.30ms. Allocated memory is still 216.0MB. Free memory was 190.3MB in the beginning and 188.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.33ms. Allocated memory is still 216.0MB. Free memory was 188.0MB in the beginning and 186.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 475.55ms. Allocated memory is still 216.0MB. Free memory was 186.4MB in the beginning and 159.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 746426.75ms. Allocated memory was 216.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 158.6MB in the beginning and 364.2MB in the end (delta: -205.5MB). Peak memory consumption was 2.0GB. Max. memory is 8.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 (18710states) and FLOYD_HOARE automaton (currently 62 states, 66 states before enhancement),while ReachableStatesComputation was computing reachable states (1013 states constructed, input type IntersectNwa). - 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 (18710states) and FLOYD_HOARE automaton (currently 62 states, 66 states before enhancement),while ReachableStatesComputation was computing reachable states (1013 states constructed, input type IntersectNwa). - 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 (18710states) and FLOYD_HOARE automaton (currently 62 states, 66 states before enhancement),while ReachableStatesComputation was computing reachable states (1013 states constructed, input type IntersectNwa). - 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 (18710states) and FLOYD_HOARE automaton (currently 62 states, 66 states before enhancement),while ReachableStatesComputation was computing reachable states (1013 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 178 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 746.3s, OverallIterations: 51, TraceHistogramMax: 1, PathProgramHistogramMax: 30, EmptinessCheckTime: 1.4s, AutomataDifference: 466.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104625 SdHoareTripleChecker+Valid, 89.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104625 mSDsluCounter, 389240 SdHoareTripleChecker+Invalid, 74.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 221620 IncrementalHoareTripleChecker+Unchecked, 407798 mSDsCounter, 5692 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 202587 IncrementalHoareTripleChecker+Invalid, 429899 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5692 mSolverCounterUnsat, 16433 mSDtfsCounter, 202587 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18956 GetRequests, 10220 SyntacticMatches, 483 SemanticMatches, 8253 ConstructedPredicates, 144 IntricatePredicates, 47 DeprecatedPredicates, 1060288 ImplicationChecksByTransitivity, 382.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19778occurred in iteration=47, InterpolantAutomatonStates: 6356, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.5s AutomataMinimizationTime, 50 MinimizatonAttempts, 1342489 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 235.1s InterpolantComputationTime, 11867 NumberOfCodeBlocks, 11857 NumberOfCodeBlocksAsserted, 139 NumberOfCheckSat, 17386 ConstructedInterpolants, 1705 QuantifiedInterpolants, 210810 SizeOfPredicates, 1612 NumberOfNonLiveVariables, 14748 ConjunctsInSsa, 2740 ConjunctsInUnsatCore, 143 InterpolantComputations, 8 PerfectInterpolantSequences, 74/396 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