/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 18:53:05,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 18:53:05,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 18:53:05,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 18:53:05,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 18:53:05,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 18:53:05,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 18:53:05,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 18:53:05,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 18:53:05,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 18:53:05,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 18:53:05,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 18:53:05,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 18:53:05,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 18:53:05,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 18:53:05,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 18:53:05,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 18:53:05,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 18:53:05,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 18:53:05,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 18:53:05,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 18:53:05,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 18:53:05,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 18:53:05,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 18:53:05,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 18:53:05,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 18:53:05,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 18:53:05,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 18:53:05,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 18:53:05,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 18:53:05,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 18:53:05,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 18:53:05,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 18:53:05,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 18:53:05,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 18:53:05,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 18:53:05,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 18:53:05,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 18:53:05,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 18:53:05,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 18:53:05,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 18:53:05,893 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 18:53:05,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 18:53:05,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 18:53:05,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 18:53:05,914 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 18:53:05,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 18:53:05,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 18:53:05,915 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 18:53:05,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 18:53:05,915 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 18:53:05,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 18:53:05,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 18:53:05,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 18:53:05,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 18:53:05,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 18:53:05,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 18:53:05,916 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 18:53:05,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 18:53:05,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 18:53:05,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 18:53:05,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 18:53:05,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 18:53:05,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 18:53:05,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 18:53:05,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:53:05,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 18:53:05,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 18:53:05,916 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 18:53:05,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 18:53:05,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 18:53:05,917 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 18:53:05,917 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 18:53:05,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 18:53:05,917 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 18:53:06,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 18:53:06,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 18:53:06,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 18:53:06,099 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 18:53:06,100 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 18:53:06,101 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2022-03-15 18:53:06,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b754b7a54/5b68ad6534c94ac5b3c3e81a6082d042/FLAG87a8c4d6e [2022-03-15 18:53:06,540 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 18:53:06,541 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2022-03-15 18:53:06,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b754b7a54/5b68ad6534c94ac5b3c3e81a6082d042/FLAG87a8c4d6e [2022-03-15 18:53:06,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b754b7a54/5b68ad6534c94ac5b3c3e81a6082d042 [2022-03-15 18:53:06,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 18:53:06,562 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 18:53:06,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 18:53:06,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 18:53:06,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 18:53:06,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:53:06" (1/1) ... [2022-03-15 18:53:06,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ddcd700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06, skipping insertion in model container [2022-03-15 18:53:06,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:53:06" (1/1) ... [2022-03-15 18:53:06,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 18:53:06,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 18:53:06,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c[4210,4223] [2022-03-15 18:53:06,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:53:06,847 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 18:53:06,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c[4210,4223] [2022-03-15 18:53:06,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:53:06,892 INFO L208 MainTranslator]: Completed translation [2022-03-15 18:53:06,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06 WrapperNode [2022-03-15 18:53:06,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 18:53:06,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 18:53:06,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 18:53:06,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 18:53:06,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06" (1/1) ... [2022-03-15 18:53:06,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06" (1/1) ... [2022-03-15 18:53:06,927 INFO L137 Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 235 [2022-03-15 18:53:06,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 18:53:06,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 18:53:06,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 18:53:06,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 18:53:06,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06" (1/1) ... [2022-03-15 18:53:06,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06" (1/1) ... [2022-03-15 18:53:06,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06" (1/1) ... [2022-03-15 18:53:06,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06" (1/1) ... [2022-03-15 18:53:06,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06" (1/1) ... [2022-03-15 18:53:06,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06" (1/1) ... [2022-03-15 18:53:06,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06" (1/1) ... [2022-03-15 18:53:06,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 18:53:06,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 18:53:06,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 18:53:06,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 18:53:06,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06" (1/1) ... [2022-03-15 18:53:06,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:53:06,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:06,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 18:53:06,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 18:53:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 18:53:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 18:53:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 18:53:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 18:53:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 18:53:07,035 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 18:53:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 18:53:07,035 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 18:53:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 18:53:07,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 18:53:07,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 18:53:07,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 18:53:07,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 18:53:07,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 18:53:07,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 18:53:07,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 18:53:07,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 18:53:07,037 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 18:53:07,127 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 18:53:07,128 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 18:53:07,370 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 18:53:07,458 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 18:53:07,458 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-15 18:53:07,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:53:07 BoogieIcfgContainer [2022-03-15 18:53:07,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 18:53:07,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 18:53:07,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 18:53:07,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 18:53:07,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 06:53:06" (1/3) ... [2022-03-15 18:53:07,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711bf911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:53:07, skipping insertion in model container [2022-03-15 18:53:07,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:06" (2/3) ... [2022-03-15 18:53:07,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711bf911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:53:07, skipping insertion in model container [2022-03-15 18:53:07,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:53:07" (3/3) ... [2022-03-15 18:53:07,466 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2022-03-15 18:53:07,469 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 18:53:07,469 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 18:53:07,470 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 18:53:07,470 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 18:53:07,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,502 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,502 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,502 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,502 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,503 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,503 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,503 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,503 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,503 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,503 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,505 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,505 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,505 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,505 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,507 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,507 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,509 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,509 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,509 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,509 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,509 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,510 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,510 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,510 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,511 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,511 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,511 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:07,514 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 18:53:07,552 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 18:53:07,557 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 18:53:07,558 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 18:53:07,567 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 18:53:07,573 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 186 transitions, 396 flow [2022-03-15 18:53:07,575 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 186 transitions, 396 flow [2022-03-15 18:53:07,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 189 places, 186 transitions, 396 flow [2022-03-15 18:53:07,626 INFO L129 PetriNetUnfolder]: 7/183 cut-off events. [2022-03-15 18:53:07,626 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 18:53:07,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 183 events. 7/183 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2022-03-15 18:53:07,630 INFO L116 LiptonReduction]: Number of co-enabled transitions 1266 [2022-03-15 18:53:11,967 INFO L131 LiptonReduction]: Checked pairs total: 8119 [2022-03-15 18:53:11,967 INFO L133 LiptonReduction]: Total number of compositions: 173 [2022-03-15 18:53:11,975 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 40 transitions, 104 flow [2022-03-15 18:53:12,045 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 801 states, 800 states have (on average 2.7575) internal successors, (2206), 800 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:12,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 801 states, 800 states have (on average 2.7575) internal successors, (2206), 800 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 18:53:12,068 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:12,069 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] [2022-03-15 18:53:12,069 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1421328036, now seen corresponding path program 1 times [2022-03-15 18:53:12,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:12,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868018184] [2022-03-15 18:53:12,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:12,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:12,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:12,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868018184] [2022-03-15 18:53:12,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868018184] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:12,401 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:12,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 18:53:12,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1058761393] [2022-03-15 18:53:12,403 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:12,409 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:12,478 INFO L252 McrAutomatonBuilder]: Finished intersection with 257 states and 596 transitions. [2022-03-15 18:53:12,479 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:12,534 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 7 [2022-03-15 18:53:12,621 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 7 [2022-03-15 18:53:12,666 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 7 [2022-03-15 18:53:12,804 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 7 [2022-03-15 18:53:12,955 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 7 [2022-03-15 18:53:13,073 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 7 [2022-03-15 18:53:13,304 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 7 [2022-03-15 18:53:13,405 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 7 [2022-03-15 18:53:13,787 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 7 [2022-03-15 18:53:13,915 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 7 [2022-03-15 18:53:14,180 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1797#(<= ~n~0 0)] [2022-03-15 18:53:14,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 18:53:14,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:14,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 18:53:14,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:53:14,199 INFO L87 Difference]: Start difference. First operand has 801 states, 800 states have (on average 2.7575) internal successors, (2206), 800 states have internal predecessors, (2206), 0 states have call successors, (0), 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 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:14,254 INFO L93 Difference]: Finished difference Result 802 states and 2207 transitions. [2022-03-15 18:53:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:53:14,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 35 [2022-03-15 18:53:14,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:14,270 INFO L225 Difference]: With dead ends: 802 [2022-03-15 18:53:14,270 INFO L226 Difference]: Without dead ends: 802 [2022-03-15 18:53:14,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:53:14,275 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:14,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:53:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-03-15 18:53:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2022-03-15 18:53:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 801 states have (on average 2.755305867665418) internal successors, (2207), 801 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 2207 transitions. [2022-03-15 18:53:14,343 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 2207 transitions. Word has length 35 [2022-03-15 18:53:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:14,343 INFO L470 AbstractCegarLoop]: Abstraction has 802 states and 2207 transitions. [2022-03-15 18:53:14,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 2207 transitions. [2022-03-15 18:53:14,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 18:53:14,347 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:14,347 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] [2022-03-15 18:53:14,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 18:53:14,347 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:14,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1018399720, now seen corresponding path program 1 times [2022-03-15 18:53:14,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:14,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611335216] [2022-03-15 18:53:14,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:14,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:14,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611335216] [2022-03-15 18:53:14,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611335216] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:14,514 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:14,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:53:14,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [24009707] [2022-03-15 18:53:14,514 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:14,519 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:14,680 INFO L252 McrAutomatonBuilder]: Finished intersection with 258 states and 597 transitions. [2022-03-15 18:53:14,680 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:16,818 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [4213#(and (or (not (< ~n2~0 ~n1~0)) (<= 1 ~n2~0)) (or (<= 1 ~n2~0) (not (= ~n1~0 0))) (or (not (< ~n2~0 ~n1~0)) (<= ~n2~0 ~tmp1~0)) (or (<= ~n2~0 ~tmp1~0) (not (= ~n1~0 0)))), 4212#(not (= ~n2~0 0)), 4211#(and (not (<= (+ ~tmp1~0 1) ~n2~0)) (not (= ~n2~0 0))), 4214#(<= 0 ~tmp2~0), 4215#(<= 0 ~n1~0)] [2022-03-15 18:53:16,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:53:16,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:16,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:53:16,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:53:16,820 INFO L87 Difference]: Start difference. First operand 802 states and 2207 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:17,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:17,145 INFO L93 Difference]: Finished difference Result 1654 states and 4545 transitions. [2022-03-15 18:53:17,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:53:17,145 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 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 36 [2022-03-15 18:53:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:17,152 INFO L225 Difference]: With dead ends: 1654 [2022-03-15 18:53:17,153 INFO L226 Difference]: Without dead ends: 1654 [2022-03-15 18:53:17,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 181 SyntacticMatches, 22 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-15 18:53:17,166 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 163 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:17,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 127 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:53:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2022-03-15 18:53:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 970. [2022-03-15 18:53:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 2.754385964912281) internal successors, (2669), 969 states have internal predecessors, (2669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2669 transitions. [2022-03-15 18:53:17,208 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2669 transitions. Word has length 36 [2022-03-15 18:53:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:17,217 INFO L470 AbstractCegarLoop]: Abstraction has 970 states and 2669 transitions. [2022-03-15 18:53:17,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2669 transitions. [2022-03-15 18:53:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 18:53:17,219 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:17,219 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] [2022-03-15 18:53:17,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 18:53:17,219 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:17,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:17,220 INFO L85 PathProgramCache]: Analyzing trace with hash 695423692, now seen corresponding path program 2 times [2022-03-15 18:53:17,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:17,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206631537] [2022-03-15 18:53:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:17,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:17,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206631537] [2022-03-15 18:53:17,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206631537] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:17,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:17,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:53:17,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1636564189] [2022-03-15 18:53:17,270 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:17,275 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:17,351 INFO L252 McrAutomatonBuilder]: Finished intersection with 257 states and 617 transitions. [2022-03-15 18:53:17,352 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:18,425 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7827#(not (= (mod ~e1~0 256) 0))] [2022-03-15 18:53:18,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 18:53:18,425 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:18,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 18:53:18,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:53:18,426 INFO L87 Difference]: Start difference. First operand 970 states and 2669 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:18,471 INFO L93 Difference]: Finished difference Result 910 states and 2459 transitions. [2022-03-15 18:53:18,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:53:18,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 36 [2022-03-15 18:53:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:18,474 INFO L225 Difference]: With dead ends: 910 [2022-03-15 18:53:18,474 INFO L226 Difference]: Without dead ends: 910 [2022-03-15 18:53:18,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 200 SyntacticMatches, 21 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:53:18,475 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:18,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 21 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:53:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2022-03-15 18:53:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2022-03-15 18:53:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 909 states have (on average 2.7051705170517053) internal successors, (2459), 909 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 2459 transitions. [2022-03-15 18:53:18,491 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 2459 transitions. Word has length 36 [2022-03-15 18:53:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:18,491 INFO L470 AbstractCegarLoop]: Abstraction has 910 states and 2459 transitions. [2022-03-15 18:53:18,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 2459 transitions. [2022-03-15 18:53:18,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 18:53:18,493 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:18,493 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] [2022-03-15 18:53:18,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 18:53:18,493 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:18,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:18,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1658839510, now seen corresponding path program 3 times [2022-03-15 18:53:18,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:18,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827478164] [2022-03-15 18:53:18,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:18,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:18,725 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:18,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827478164] [2022-03-15 18:53:18,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827478164] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:18,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868574204] [2022-03-15 18:53:18,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:53:18,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:18,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:18,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:53:18,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 18:53:18,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 18:53:18,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:18,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 18:53:18,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:18,977 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:18,977 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:53:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:18,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:53:18,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868574204] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:18,993 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:53:18,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 15 [2022-03-15 18:53:18,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [78635072] [2022-03-15 18:53:18,994 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:18,998 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:19,055 INFO L252 McrAutomatonBuilder]: Finished intersection with 211 states and 479 transitions. [2022-03-15 18:53:19,056 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:20,983 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [10681#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 10682#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 10680#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)) 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 10679#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 10684#(or (< ~i~0 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 10683#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset))))] [2022-03-15 18:53:20,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:53:20,983 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:20,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:53:20,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-03-15 18:53:20,984 INFO L87 Difference]: Start difference. First operand 910 states and 2459 transitions. Second operand has 13 states, 12 states have (on average 6.583333333333333) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:21,486 INFO L93 Difference]: Finished difference Result 1440 states and 3735 transitions. [2022-03-15 18:53:21,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 18:53:21,487 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.583333333333333) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 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 36 [2022-03-15 18:53:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:21,492 INFO L225 Difference]: With dead ends: 1440 [2022-03-15 18:53:21,492 INFO L226 Difference]: Without dead ends: 1344 [2022-03-15 18:53:21,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:53:21,493 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 139 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:21,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 297 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 790 Invalid, 0 Unknown, 256 Unchecked, 0.4s Time] [2022-03-15 18:53:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-03-15 18:53:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1054. [2022-03-15 18:53:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 1053 states have (on average 2.7056030389363723) internal successors, (2849), 1053 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 2849 transitions. [2022-03-15 18:53:21,512 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 2849 transitions. Word has length 36 [2022-03-15 18:53:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:21,512 INFO L470 AbstractCegarLoop]: Abstraction has 1054 states and 2849 transitions. [2022-03-15 18:53:21,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.583333333333333) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 2849 transitions. [2022-03-15 18:53:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 18:53:21,514 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:21,514 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] [2022-03-15 18:53:21,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 18:53:21,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:21,727 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash 604966254, now seen corresponding path program 4 times [2022-03-15 18:53:21,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:21,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826923633] [2022-03-15 18:53:21,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:21,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:21,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:21,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826923633] [2022-03-15 18:53:21,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826923633] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:21,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392108829] [2022-03-15 18:53:21,976 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:53:21,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:21,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:21,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:53:21,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 18:53:22,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:53:22,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:22,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:53:22,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:22,162 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:22,162 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:53:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:22,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:53:22,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392108829] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:22,179 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:53:22,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2022-03-15 18:53:22,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1428185532] [2022-03-15 18:53:22,180 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:22,184 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:22,222 INFO L252 McrAutomatonBuilder]: Finished intersection with 211 states and 479 transitions. [2022-03-15 18:53:22,222 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:23,997 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [14377#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 14373#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 14374#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 14372#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 14370#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 14375#(or (< ~i~0 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 14376#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)) 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)) 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 14371#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)) 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0))] [2022-03-15 18:53:23,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:53:23,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:23,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:53:23,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:53:23,998 INFO L87 Difference]: Start difference. First operand 1054 states and 2849 transitions. Second operand has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:24,526 INFO L93 Difference]: Finished difference Result 1395 states and 3608 transitions. [2022-03-15 18:53:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 18:53:24,526 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 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 36 [2022-03-15 18:53:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:24,531 INFO L225 Difference]: With dead ends: 1395 [2022-03-15 18:53:24,531 INFO L226 Difference]: Without dead ends: 1316 [2022-03-15 18:53:24,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:53:24,532 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 171 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:24,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 304 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 746 Invalid, 0 Unknown, 229 Unchecked, 0.4s Time] [2022-03-15 18:53:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-03-15 18:53:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1064. [2022-03-15 18:53:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 1063 states have (on average 2.6641580432737535) internal successors, (2832), 1063 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 2832 transitions. [2022-03-15 18:53:24,550 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 2832 transitions. Word has length 36 [2022-03-15 18:53:24,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:24,550 INFO L470 AbstractCegarLoop]: Abstraction has 1064 states and 2832 transitions. [2022-03-15 18:53:24,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 2832 transitions. [2022-03-15 18:53:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 18:53:24,552 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:24,552 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] [2022-03-15 18:53:24,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 18:53:24,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:24,759 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1367459716, now seen corresponding path program 5 times [2022-03-15 18:53:24,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:24,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668070933] [2022-03-15 18:53:24,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:24,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:25,009 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:25,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668070933] [2022-03-15 18:53:25,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668070933] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:25,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519797056] [2022-03-15 18:53:25,009 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:53:25,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:25,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:25,011 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:53:25,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 18:53:25,102 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:53:25,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:25,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 18:53:25,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:25,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 18:53:25,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 18:53:25,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 18:53:25,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 18:53:25,593 INFO L353 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-03-15 18:53:25,594 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2022-03-15 18:53:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:25,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:26,384 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:26,384 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 190 treesize of output 130 [2022-03-15 18:53:26,394 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:26,395 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1424 treesize of output 1348 [2022-03-15 18:53:26,413 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:26,413 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1328 treesize of output 1060 [2022-03-15 18:53:26,432 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:26,432 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1040 treesize of output 916 [2022-03-15 18:53:26,470 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:26,470 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 896 treesize of output 844 [2022-03-15 18:53:26,481 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 18:53:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:28,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519797056] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:28,196 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:28,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-03-15 18:53:28,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [813394369] [2022-03-15 18:53:28,196 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:28,200 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:28,235 INFO L252 McrAutomatonBuilder]: Finished intersection with 211 states and 479 transitions. [2022-03-15 18:53:28,235 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:34,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [18156#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0)) (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~f~0.offset 0)) (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)) 0) (<= (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)) 4) ~f~0.offset) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))))), 18154#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0) (< 0 (+ (* ~i~0 4) ~f~0.offset 1)) (= ~f~0.offset 0) (<= (+ (* ~i~0 4) ~f~0.offset) 0)), 18155#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)) (or (< ~i~0 0) (<= ~n~0 ~i~0) (<= (+ (* ~i~0 4) ~f~0.offset) 0)) (or (< ~i~0 0) (<= ~n~0 ~i~0) (= ~f~0.offset 0))), 18153#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), 18157#(and (or (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0) (= ~f~0.offset 0)) (or (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0) (<= (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset) 0)) (or (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0)))] [2022-03-15 18:53:34,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:53:34,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:34,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:53:34,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1013, Unknown=9, NotChecked=0, Total=1190 [2022-03-15 18:53:34,396 INFO L87 Difference]: Start difference. First operand 1064 states and 2832 transitions. Second operand has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:36,230 INFO L93 Difference]: Finished difference Result 2596 states and 6641 transitions. [2022-03-15 18:53:36,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 18:53:36,231 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 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 36 [2022-03-15 18:53:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:36,238 INFO L225 Difference]: With dead ends: 2596 [2022-03-15 18:53:36,238 INFO L226 Difference]: Without dead ends: 2189 [2022-03-15 18:53:36,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 129 SyntacticMatches, 78 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=416, Invalid=2655, Unknown=9, NotChecked=0, Total=3080 [2022-03-15 18:53:36,240 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 399 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:36,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 320 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 18:53:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2022-03-15 18:53:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1381. [2022-03-15 18:53:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1380 states have (on average 2.6739130434782608) internal successors, (3690), 1380 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 3690 transitions. [2022-03-15 18:53:36,291 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 3690 transitions. Word has length 36 [2022-03-15 18:53:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:36,292 INFO L470 AbstractCegarLoop]: Abstraction has 1381 states and 3690 transitions. [2022-03-15 18:53:36,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 3690 transitions. [2022-03-15 18:53:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 18:53:36,294 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:36,294 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] [2022-03-15 18:53:36,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 18:53:36,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:36,510 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:36,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash 145444652, now seen corresponding path program 6 times [2022-03-15 18:53:36,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:36,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57640436] [2022-03-15 18:53:36,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:36,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:36,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:36,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57640436] [2022-03-15 18:53:36,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57640436] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:36,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310575900] [2022-03-15 18:53:36,779 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:53:36,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:36,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:36,780 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:53:36,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 18:53:36,880 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 18:53:36,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:36,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:53:36,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:36,986 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:36,986 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:53:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:37,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:53:37,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310575900] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:37,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:53:37,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2022-03-15 18:53:37,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1659899634] [2022-03-15 18:53:37,002 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:37,009 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:37,068 INFO L252 McrAutomatonBuilder]: Finished intersection with 211 states and 479 transitions. [2022-03-15 18:53:37,068 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:39,296 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [23683#(or (< (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0)), 23681#(or (< ~i~0 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)), 23680#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)), 23682#(or (< (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)) 4) ~f~0.offset)) 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0)), 23684#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 23679#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)))), 23678#(or (< ~i~0 0) (= ~j~0 ~i~0))] [2022-03-15 18:53:39,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:53:39,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:39,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:53:39,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-03-15 18:53:39,297 INFO L87 Difference]: Start difference. First operand 1381 states and 3690 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:39,952 INFO L93 Difference]: Finished difference Result 1812 states and 4725 transitions. [2022-03-15 18:53:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 18:53:39,953 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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 36 [2022-03-15 18:53:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:39,957 INFO L225 Difference]: With dead ends: 1812 [2022-03-15 18:53:39,957 INFO L226 Difference]: Without dead ends: 1303 [2022-03-15 18:53:39,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:53:39,958 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 177 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:39,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 300 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:53:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2022-03-15 18:53:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 801. [2022-03-15 18:53:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 800 states have (on average 2.59375) internal successors, (2075), 800 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 2075 transitions. [2022-03-15 18:53:39,972 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 2075 transitions. Word has length 36 [2022-03-15 18:53:39,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:39,972 INFO L470 AbstractCegarLoop]: Abstraction has 801 states and 2075 transitions. [2022-03-15 18:53:39,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 2075 transitions. [2022-03-15 18:53:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 18:53:39,974 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:39,974 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] [2022-03-15 18:53:39,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 18:53:40,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:40,195 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2099521924, now seen corresponding path program 7 times [2022-03-15 18:53:40,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:40,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985181230] [2022-03-15 18:53:40,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:40,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:40,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:40,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985181230] [2022-03-15 18:53:40,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985181230] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:40,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743422181] [2022-03-15 18:53:40,408 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:53:40,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:40,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:40,410 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:53:40,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 18:53:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:40,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 18:53:40,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:40,533 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-03-15 18:53:40,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 18:53:40,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 18:53:40,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:53:40,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 29 treesize of output 29 [2022-03-15 18:53:41,004 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-03-15 18:53:41,004 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 20 [2022-03-15 18:53:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:41,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:41,092 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_294 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~f~0.base))) (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* c_~j~0 4))) 4) c_~f~0.offset))) c_~i~0)) is different from false [2022-03-15 18:53:41,108 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (<= c_~n~0 0))) (and (or (forall ((v_ArrVal_294 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~f~0.base))) (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* c_~j~0 4))) 4) c_~f~0.offset))) 0)) .cse1) (or (forall ((v_ArrVal_294 (Array Int Int))) (<= c_~n~0 (+ (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~f~0.base))) (select .cse2 (+ (* (select .cse2 (+ c_~f~0.offset (* c_~j~0 4))) 4) c_~f~0.offset))) 1))) .cse1))) is different from false [2022-03-15 18:53:41,161 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_294 (Array Int Int))) (<= c_~n~0 (+ (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~f~0.base))) (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* c_~j~0 4))) 4) c_~f~0.offset))) 1))) (forall ((v_ArrVal_294 (Array Int Int))) (<= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~f~0.base))) (select .cse1 (+ (* (select .cse1 (+ c_~f~0.offset (* c_~j~0 4))) 4) c_~f~0.offset))) 0))) (<= c_~n~0 c_~i~0) (< c_~i~0 0)) is different from false [2022-03-15 18:53:41,174 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~f~0.base) (+ c_~f~0.offset (* c_~i2~0 4))))) (or (< .cse0 0) (and (forall ((v_ArrVal_294 (Array Int Int))) (<= c_~n~0 (+ (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~f~0.base))) (select .cse1 (+ (* (select .cse1 (+ c_~f~0.offset (* c_~j~0 4))) 4) c_~f~0.offset))) 1))) (forall ((v_ArrVal_294 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~f~0.base))) (select .cse2 (+ (* (select .cse2 (+ c_~f~0.offset (* c_~j~0 4))) 4) c_~f~0.offset))) 0))) (<= c_~n~0 .cse0))) is different from false [2022-03-15 18:53:41,188 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~f~0.base) (+ c_~f~0.offset (* c_~i~0 4))))) (or (< .cse0 0) (and (forall ((v_ArrVal_294 (Array Int Int))) (<= c_~n~0 (+ (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~f~0.base))) (select .cse1 (+ (* (select .cse1 (+ c_~f~0.offset (* c_~j~0 4))) 4) c_~f~0.offset))) 1))) (forall ((v_ArrVal_294 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~f~0.base))) (select .cse2 (+ (* (select .cse2 (+ c_~f~0.offset (* c_~j~0 4))) 4) c_~f~0.offset))) 0))) (<= c_~n~0 .cse0))) is different from false [2022-03-15 18:53:41,539 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:41,539 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 184 treesize of output 124 [2022-03-15 18:53:41,558 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:41,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1980 treesize of output 1860 [2022-03-15 18:53:41,576 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:41,576 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1860 treesize of output 1640 [2022-03-15 18:53:41,618 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:41,619 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1640 treesize of output 1540 [2022-03-15 18:53:41,646 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:41,646 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1453 treesize of output 1192 [2022-03-15 18:53:41,672 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:41,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 1165 treesize of output 904 [2022-03-15 18:53:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:47,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743422181] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:47,629 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:47,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2022-03-15 18:53:47,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1088463702] [2022-03-15 18:53:47,629 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:47,632 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:47,643 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 98 transitions. [2022-03-15 18:53:47,643 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:48,129 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [27358#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), 27359#(or (< ~i~0 0) (<= ~n~0 ~i~0) (= ~j~0 ~i~0)), 27360#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (<= (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset) 0) (<= ~n~0 1)) (or (< ~i~0 0) (<= ~n~0 ~i~0) (= ~f~0.offset 0)) (or (< ~i~0 0) (<= ~n~0 ~i~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))))] [2022-03-15 18:53:48,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:53:48,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:48,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:53:48,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=608, Unknown=6, NotChecked=270, Total=992 [2022-03-15 18:53:48,131 INFO L87 Difference]: Start difference. First operand 801 states and 2075 transitions. Second operand has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:48,842 INFO L93 Difference]: Finished difference Result 2191 states and 5497 transitions. [2022-03-15 18:53:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 18:53:48,842 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 18:53:48,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:48,847 INFO L225 Difference]: With dead ends: 2191 [2022-03-15 18:53:48,847 INFO L226 Difference]: Without dead ends: 1438 [2022-03-15 18:53:48,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=319, Invalid=1335, Unknown=6, NotChecked=410, Total=2070 [2022-03-15 18:53:48,848 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 528 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:48,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [528 Valid, 160 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:53:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2022-03-15 18:53:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1208. [2022-03-15 18:53:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1207 states have (on average 2.5865782932891466) internal successors, (3122), 1207 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 3122 transitions. [2022-03-15 18:53:48,869 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 3122 transitions. Word has length 36 [2022-03-15 18:53:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:48,869 INFO L470 AbstractCegarLoop]: Abstraction has 1208 states and 3122 transitions. [2022-03-15 18:53:48,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 3122 transitions. [2022-03-15 18:53:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 18:53:48,871 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:48,872 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] [2022-03-15 18:53:48,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 18:53:49,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:49,097 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:49,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash -449528190, now seen corresponding path program 8 times [2022-03-15 18:53:49,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:49,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563146006] [2022-03-15 18:53:49,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:49,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:49,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:49,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563146006] [2022-03-15 18:53:49,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563146006] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:49,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:49,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:53:49,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1293166249] [2022-03-15 18:53:49,178 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:49,181 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:49,227 INFO L252 McrAutomatonBuilder]: Finished intersection with 289 states and 684 transitions. [2022-03-15 18:53:49,227 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:51,497 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [32006#(and (= ~tmp1~0 0) (= ~n1~0 0)), 32005#(and (<= ~n1~0 (+ ~tmp2~0 1)) (not (= ~n1~0 0))), 32003#(and (not (<= ~n1~0 ~n2~0)) (not (= ~n2~0 0))), 32004#(and (or (not (<= ~n1~0 ~n2~0)) (not (= ~n1~0 0))) (or (not (< ~n2~0 ~n1~0)) (not (= ~n2~0 0))))] [2022-03-15 18:53:51,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 18:53:51,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:51,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 18:53:51,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-03-15 18:53:51,498 INFO L87 Difference]: Start difference. First operand 1208 states and 3122 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:51,783 INFO L93 Difference]: Finished difference Result 1604 states and 4108 transitions. [2022-03-15 18:53:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 18:53:51,784 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 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 36 [2022-03-15 18:53:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:51,788 INFO L225 Difference]: With dead ends: 1604 [2022-03-15 18:53:51,788 INFO L226 Difference]: Without dead ends: 1436 [2022-03-15 18:53:51,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 203 SyntacticMatches, 28 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-03-15 18:53:51,790 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 103 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:51,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 119 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:53:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2022-03-15 18:53:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1340. [2022-03-15 18:53:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1339 states have (on average 2.59596713965646) internal successors, (3476), 1339 states have internal predecessors, (3476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 3476 transitions. [2022-03-15 18:53:51,809 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 3476 transitions. Word has length 36 [2022-03-15 18:53:51,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:51,810 INFO L470 AbstractCegarLoop]: Abstraction has 1340 states and 3476 transitions. [2022-03-15 18:53:51,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 3476 transitions. [2022-03-15 18:53:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 18:53:51,812 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:51,812 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] [2022-03-15 18:53:51,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 18:53:51,813 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1831048916, now seen corresponding path program 9 times [2022-03-15 18:53:51,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:51,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883294521] [2022-03-15 18:53:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:51,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:51,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883294521] [2022-03-15 18:53:51,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883294521] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:51,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:51,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 18:53:51,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774524839] [2022-03-15 18:53:51,876 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:51,879 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:51,956 INFO L252 McrAutomatonBuilder]: Finished intersection with 287 states and 674 transitions. [2022-03-15 18:53:51,956 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:53,749 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [36311#(and (or (<= 1 ~n1~0) (not (<= ~n1~0 ~n2~0))) (or (not (<= ~n1~0 ~n2~0)) (<= (+ ~n1~0 1) ~n2~0)) (not (= ~n2~0 0))), 36310#(and (not (<= ~n1~0 ~n2~0)) (not (= ~n2~0 0)))] [2022-03-15 18:53:53,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:53:53,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:53,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:53:53,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:53:53,750 INFO L87 Difference]: Start difference. First operand 1340 states and 3476 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:53,891 INFO L93 Difference]: Finished difference Result 1108 states and 2774 transitions. [2022-03-15 18:53:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 18:53:53,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 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 36 [2022-03-15 18:53:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:53,895 INFO L225 Difference]: With dead ends: 1108 [2022-03-15 18:53:53,895 INFO L226 Difference]: Without dead ends: 843 [2022-03-15 18:53:53,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 210 SyntacticMatches, 21 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-03-15 18:53:53,895 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 101 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:53,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 78 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:53:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-03-15 18:53:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 617. [2022-03-15 18:53:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 2.5032467532467533) internal successors, (1542), 616 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1542 transitions. [2022-03-15 18:53:53,913 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1542 transitions. Word has length 36 [2022-03-15 18:53:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:53,914 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 1542 transitions. [2022-03-15 18:53:53,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1542 transitions. [2022-03-15 18:53:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:53:53,915 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:53,915 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:53,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 18:53:53,916 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1705397832, now seen corresponding path program 10 times [2022-03-15 18:53:53,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:53,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572543407] [2022-03-15 18:53:53,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:53,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:54,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:54,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572543407] [2022-03-15 18:53:54,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572543407] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:54,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770291395] [2022-03-15 18:53:54,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:53:54,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:54,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:54,282 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:53:54,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 18:53:54,372 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:53:54,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:54,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:53:54,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:54,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:53:54,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-03-15 18:53:54,602 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:54,602 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:53:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:53:54,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:53:54,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770291395] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:54,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:53:54,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2022-03-15 18:53:54,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [647649711] [2022-03-15 18:53:54,613 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:54,617 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:54,628 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 99 transitions. [2022-03-15 18:53:54,629 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:55,042 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [38793#(or (< ~i~0 0) (= ~j~0 ~i~0)), 38792#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 38794#(or (< ~i~0 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0))] [2022-03-15 18:53:55,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:53:55,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:55,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:53:55,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:53:55,043 INFO L87 Difference]: Start difference. First operand 617 states and 1542 transitions. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:55,295 INFO L93 Difference]: Finished difference Result 636 states and 1567 transitions. [2022-03-15 18:53:55,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 18:53:55,295 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 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 37 [2022-03-15 18:53:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:55,297 INFO L225 Difference]: With dead ends: 636 [2022-03-15 18:53:55,297 INFO L226 Difference]: Without dead ends: 609 [2022-03-15 18:53:55,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:53:55,298 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 160 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:55,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 128 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:53:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-03-15 18:53:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2022-03-15 18:53:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 2.5) internal successors, (1520), 608 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1520 transitions. [2022-03-15 18:53:55,306 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1520 transitions. Word has length 37 [2022-03-15 18:53:55,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:55,307 INFO L470 AbstractCegarLoop]: Abstraction has 609 states and 1520 transitions. [2022-03-15 18:53:55,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1520 transitions. [2022-03-15 18:53:55,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:53:55,308 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:55,308 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:55,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 18:53:55,524 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-03-15 18:53:55,525 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:55,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:55,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1925001830, now seen corresponding path program 11 times [2022-03-15 18:53:55,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:55,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406490419] [2022-03-15 18:53:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:55,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:55,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:55,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406490419] [2022-03-15 18:53:55,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406490419] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:55,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777449229] [2022-03-15 18:53:55,922 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:53:55,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:55,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:55,923 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:53:55,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 18:53:56,002 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:53:56,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:56,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 18:53:56,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:56,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:53:56,140 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-03-15 18:53:56,180 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:56,180 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:53:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:56,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:56,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* c_~i1~0 4))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* c_~j~0 4))) 4)))))) is different from false [2022-03-15 18:53:56,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* c_~i~0 4))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* c_~j~0 4))) 4)))))) is different from false [2022-03-15 18:53:56,265 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:56,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 122 [2022-03-15 18:53:56,280 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:56,280 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 57 [2022-03-15 18:53:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:53:56,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777449229] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:56,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:53:56,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2022-03-15 18:53:56,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [819688952] [2022-03-15 18:53:56,778 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:56,782 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:56,799 INFO L252 McrAutomatonBuilder]: Finished intersection with 105 states and 191 transitions. [2022-03-15 18:53:56,799 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:57,629 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [40907#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 40904#(= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset))), 40906#(or (< ~i~0 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 40903#(= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0), 40905#(or (< ~i~0 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0))] [2022-03-15 18:53:57,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:53:57,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:57,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:53:57,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=845, Unknown=2, NotChecked=118, Total=1056 [2022-03-15 18:53:57,630 INFO L87 Difference]: Start difference. First operand 609 states and 1520 transitions. Second operand has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:58,007 INFO L93 Difference]: Finished difference Result 616 states and 1526 transitions. [2022-03-15 18:53:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:53:58,007 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 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 37 [2022-03-15 18:53:58,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:58,009 INFO L225 Difference]: With dead ends: 616 [2022-03-15 18:53:58,009 INFO L226 Difference]: Without dead ends: 455 [2022-03-15 18:53:58,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=1278, Unknown=2, NotChecked=146, Total=1560 [2022-03-15 18:53:58,010 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 115 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:58,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 188 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 524 Invalid, 0 Unknown, 137 Unchecked, 0.2s Time] [2022-03-15 18:53:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-03-15 18:53:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2022-03-15 18:53:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 2.563876651982379) internal successors, (1164), 454 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1164 transitions. [2022-03-15 18:53:58,021 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1164 transitions. Word has length 37 [2022-03-15 18:53:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:58,021 INFO L470 AbstractCegarLoop]: Abstraction has 455 states and 1164 transitions. [2022-03-15 18:53:58,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1164 transitions. [2022-03-15 18:53:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:53:58,022 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:58,022 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:58,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 18:53:58,239 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-03-15 18:53:58,239 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash 376664104, now seen corresponding path program 12 times [2022-03-15 18:53:58,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:58,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040260328] [2022-03-15 18:53:58,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:58,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:53:58,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:58,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040260328] [2022-03-15 18:53:58,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040260328] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:58,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189417459] [2022-03-15 18:53:58,546 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:53:58,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:58,547 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:53:58,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 18:53:58,634 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 18:53:58,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:58,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 18:53:58,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:58,771 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:53:58,771 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:53:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:53:58,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:53:58,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189417459] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:58,783 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:53:58,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2022-03-15 18:53:58,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [467384225] [2022-03-15 18:53:58,783 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:58,787 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:58,830 INFO L252 McrAutomatonBuilder]: Finished intersection with 244 states and 562 transitions. [2022-03-15 18:53:58,831 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:00,832 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [42577#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 42578#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 42581#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 42579#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 42575#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 42576#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 42582#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 42580#(or (< ~i~0 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset))))] [2022-03-15 18:54:00,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:54:00,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:00,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:54:00,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:54:00,833 INFO L87 Difference]: Start difference. First operand 455 states and 1164 transitions. Second operand has 15 states, 14 states have (on average 6.214285714285714) internal successors, (87), 15 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:01,231 INFO L93 Difference]: Finished difference Result 740 states and 1828 transitions. [2022-03-15 18:54:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 18:54:01,231 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.214285714285714) internal successors, (87), 15 states have internal predecessors, (87), 0 states have call successors, (0), 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 37 [2022-03-15 18:54:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:01,233 INFO L225 Difference]: With dead ends: 740 [2022-03-15 18:54:01,233 INFO L226 Difference]: Without dead ends: 705 [2022-03-15 18:54:01,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:54:01,234 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:01,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 322 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 637 Invalid, 0 Unknown, 224 Unchecked, 0.3s Time] [2022-03-15 18:54:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-03-15 18:54:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 600. [2022-03-15 18:54:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 2.5809682804674456) internal successors, (1546), 599 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1546 transitions. [2022-03-15 18:54:01,244 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1546 transitions. Word has length 37 [2022-03-15 18:54:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:01,244 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 1546 transitions. [2022-03-15 18:54:01,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.214285714285714) internal successors, (87), 15 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1546 transitions. [2022-03-15 18:54:01,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:54:01,245 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:01,245 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:01,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 18:54:01,461 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-03-15 18:54:01,462 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:01,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:01,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1314336260, now seen corresponding path program 13 times [2022-03-15 18:54:01,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:01,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457592918] [2022-03-15 18:54:01,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:01,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:01,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457592918] [2022-03-15 18:54:01,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457592918] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:01,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347488854] [2022-03-15 18:54:01,682 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:54:01,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:01,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:01,683 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:01,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 18:54:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:01,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 18:54:01,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:01,895 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:01,895 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:54:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:01,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:02,005 INFO L353 Elim1Store]: treesize reduction 14, result has 80.8 percent of original size [2022-03-15 18:54:02,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-03-15 18:54:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:54:02,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347488854] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:02,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:54:02,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 18 [2022-03-15 18:54:02,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [157164696] [2022-03-15 18:54:02,079 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:02,083 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:02,126 INFO L252 McrAutomatonBuilder]: Finished intersection with 244 states and 562 transitions. [2022-03-15 18:54:02,127 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:04,461 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [44777#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0)), 44784#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 44780#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 44775#(or (< ~i~0 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)), 44782#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 44783#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 44785#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 44781#(or (< ~i~0 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 44778#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 44776#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 44779#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0))] [2022-03-15 18:54:04,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 18:54:04,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:04,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 18:54:04,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:54:04,462 INFO L87 Difference]: Start difference. First operand 600 states and 1546 transitions. Second operand has 18 states, 17 states have (on average 6.882352941176471) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:05,046 INFO L93 Difference]: Finished difference Result 704 states and 1757 transitions. [2022-03-15 18:54:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 18:54:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.882352941176471) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 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 37 [2022-03-15 18:54:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:05,048 INFO L225 Difference]: With dead ends: 704 [2022-03-15 18:54:05,048 INFO L226 Difference]: Without dead ends: 318 [2022-03-15 18:54:05,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=1265, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 18:54:05,049 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 116 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:05,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 418 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:54:05,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-03-15 18:54:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 285. [2022-03-15 18:54:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.306338028169014) internal successors, (655), 284 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 655 transitions. [2022-03-15 18:54:05,053 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 655 transitions. Word has length 37 [2022-03-15 18:54:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:05,053 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 655 transitions. [2022-03-15 18:54:05,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.882352941176471) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 655 transitions. [2022-03-15 18:54:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:54:05,054 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:05,054 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:05,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 18:54:05,255 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-03-15 18:54:05,255 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:05,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash -811265542, now seen corresponding path program 14 times [2022-03-15 18:54:05,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:05,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691358538] [2022-03-15 18:54:05,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:05,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:05,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:05,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691358538] [2022-03-15 18:54:05,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691358538] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:05,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334246872] [2022-03-15 18:54:05,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:54:05,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:05,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:05,661 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:05,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 18:54:05,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 18:54:05,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:05,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:54:05,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:05,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:05,866 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-03-15 18:54:05,957 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:05,957 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:54:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:54:05,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:54:05,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334246872] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:05,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:54:05,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 20 [2022-03-15 18:54:05,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [846403421] [2022-03-15 18:54:05,968 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:05,972 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:05,993 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 257 transitions. [2022-03-15 18:54:05,994 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:06,718 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [46207#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 46208#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 46209#(or (< ~i~0 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 46210#(or (< ~i~0 0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), 46206#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0))] [2022-03-15 18:54:06,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:54:06,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:06,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:54:06,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2022-03-15 18:54:06,719 INFO L87 Difference]: Start difference. First operand 285 states and 655 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:07,029 INFO L93 Difference]: Finished difference Result 558 states and 1242 transitions. [2022-03-15 18:54:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 18:54:07,029 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 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 37 [2022-03-15 18:54:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:07,031 INFO L225 Difference]: With dead ends: 558 [2022-03-15 18:54:07,031 INFO L226 Difference]: Without dead ends: 497 [2022-03-15 18:54:07,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 18:54:07,032 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 189 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:07,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 187 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 495 Invalid, 0 Unknown, 161 Unchecked, 0.2s Time] [2022-03-15 18:54:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-03-15 18:54:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 406. [2022-03-15 18:54:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 2.360493827160494) internal successors, (956), 405 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 956 transitions. [2022-03-15 18:54:07,037 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 956 transitions. Word has length 37 [2022-03-15 18:54:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:07,038 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 956 transitions. [2022-03-15 18:54:07,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 956 transitions. [2022-03-15 18:54:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:54:07,038 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:07,038 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:07,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 18:54:07,242 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-03-15 18:54:07,242 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:07,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:07,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1792701390, now seen corresponding path program 15 times [2022-03-15 18:54:07,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:07,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034198919] [2022-03-15 18:54:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:07,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:07,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:07,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034198919] [2022-03-15 18:54:07,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034198919] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:07,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311003586] [2022-03-15 18:54:07,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:54:07,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:07,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:07,636 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:07,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 18:54:07,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 18:54:07,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:07,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:54:07,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:07,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:07,849 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-03-15 18:54:07,938 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:07,938 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:54:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:54:07,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:54:07,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311003586] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:07,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:54:07,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 20 [2022-03-15 18:54:07,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [327980410] [2022-03-15 18:54:07,949 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:07,953 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:07,974 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 257 transitions. [2022-03-15 18:54:07,974 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:08,890 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [47727#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 47726#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), 47729#(or (< ~i~0 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 47725#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 47728#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 47730#(or (< ~i~0 0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))] [2022-03-15 18:54:08,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:54:08,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:08,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:54:08,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:54:08,891 INFO L87 Difference]: Start difference. First operand 406 states and 956 transitions. Second operand has 16 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:09,104 INFO L93 Difference]: Finished difference Result 545 states and 1195 transitions. [2022-03-15 18:54:09,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 18:54:09,104 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 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 37 [2022-03-15 18:54:09,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:09,105 INFO L225 Difference]: With dead ends: 545 [2022-03-15 18:54:09,105 INFO L226 Difference]: Without dead ends: 493 [2022-03-15 18:54:09,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=1186, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 18:54:09,106 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 173 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:09,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 163 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 329 Invalid, 0 Unknown, 193 Unchecked, 0.1s Time] [2022-03-15 18:54:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-03-15 18:54:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 400. [2022-03-15 18:54:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 2.3283208020050123) internal successors, (929), 399 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 929 transitions. [2022-03-15 18:54:09,112 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 929 transitions. Word has length 37 [2022-03-15 18:54:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:09,112 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 929 transitions. [2022-03-15 18:54:09,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 929 transitions. [2022-03-15 18:54:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:54:09,112 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:09,112 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:09,129 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-03-15 18:54:09,327 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-03-15 18:54:09,327 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:09,328 INFO L85 PathProgramCache]: Analyzing trace with hash 804926968, now seen corresponding path program 16 times [2022-03-15 18:54:09,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:09,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882468991] [2022-03-15 18:54:09,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:09,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:09,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882468991] [2022-03-15 18:54:09,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882468991] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:09,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866328546] [2022-03-15 18:54:09,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:54:09,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:09,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:09,625 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:09,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 18:54:09,731 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:54:09,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:09,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:54:09,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:09,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:09,858 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-03-15 18:54:09,943 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:09,943 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:54:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:54:09,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:54:09,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866328546] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:09,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:54:09,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2022-03-15 18:54:09,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1581668604] [2022-03-15 18:54:09,954 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:09,958 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:09,979 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 257 transitions. [2022-03-15 18:54:09,979 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:10,990 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [49223#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 49222#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 49226#(or (< ~i~0 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 49227#(or (< ~i~0 0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), 49224#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), 49225#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset))))] [2022-03-15 18:54:10,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:54:10,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:10,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:54:10,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2022-03-15 18:54:10,991 INFO L87 Difference]: Start difference. First operand 400 states and 929 transitions. Second operand has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:11,270 INFO L93 Difference]: Finished difference Result 498 states and 1105 transitions. [2022-03-15 18:54:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 18:54:11,271 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 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 37 [2022-03-15 18:54:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:11,272 INFO L225 Difference]: With dead ends: 498 [2022-03-15 18:54:11,272 INFO L226 Difference]: Without dead ends: 475 [2022-03-15 18:54:11,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:54:11,273 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 170 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:11,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 179 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 303 Invalid, 0 Unknown, 189 Unchecked, 0.2s Time] [2022-03-15 18:54:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-03-15 18:54:11,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 386. [2022-03-15 18:54:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 2.342857142857143) internal successors, (902), 385 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 902 transitions. [2022-03-15 18:54:11,278 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 902 transitions. Word has length 37 [2022-03-15 18:54:11,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:11,278 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 902 transitions. [2022-03-15 18:54:11,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 902 transitions. [2022-03-15 18:54:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:54:11,279 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:11,279 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:11,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 18:54:11,495 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-03-15 18:54:11,496 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash 240642754, now seen corresponding path program 17 times [2022-03-15 18:54:11,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:11,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963252558] [2022-03-15 18:54:11,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:11,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:12,272 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:12,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963252558] [2022-03-15 18:54:12,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963252558] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:12,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895147672] [2022-03-15 18:54:12,272 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:54:12,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:12,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:12,273 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:12,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 18:54:12,362 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:54:12,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:12,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 18:54:12,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:12,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:12,465 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-03-15 18:54:12,521 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:12,521 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:54:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:12,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:12,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~f~0.base))) (= (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* c_~j~0 4))) 4) c_~f~0.offset)) (select .cse0 (+ c_~f~0.offset (* c_~i~0 4)))))) is different from false [2022-03-15 18:54:12,602 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:12,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 122 [2022-03-15 18:54:12,614 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:12,614 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 71 [2022-03-15 18:54:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:54:12,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895147672] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:12,979 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:54:12,979 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 9] total 27 [2022-03-15 18:54:12,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [565966824] [2022-03-15 18:54:12,979 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:12,983 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:13,006 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 257 transitions. [2022-03-15 18:54:13,006 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:14,191 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [50761#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 50762#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 50757#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 50758#(= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0), 50760#(or (< ~i~0 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 50759#(or (< ~i~0 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0))] [2022-03-15 18:54:14,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:54:14,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:14,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:54:14,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1018, Unknown=1, NotChecked=64, Total=1190 [2022-03-15 18:54:14,192 INFO L87 Difference]: Start difference. First operand 386 states and 902 transitions. Second operand has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:14,608 INFO L93 Difference]: Finished difference Result 457 states and 1034 transitions. [2022-03-15 18:54:14,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:54:14,609 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 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 37 [2022-03-15 18:54:14,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:14,610 INFO L225 Difference]: With dead ends: 457 [2022-03-15 18:54:14,610 INFO L226 Difference]: Without dead ends: 285 [2022-03-15 18:54:14,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=1565, Unknown=1, NotChecked=80, Total=1806 [2022-03-15 18:54:14,611 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 181 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:14,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 172 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 558 Invalid, 0 Unknown, 95 Unchecked, 0.2s Time] [2022-03-15 18:54:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-03-15 18:54:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-03-15 18:54:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.2183098591549295) internal successors, (630), 284 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 630 transitions. [2022-03-15 18:54:14,615 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 630 transitions. Word has length 37 [2022-03-15 18:54:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:14,615 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 630 transitions. [2022-03-15 18:54:14,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 630 transitions. [2022-03-15 18:54:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:54:14,616 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:14,616 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:14,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 18:54:14,829 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-03-15 18:54:14,829 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:14,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1545283544, now seen corresponding path program 18 times [2022-03-15 18:54:14,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:14,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119324752] [2022-03-15 18:54:14,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:14,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:15,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:15,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119324752] [2022-03-15 18:54:15,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119324752] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:15,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064075370] [2022-03-15 18:54:15,040 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:54:15,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:15,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:15,041 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:15,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 18:54:15,137 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 18:54:15,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:15,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 18:54:15,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:15,256 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:15,257 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:54:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:54:15,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:54:15,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064075370] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:15,267 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:54:15,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2022-03-15 18:54:15,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [762476845] [2022-03-15 18:54:15,267 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:15,271 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:15,314 INFO L252 McrAutomatonBuilder]: Finished intersection with 244 states and 562 transitions. [2022-03-15 18:54:15,314 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:17,133 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [51937#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 51935#(or (< ~i~0 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 51938#(= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0), 51932#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 51936#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 51934#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 51933#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0))] [2022-03-15 18:54:17,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:54:17,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:17,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:54:17,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:54:17,134 INFO L87 Difference]: Start difference. First operand 285 states and 630 transitions. Second operand has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:17,361 INFO L93 Difference]: Finished difference Result 405 states and 850 transitions. [2022-03-15 18:54:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:54:17,362 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 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 37 [2022-03-15 18:54:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:17,363 INFO L225 Difference]: With dead ends: 405 [2022-03-15 18:54:17,363 INFO L226 Difference]: Without dead ends: 387 [2022-03-15 18:54:17,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:54:17,364 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 115 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:17,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 180 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 372 Invalid, 0 Unknown, 159 Unchecked, 0.2s Time] [2022-03-15 18:54:17,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-03-15 18:54:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 324. [2022-03-15 18:54:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.210526315789474) internal successors, (714), 323 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 714 transitions. [2022-03-15 18:54:17,369 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 714 transitions. Word has length 37 [2022-03-15 18:54:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:17,369 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 714 transitions. [2022-03-15 18:54:17,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 714 transitions. [2022-03-15 18:54:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:54:17,370 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:17,370 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:17,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 18:54:17,570 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-03-15 18:54:17,570 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:17,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:17,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1058683388, now seen corresponding path program 19 times [2022-03-15 18:54:17,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:17,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059027087] [2022-03-15 18:54:17,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:17,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:17,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:17,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059027087] [2022-03-15 18:54:17,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059027087] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:17,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377533011] [2022-03-15 18:54:17,821 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:54:17,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:17,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:17,822 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:17,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 18:54:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:17,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 18:54:17,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:18,034 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:18,034 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:54:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:18,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:18,114 INFO L353 Elim1Store]: treesize reduction 14, result has 80.8 percent of original size [2022-03-15 18:54:18,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-03-15 18:54:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:54:18,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377533011] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:18,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:54:18,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 18 [2022-03-15 18:54:18,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006959775] [2022-03-15 18:54:18,196 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:18,209 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:18,258 INFO L252 McrAutomatonBuilder]: Finished intersection with 244 states and 562 transitions. [2022-03-15 18:54:18,258 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:20,706 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [53244#(= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0), 53236#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 53243#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 53237#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 53240#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 53241#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 53239#(or (< ~i~0 0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 53235#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 53242#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) 0)), 53238#(or (< ~i~0 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0))] [2022-03-15 18:54:20,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:54:20,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:20,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:54:20,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:54:20,707 INFO L87 Difference]: Start difference. First operand 324 states and 714 transitions. Second operand has 17 states, 16 states have (on average 7.0625) internal successors, (113), 17 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:21,051 INFO L93 Difference]: Finished difference Result 372 states and 791 transitions. [2022-03-15 18:54:21,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:54:21,051 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.0625) internal successors, (113), 17 states have internal predecessors, (113), 0 states have call successors, (0), 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 37 [2022-03-15 18:54:21,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:21,052 INFO L225 Difference]: With dead ends: 372 [2022-03-15 18:54:21,053 INFO L226 Difference]: Without dead ends: 207 [2022-03-15 18:54:21,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:54:21,054 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 143 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:21,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 242 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:54:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-03-15 18:54:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-03-15 18:54:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.2718446601941746) internal successors, (468), 206 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 468 transitions. [2022-03-15 18:54:21,063 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 468 transitions. Word has length 37 [2022-03-15 18:54:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:21,064 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 468 transitions. [2022-03-15 18:54:21,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.0625) internal successors, (113), 17 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 468 transitions. [2022-03-15 18:54:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:54:21,064 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:21,064 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:21,090 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-03-15 18:54:21,288 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-03-15 18:54:21,288 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash 178565494, now seen corresponding path program 20 times [2022-03-15 18:54:21,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:21,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796277188] [2022-03-15 18:54:21,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:21,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:21,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:21,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796277188] [2022-03-15 18:54:21,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796277188] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:21,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142925389] [2022-03-15 18:54:21,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:54:21,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:21,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:21,642 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:21,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 18:54:21,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 18:54:21,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:21,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 18:54:21,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:21,752 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 18:54:21,753 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 23 treesize of output 19 [2022-03-15 18:54:21,805 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-03-15 18:54:21,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:21,952 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-03-15 18:54:21,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:21,984 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-03-15 18:54:22,087 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:22,087 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:54:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:54:22,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:54:22,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142925389] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:22,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:54:22,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2022-03-15 18:54:22,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [844716885] [2022-03-15 18:54:22,097 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:22,101 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:22,166 INFO L252 McrAutomatonBuilder]: Finished intersection with 156 states and 317 transitions. [2022-03-15 18:54:22,167 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:23,106 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [54174#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 54173#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 54175#(or (< ~i~0 0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), 54176#(and (or (< ~i~0 0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))) (or (< ~i~0 0) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|))), 54172#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0))] [2022-03-15 18:54:23,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:54:23,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:23,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:54:23,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2022-03-15 18:54:23,107 INFO L87 Difference]: Start difference. First operand 207 states and 468 transitions. Second operand has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:23,433 INFO L93 Difference]: Finished difference Result 303 states and 630 transitions. [2022-03-15 18:54:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 18:54:23,433 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 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 37 [2022-03-15 18:54:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:23,434 INFO L225 Difference]: With dead ends: 303 [2022-03-15 18:54:23,434 INFO L226 Difference]: Without dead ends: 228 [2022-03-15 18:54:23,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:54:23,435 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 140 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:23,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 102 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 354 Invalid, 0 Unknown, 174 Unchecked, 0.2s Time] [2022-03-15 18:54:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-03-15 18:54:23,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 221. [2022-03-15 18:54:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 2.1272727272727274) internal successors, (468), 220 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 468 transitions. [2022-03-15 18:54:23,438 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 468 transitions. Word has length 37 [2022-03-15 18:54:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:23,438 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 468 transitions. [2022-03-15 18:54:23,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 468 transitions. [2022-03-15 18:54:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:54:23,438 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:23,438 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:23,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 18:54:23,639 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-03-15 18:54:23,639 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:23,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1009112330, now seen corresponding path program 21 times [2022-03-15 18:54:23,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:23,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030695531] [2022-03-15 18:54:23,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:23,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:23,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:23,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030695531] [2022-03-15 18:54:23,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030695531] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:23,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503948782] [2022-03-15 18:54:23,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:54:23,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:23,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:23,971 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-03-15 18:54:23,972 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-03-15 18:54:24,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 18:54:24,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:24,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 18:54:24,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:24,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:24,198 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-03-15 18:54:24,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:24,234 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-03-15 18:54:24,323 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:24,324 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:54:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:54:24,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 18:54:24,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503948782] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:54:24,336 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 18:54:24,336 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2022-03-15 18:54:24,336 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1807526304] [2022-03-15 18:54:24,336 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:24,340 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:24,370 INFO L252 McrAutomatonBuilder]: Finished intersection with 156 states and 317 transitions. [2022-03-15 18:54:24,370 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:25,477 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [55066#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 55065#(= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0), 55067#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 55069#(and (or (< ~i~0 0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))) (or (< ~i~0 0) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|))), 55063#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 55068#(or (< ~i~0 0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), 55064#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset)))] [2022-03-15 18:54:25,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 18:54:25,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:25,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 18:54:25,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:54:25,478 INFO L87 Difference]: Start difference. First operand 221 states and 468 transitions. Second operand has 18 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:25,721 INFO L93 Difference]: Finished difference Result 281 states and 560 transitions. [2022-03-15 18:54:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 18:54:25,721 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 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 37 [2022-03-15 18:54:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:25,722 INFO L225 Difference]: With dead ends: 281 [2022-03-15 18:54:25,722 INFO L226 Difference]: Without dead ends: 249 [2022-03-15 18:54:25,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:54:25,723 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 108 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:25,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 130 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 314 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-03-15 18:54:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-03-15 18:54:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2022-03-15 18:54:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 2.0707964601769913) internal successors, (468), 226 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 468 transitions. [2022-03-15 18:54:25,726 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 468 transitions. Word has length 37 [2022-03-15 18:54:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:25,726 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 468 transitions. [2022-03-15 18:54:25,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 468 transitions. [2022-03-15 18:54:25,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 18:54:25,727 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:25,727 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:25,744 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-03-15 18:54:25,948 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-03-15 18:54:25,948 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash 991589522, now seen corresponding path program 22 times [2022-03-15 18:54:25,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:25,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539313978] [2022-03-15 18:54:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:25,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:26,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:26,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539313978] [2022-03-15 18:54:26,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539313978] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:26,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268444110] [2022-03-15 18:54:26,324 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:54:26,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:26,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:26,325 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-03-15 18:54:26,326 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-03-15 18:54:26,429 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:54:26,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:26,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 18:54:26,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:26,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:26,584 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-03-15 18:54:26,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:26,626 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-03-15 18:54:26,717 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:26,718 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 18:54:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:26,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:26,810 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_979) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* 4 (select .cse0 (+ c_~f~0.offset (* c_~j~0 4)))))) (select .cse0 (+ c_~f~0.offset (* c_~i~0 4)))))) is different from false [2022-03-15 18:54:26,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_979) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* c_~i~0 4))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* c_~j~0 4))) 4)))))) is different from false [2022-03-15 18:54:26,856 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:26,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 184 [2022-03-15 18:54:26,872 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:26,873 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 111 [2022-03-15 18:54:26,890 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:26,890 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 84 [2022-03-15 18:54:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:54:27,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268444110] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:27,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:54:27,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 10] total 28 [2022-03-15 18:54:27,763 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1406458657] [2022-03-15 18:54:27,763 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:27,767 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:27,790 INFO L252 McrAutomatonBuilder]: Finished intersection with 156 states and 317 transitions. [2022-03-15 18:54:27,790 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:28,796 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [56069#(or (< ~i~0 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 56066#(or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)), 56068#(or (< ~i~0 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)), 56065#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) ~i~0)), 56067#(or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset))))] [2022-03-15 18:54:28,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:54:28,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:28,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:54:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=950, Unknown=2, NotChecked=126, Total=1190 [2022-03-15 18:54:28,806 INFO L87 Difference]: Start difference. First operand 227 states and 468 transitions. Second operand has 16 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:29,058 INFO L93 Difference]: Finished difference Result 226 states and 467 transitions. [2022-03-15 18:54:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:54:29,059 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 0 states have call successors, (0), 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 37 [2022-03-15 18:54:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:29,059 INFO L225 Difference]: With dead ends: 226 [2022-03-15 18:54:29,059 INFO L226 Difference]: Without dead ends: 0 [2022-03-15 18:54:29,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=1409, Unknown=2, NotChecked=154, Total=1722 [2022-03-15 18:54:29,060 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 96 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:29,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 96 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 350 Invalid, 0 Unknown, 105 Unchecked, 0.1s Time] [2022-03-15 18:54:29,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-15 18:54:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-15 18:54:29,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-15 18:54:29,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2022-03-15 18:54:29,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:29,060 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-15 18:54:29,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-15 18:54:29,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-15 18:54:29,062 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 18:54:29,062 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 18:54:29,062 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 18:54:29,062 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 18:54:29,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-15 18:54:29,288 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-03-15 18:54:29,289 INFO L732 BasicCegarLoop]: Path program histogram: [22, 1] [2022-03-15 18:54:29,291 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 18:54:29,291 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 18:54:29,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 06:54:29 BasicIcfg [2022-03-15 18:54:29,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 18:54:29,292 INFO L158 Benchmark]: Toolchain (without parser) took 82730.34ms. Allocated memory was 187.7MB in the beginning and 914.4MB in the end (delta: 726.7MB). Free memory was 131.0MB in the beginning and 365.6MB in the end (delta: -234.6MB). Peak memory consumption was 492.5MB. Max. memory is 8.0GB. [2022-03-15 18:54:29,292 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 18:54:29,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.13ms. Allocated memory was 187.7MB in the beginning and 256.9MB in the end (delta: 69.2MB). Free memory was 130.9MB in the beginning and 225.8MB in the end (delta: -95.0MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-03-15 18:54:29,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.90ms. Allocated memory is still 256.9MB. Free memory was 225.8MB in the beginning and 223.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:54:29,293 INFO L158 Benchmark]: Boogie Preprocessor took 24.22ms. Allocated memory is still 256.9MB. Free memory was 223.8MB in the beginning and 221.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:54:29,293 INFO L158 Benchmark]: RCFGBuilder took 507.21ms. Allocated memory is still 256.9MB. Free memory was 221.7MB in the beginning and 199.1MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-03-15 18:54:29,293 INFO L158 Benchmark]: TraceAbstraction took 81830.01ms. Allocated memory was 256.9MB in the beginning and 914.4MB in the end (delta: 657.5MB). Free memory was 198.6MB in the beginning and 365.6MB in the end (delta: -167.0MB). Peak memory consumption was 491.3MB. Max. memory is 8.0GB. [2022-03-15 18:54:29,293 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.12ms. Allocated memory is still 187.7MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 330.13ms. Allocated memory was 187.7MB in the beginning and 256.9MB in the end (delta: 69.2MB). Free memory was 130.9MB in the beginning and 225.8MB in the end (delta: -95.0MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.90ms. Allocated memory is still 256.9MB. Free memory was 225.8MB in the beginning and 223.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.22ms. Allocated memory is still 256.9MB. Free memory was 223.8MB in the beginning and 221.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 507.21ms. Allocated memory is still 256.9MB. Free memory was 221.7MB in the beginning and 199.1MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 81830.01ms. Allocated memory was 256.9MB in the beginning and 914.4MB in the end (delta: 657.5MB). Free memory was 198.6MB in the beginning and 365.6MB in the end (delta: -167.0MB). Peak memory consumption was 491.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 189 PlacesBefore, 49 PlacesAfterwards, 186 TransitionsBefore, 40 TransitionsAfterwards, 1266 CoEnabledTransitionPairs, 8 FixpointIterations, 130 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 0 ConcurrentYvCompositions, 6 ChoiceCompositions, 173 TotalNumberOfCompositions, 8119 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3831, positive: 3464, positive conditional: 0, positive unconditional: 3464, negative: 367, negative conditional: 0, negative unconditional: 367, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 701, positive: 677, positive conditional: 0, positive unconditional: 677, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3831, positive: 2787, positive conditional: 0, positive unconditional: 2787, negative: 343, negative conditional: 0, negative unconditional: 343, unknown: 701, unknown conditional: 0, unknown unconditional: 701] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 184, Positive conditional cache size: 0, Positive unconditional cache size: 184, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 161]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 215 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 81.7s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 22, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3647 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3647 mSDsluCounter, 4251 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1964 IncrementalHoareTripleChecker+Unchecked, 9670 mSDsCounter, 368 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12497 IncrementalHoareTripleChecker+Invalid, 14829 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 368 mSolverCounterUnsat, 488 mSDtfsCounter, 12497 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4511 GetRequests, 3672 SyntacticMatches, 176 SemanticMatches, 663 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 4857 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1381occurred in iteration=6, InterpolantAutomatonStates: 281, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 3591 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 1501 NumberOfCodeBlocks, 1480 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1710 ConstructedInterpolants, 135 QuantifiedInterpolants, 31530 SizeOfPredicates, 246 NumberOfNonLiveVariables, 5049 ConjunctsInSsa, 463 ConjunctsInUnsatCore, 48 InterpolantComputations, 21 PerfectInterpolantSequences, 51/109 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-03-15 18:54:29,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...