/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/popl20-more-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:30:52,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:30:52,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:30:52,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:30:52,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:30:52,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:30:52,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:30:52,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:30:52,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:30:52,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:30:52,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:30:52,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:30:52,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:30:52,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:30:52,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:30:52,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:30:52,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:30:52,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:30:52,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:30:52,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:30:52,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:30:52,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:30:52,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:30:52,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:30:52,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:30:52,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:30:52,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:30:52,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:30:52,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:30:52,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:30:52,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:30:52,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:30:52,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:30:52,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:30:52,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:30:52,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:30:52,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:30:52,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:30:52,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:30:52,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:30:52,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:30:52,235 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 19:30:52,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:30:52,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:30:52,263 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:30:52,263 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:30:52,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:30:52,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:30:52,264 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:30:52,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:30:52,264 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:30:52,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:30:52,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:30:52,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:30:52,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:30:52,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:30:52,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:30:52,264 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:30:52,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:30:52,265 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:30:52,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:30:52,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:30:52,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:30:52,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:30:52,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:30:52,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:30:52,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:30:52,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:30:52,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:30:52,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:30:52,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:30:52,266 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:30:52,266 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:30:52,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:30:52,266 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 19:30:52,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:30:52,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:30:52,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:30:52,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:30:52,432 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:30:52,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-03-15 19:30:52,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cbbd7457/2805093a1c2d451aa85a8742d8b8a07f/FLAG1c037649d [2022-03-15 19:30:52,793 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:30:52,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-03-15 19:30:52,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cbbd7457/2805093a1c2d451aa85a8742d8b8a07f/FLAG1c037649d [2022-03-15 19:30:52,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cbbd7457/2805093a1c2d451aa85a8742d8b8a07f [2022-03-15 19:30:52,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:30:52,807 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:30:52,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:30:52,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:30:52,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:30:52,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:30:52" (1/1) ... [2022-03-15 19:30:52,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40900b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:52, skipping insertion in model container [2022-03-15 19:30:52,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:30:52" (1/1) ... [2022-03-15 19:30:52,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:30:52,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:30:52,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c[2870,2883] [2022-03-15 19:30:52,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:30:52,968 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:30:52,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c[2870,2883] [2022-03-15 19:30:52,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:30:53,005 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:30:53,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:53 WrapperNode [2022-03-15 19:30:53,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:30:53,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:30:53,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:30:53,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:30:53,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:53" (1/1) ... [2022-03-15 19:30:53,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:53" (1/1) ... [2022-03-15 19:30:53,050 INFO L137 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 163 [2022-03-15 19:30:53,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:30:53,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:30:53,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:30:53,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:30:53,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:53" (1/1) ... [2022-03-15 19:30:53,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:53" (1/1) ... [2022-03-15 19:30:53,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:53" (1/1) ... [2022-03-15 19:30:53,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:53" (1/1) ... [2022-03-15 19:30:53,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:53" (1/1) ... [2022-03-15 19:30:53,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:53" (1/1) ... [2022-03-15 19:30:53,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:53" (1/1) ... [2022-03-15 19:30:53,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:30:53,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:30:53,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:30:53,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:30:53,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:53" (1/1) ... [2022-03-15 19:30:53,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:30:53,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:30:53,122 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 19:30:53,129 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 19:30:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:30:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:30:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:30:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:30:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:30:53,147 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:30:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:30:53,147 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:30:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:30:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:30:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:30:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:30:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:30:53,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:30:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:30:53,148 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 19:30:53,205 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:30:53,206 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:30:53,370 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:30:53,437 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:30:53,437 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 19:30:53,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:30:53 BoogieIcfgContainer [2022-03-15 19:30:53,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:30:53,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:30:53,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:30:53,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:30:53,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:30:52" (1/3) ... [2022-03-15 19:30:53,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbd965d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:30:53, skipping insertion in model container [2022-03-15 19:30:53,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:30:53" (2/3) ... [2022-03-15 19:30:53,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbd965d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:30:53, skipping insertion in model container [2022-03-15 19:30:53,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:30:53" (3/3) ... [2022-03-15 19:30:53,462 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2022-03-15 19:30:53,466 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:30:53,466 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:30:53,466 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:30:53,466 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:30:53,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,503 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,503 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,503 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,506 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,506 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,506 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,506 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,506 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,526 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,526 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,526 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,526 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,526 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:30:53,529 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 19:30:53,562 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:30:53,567 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 19:30:53,568 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 19:30:53,578 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:30:53,584 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 145 transitions, 306 flow [2022-03-15 19:30:53,586 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 145 transitions, 306 flow [2022-03-15 19:30:53,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 141 places, 145 transitions, 306 flow [2022-03-15 19:30:53,680 INFO L129 PetriNetUnfolder]: 11/143 cut-off events. [2022-03-15 19:30:53,680 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 19:30:53,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 143 events. 11/143 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 106. Up to 3 conditions per place. [2022-03-15 19:30:53,688 INFO L116 LiptonReduction]: Number of co-enabled transitions 690 [2022-03-15 19:30:57,647 INFO L131 LiptonReduction]: Checked pairs total: 815 [2022-03-15 19:30:57,648 INFO L133 LiptonReduction]: Total number of compositions: 149 [2022-03-15 19:30:57,654 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 20 transitions, 56 flow [2022-03-15 19:30:57,672 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 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 19:30:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 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 19:30:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 19:30:57,680 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:30:57,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:30:57,680 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:30:57,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:30:57,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1973029976, now seen corresponding path program 1 times [2022-03-15 19:30:57,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:30:57,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471323642] [2022-03-15 19:30:57,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:30:57,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:30:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:30:57,940 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 19:30:57,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:30:57,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471323642] [2022-03-15 19:30:57,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471323642] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:30:57,942 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:30:57,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:30:57,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [229879513] [2022-03-15 19:30:57,943 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:30:57,947 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:30:57,967 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 26 transitions. [2022-03-15 19:30:57,967 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:30:58,140 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:30:58,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:30:58,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:30:58,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:30:58,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:30:58,159 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 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 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 19:30:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:30:58,211 INFO L93 Difference]: Finished difference Result 49 states and 96 transitions. [2022-03-15 19:30:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:30:58,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-03-15 19:30:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:30:58,220 INFO L225 Difference]: With dead ends: 49 [2022-03-15 19:30:58,220 INFO L226 Difference]: Without dead ends: 36 [2022-03-15 19:30:58,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:30:58,224 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:30:58,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 3 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:30:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-15 19:30:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-03-15 19:30:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 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 19:30:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 76 transitions. [2022-03-15 19:30:58,252 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 76 transitions. Word has length 14 [2022-03-15 19:30:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:30:58,252 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 76 transitions. [2022-03-15 19:30:58,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 19:30:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 76 transitions. [2022-03-15 19:30:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:30:58,254 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:30:58,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:30:58,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:30:58,254 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:30:58,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:30:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1727067065, now seen corresponding path program 1 times [2022-03-15 19:30:58,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:30:58,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898585093] [2022-03-15 19:30:58,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:30:58,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:30:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:30:58,479 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 19:30:58,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:30:58,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898585093] [2022-03-15 19:30:58,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898585093] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:30:58,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:30:58,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 19:30:58,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2112401565] [2022-03-15 19:30:58,480 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:30:58,482 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:30:58,485 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 27 transitions. [2022-03-15 19:30:58,485 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:30:58,864 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:30:58,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:30:58,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:30:58,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:30:58,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:30:58,866 INFO L87 Difference]: Start difference. First operand 36 states and 76 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 19:30:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:30:58,967 INFO L93 Difference]: Finished difference Result 63 states and 140 transitions. [2022-03-15 19:30:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:30:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 15 [2022-03-15 19:30:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:30:58,969 INFO L225 Difference]: With dead ends: 63 [2022-03-15 19:30:58,969 INFO L226 Difference]: Without dead ends: 58 [2022-03-15 19:30:58,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:30:58,970 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:30:58,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 5 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:30:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-15 19:30:58,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2022-03-15 19:30:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.142857142857143) internal successors, (105), 49 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:30:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 105 transitions. [2022-03-15 19:30:58,975 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 105 transitions. Word has length 15 [2022-03-15 19:30:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:30:58,975 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 105 transitions. [2022-03-15 19:30:58,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 19:30:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 105 transitions. [2022-03-15 19:30:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:30:58,976 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:30:58,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:30:58,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:30:58,976 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:30:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:30:58,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1250421841, now seen corresponding path program 2 times [2022-03-15 19:30:58,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:30:58,986 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319566194] [2022-03-15 19:30:58,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:30:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:30:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:30:59,057 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 19:30:59,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:30:59,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319566194] [2022-03-15 19:30:59,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319566194] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:30:59,057 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:30:59,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:30:59,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1670725340] [2022-03-15 19:30:59,058 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:30:59,059 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:30:59,063 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 37 transitions. [2022-03-15 19:30:59,063 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:30:59,127 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:30:59,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:30:59,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:30:59,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:30:59,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:30:59,128 INFO L87 Difference]: Start difference. First operand 50 states and 105 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 19:30:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:30:59,155 INFO L93 Difference]: Finished difference Result 50 states and 103 transitions. [2022-03-15 19:30:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:30:59,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 15 [2022-03-15 19:30:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:30:59,158 INFO L225 Difference]: With dead ends: 50 [2022-03-15 19:30:59,158 INFO L226 Difference]: Without dead ends: 50 [2022-03-15 19:30:59,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:30:59,159 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:30:59,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:30:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-03-15 19:30:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-03-15 19:30:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 19:30:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 103 transitions. [2022-03-15 19:30:59,163 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 103 transitions. Word has length 15 [2022-03-15 19:30:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:30:59,164 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 103 transitions. [2022-03-15 19:30:59,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 19:30:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 103 transitions. [2022-03-15 19:30:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:30:59,164 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:30:59,164 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:30:59,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:30:59,165 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:30:59,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:30:59,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1638300661, now seen corresponding path program 3 times [2022-03-15 19:30:59,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:30:59,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164477733] [2022-03-15 19:30:59,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:30:59,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:30:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:30:59,301 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 19:30:59,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:30:59,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164477733] [2022-03-15 19:30:59,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164477733] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:30:59,302 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:30:59,302 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 19:30:59,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [221117685] [2022-03-15 19:30:59,302 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:30:59,304 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:30:59,308 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 19:30:59,308 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:30:59,361 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 28 treesize of output 12 [2022-03-15 19:30:59,381 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 26 treesize of output 10 [2022-03-15 19:30:59,732 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [673#(and (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (< ~s~0 (+ ~N~0 1)) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (<= ~N~0 ~s~0) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))), 675#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~s~0 0)), 676#(and (<= 0 ~N~0) (<= ~C~0 ~x~0) (<= ~x~0 ~C~0) (= ~y~0 0) (<= ~N~0 0)), 674#(and (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< 0 (+ ~N~0 1)) (<= ~N~0 0) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))] [2022-03-15 19:30:59,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:30:59,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:30:59,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:30:59,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:30:59,733 INFO L87 Difference]: Start difference. First operand 50 states and 103 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:30:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:30:59,853 INFO L93 Difference]: Finished difference Result 59 states and 118 transitions. [2022-03-15 19:30:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:30:59,854 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 19:30:59,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:30:59,855 INFO L225 Difference]: With dead ends: 59 [2022-03-15 19:30:59,855 INFO L226 Difference]: Without dead ends: 54 [2022-03-15 19:30:59,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:30:59,857 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:30:59,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 9 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:30:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-03-15 19:30:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-03-15 19:30:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 19:30:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 103 transitions. [2022-03-15 19:30:59,861 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 103 transitions. Word has length 15 [2022-03-15 19:30:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:30:59,861 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 103 transitions. [2022-03-15 19:30:59,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:30:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 103 transitions. [2022-03-15 19:30:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:30:59,862 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:30:59,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:30:59,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:30:59,862 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:30:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:30:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 563838149, now seen corresponding path program 1 times [2022-03-15 19:30:59,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:30:59,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138828841] [2022-03-15 19:30:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:30:59,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:30:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:30:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:30:59,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:30:59,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138828841] [2022-03-15 19:30:59,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138828841] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:30:59,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009440752] [2022-03-15 19:30:59,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:30:59,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:30:59,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:30:59,906 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 19:30:59,940 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 19:30:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:30:59,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:30:59,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:00,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:00,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009440752] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:00,105 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:00,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 19:31:00,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [108002546] [2022-03-15 19:31:00,106 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:00,108 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:00,111 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 28 transitions. [2022-03-15 19:31:00,112 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:00,195 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:00,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:31:00,195 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:00,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:31:00,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:31:00,196 INFO L87 Difference]: Start difference. First operand 50 states and 103 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 19:31:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:00,260 INFO L93 Difference]: Finished difference Result 92 states and 179 transitions. [2022-03-15 19:31:00,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:31:00,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-03-15 19:31:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:00,262 INFO L225 Difference]: With dead ends: 92 [2022-03-15 19:31:00,262 INFO L226 Difference]: Without dead ends: 84 [2022-03-15 19:31:00,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:31:00,262 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:00,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 5 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:31:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-03-15 19:31:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2022-03-15 19:31:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 63 states have internal predecessors, (130), 0 states have call successors, (0), 0 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 19:31:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 130 transitions. [2022-03-15 19:31:00,276 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 130 transitions. Word has length 16 [2022-03-15 19:31:00,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:00,277 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 130 transitions. [2022-03-15 19:31:00,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 19:31:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 130 transitions. [2022-03-15 19:31:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:31:00,281 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:00,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:00,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:00,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:00,498 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:00,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:00,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1999788608, now seen corresponding path program 1 times [2022-03-15 19:31:00,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:00,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404037107] [2022-03-15 19:31:00,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:00,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:00,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:00,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404037107] [2022-03-15 19:31:00,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404037107] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:00,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445984899] [2022-03-15 19:31:00,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:00,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:00,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:00,624 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 19:31:00,625 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 19:31:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:00,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:31:00,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:00,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:00,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445984899] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:00,955 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:00,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 19:31:00,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1245527389] [2022-03-15 19:31:00,956 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:00,958 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:00,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 34 transitions. [2022-03-15 19:31:00,962 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:01,081 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:31:01,140 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:01,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:31:01,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:01,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:31:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:31:01,141 INFO L87 Difference]: Start difference. First operand 64 states and 130 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 19:31:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:01,274 INFO L93 Difference]: Finished difference Result 78 states and 149 transitions. [2022-03-15 19:31:01,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:31:01,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 16 [2022-03-15 19:31:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:01,275 INFO L225 Difference]: With dead ends: 78 [2022-03-15 19:31:01,275 INFO L226 Difference]: Without dead ends: 51 [2022-03-15 19:31:01,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:31:01,275 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:01,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-15 19:31:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-03-15 19:31:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.08) internal successors, (104), 50 states have internal predecessors, (104), 0 states have call successors, (0), 0 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 19:31:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 104 transitions. [2022-03-15 19:31:01,278 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 104 transitions. Word has length 16 [2022-03-15 19:31:01,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:01,278 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 104 transitions. [2022-03-15 19:31:01,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 19:31:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 104 transitions. [2022-03-15 19:31:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:31:01,279 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:01,279 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:01,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:01,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 19:31:01,488 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:01,488 INFO L85 PathProgramCache]: Analyzing trace with hash 710994340, now seen corresponding path program 2 times [2022-03-15 19:31:01,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:01,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37874882] [2022-03-15 19:31:01,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:01,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:01,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:01,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37874882] [2022-03-15 19:31:01,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37874882] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:01,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265477086] [2022-03-15 19:31:01,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:31:01,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:01,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:01,792 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 19:31:01,793 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 19:31:01,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:31:01,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:01,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:31:01,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:02,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:02,034 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 19:31:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:02,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:02,123 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_153 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_153) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:31:02,165 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:02,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-03-15 19:31:02,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:31:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:02,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265477086] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:02,327 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:02,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 19:31:02,327 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [538770179] [2022-03-15 19:31:02,327 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:02,329 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:02,332 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 29 transitions. [2022-03-15 19:31:02,332 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:02,464 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:02,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:31:02,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:02,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:31:02,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=385, Unknown=1, NotChecked=40, Total=506 [2022-03-15 19:31:02,466 INFO L87 Difference]: Start difference. First operand 51 states and 104 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 19:31:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:02,593 INFO L93 Difference]: Finished difference Result 87 states and 195 transitions. [2022-03-15 19:31:02,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:31:02,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 17 [2022-03-15 19:31:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:02,594 INFO L225 Difference]: With dead ends: 87 [2022-03-15 19:31:02,594 INFO L226 Difference]: Without dead ends: 87 [2022-03-15 19:31:02,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=425, Unknown=1, NotChecked=42, Total=552 [2022-03-15 19:31:02,595 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:02,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 7 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-03-15 19:31:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2022-03-15 19:31:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.3333333333333335) internal successors, (154), 66 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 19:31:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 154 transitions. [2022-03-15 19:31:02,598 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 154 transitions. Word has length 17 [2022-03-15 19:31:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:02,598 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 154 transitions. [2022-03-15 19:31:02,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 19:31:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 154 transitions. [2022-03-15 19:31:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:31:02,599 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:02,599 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:02,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 19:31:02,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:02,804 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:02,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1187639564, now seen corresponding path program 3 times [2022-03-15 19:31:02,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:02,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824472767] [2022-03-15 19:31:02,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:02,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:03,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:03,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824472767] [2022-03-15 19:31:03,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824472767] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:03,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892409370] [2022-03-15 19:31:03,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:31:03,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:03,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:03,138 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 19:31:03,140 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 19:31:03,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:31:03,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:03,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:31:03,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:03,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:03,364 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 19:31:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:03,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:03,523 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:03,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-03-15 19:31:03,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:31:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:03,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892409370] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:03,678 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:03,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2022-03-15 19:31:03,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1625516305] [2022-03-15 19:31:03,678 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:03,680 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:03,684 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 23 transitions. [2022-03-15 19:31:03,684 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:03,758 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:03,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:31:03,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:03,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:31:03,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=333, Unknown=2, NotChecked=0, Total=420 [2022-03-15 19:31:03,759 INFO L87 Difference]: Start difference. First operand 67 states and 154 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 19:31:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:03,901 INFO L93 Difference]: Finished difference Result 109 states and 239 transitions. [2022-03-15 19:31:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:31:03,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 17 [2022-03-15 19:31:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:03,902 INFO L225 Difference]: With dead ends: 109 [2022-03-15 19:31:03,902 INFO L226 Difference]: Without dead ends: 107 [2022-03-15 19:31:03,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=370, Unknown=2, NotChecked=0, Total=462 [2022-03-15 19:31:03,903 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:03,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 7 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-03-15 19:31:03,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 76. [2022-03-15 19:31:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 2.32) internal successors, (174), 75 states have internal predecessors, (174), 0 states have call successors, (0), 0 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 19:31:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 174 transitions. [2022-03-15 19:31:03,906 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 174 transitions. Word has length 17 [2022-03-15 19:31:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:03,906 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 174 transitions. [2022-03-15 19:31:03,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 19:31:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 174 transitions. [2022-03-15 19:31:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:31:03,907 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:03,907 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:03,938 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 19:31:04,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:04,108 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:04,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1852632417, now seen corresponding path program 2 times [2022-03-15 19:31:04,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:04,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518526183] [2022-03-15 19:31:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:31:04,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:04,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518526183] [2022-03-15 19:31:04,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518526183] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:31:04,154 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:31:04,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:31:04,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1705974925] [2022-03-15 19:31:04,154 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:04,155 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:04,159 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 35 transitions. [2022-03-15 19:31:04,159 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:04,281 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:04,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:31:04,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:04,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:31:04,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:31:04,282 INFO L87 Difference]: Start difference. First operand 76 states and 174 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 19:31:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:04,325 INFO L93 Difference]: Finished difference Result 129 states and 288 transitions. [2022-03-15 19:31:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:31:04,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 17 [2022-03-15 19:31:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:04,326 INFO L225 Difference]: With dead ends: 129 [2022-03-15 19:31:04,326 INFO L226 Difference]: Without dead ends: 115 [2022-03-15 19:31:04,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:31:04,328 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 25 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:04,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 1 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:31:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-03-15 19:31:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2022-03-15 19:31:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.377551020408163) internal successors, (233), 98 states have internal predecessors, (233), 0 states have call successors, (0), 0 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 19:31:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 233 transitions. [2022-03-15 19:31:04,341 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 233 transitions. Word has length 17 [2022-03-15 19:31:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:04,341 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 233 transitions. [2022-03-15 19:31:04,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 19:31:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 233 transitions. [2022-03-15 19:31:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:31:04,343 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:04,343 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:04,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 19:31:04,344 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:04,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1500820820, now seen corresponding path program 4 times [2022-03-15 19:31:04,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:04,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077482891] [2022-03-15 19:31:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:04,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:04,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077482891] [2022-03-15 19:31:04,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077482891] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:04,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226033480] [2022-03-15 19:31:04,583 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:31:04,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:04,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:04,584 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 19:31:04,585 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 19:31:04,651 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:31:04,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:04,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:31:04,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:31:04,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:04,893 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:31:04,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-03-15 19:31:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:31:04,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226033480] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:04,940 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:04,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 4] total 15 [2022-03-15 19:31:04,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [301167748] [2022-03-15 19:31:04,940 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:04,942 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:04,947 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 58 transitions. [2022-03-15 19:31:04,947 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:06,010 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2621#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (+ ~q~0.offset (* ~q_front~0 4)) 0) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (= ~q~0.offset 0) (< ~q_back~0 0))), 2622#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (= ~q~0.offset 0) (< ~q_back~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (+ ~q~0.offset (* ~q_front~0 4)) 0) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:31:06,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:31:06,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:06,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:31:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:31:06,012 INFO L87 Difference]: Start difference. First operand 99 states and 233 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 19:31:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:06,208 INFO L93 Difference]: Finished difference Result 130 states and 299 transitions. [2022-03-15 19:31:06,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:31:06,208 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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 17 [2022-03-15 19:31:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:06,211 INFO L225 Difference]: With dead ends: 130 [2022-03-15 19:31:06,211 INFO L226 Difference]: Without dead ends: 130 [2022-03-15 19:31:06,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:31:06,212 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:06,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 7 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-03-15 19:31:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 89. [2022-03-15 19:31:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 2.2613636363636362) internal successors, (199), 88 states have internal predecessors, (199), 0 states have call successors, (0), 0 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 19:31:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 199 transitions. [2022-03-15 19:31:06,220 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 199 transitions. Word has length 17 [2022-03-15 19:31:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:06,220 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 199 transitions. [2022-03-15 19:31:06,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 19:31:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 199 transitions. [2022-03-15 19:31:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:31:06,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:06,221 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:06,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 19:31:06,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 19:31:06,436 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:06,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash 565670915, now seen corresponding path program 1 times [2022-03-15 19:31:06,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:06,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040323081] [2022-03-15 19:31:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:06,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:06,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:06,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040323081] [2022-03-15 19:31:06,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040323081] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:06,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007910617] [2022-03-15 19:31:06,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:06,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:06,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:06,880 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 19:31:06,880 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 19:31:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:07,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 19:31:07,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:07,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:07,458 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 19:31:07,620 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 25 treesize of output 7 [2022-03-15 19:31:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:07,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:07,885 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_274 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_274) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (= (mod c_~x~0 4294967296) (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296))) is different from false [2022-03-15 19:31:07,901 WARN L838 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q_back~0)) (not (< c_~q_back~0 c_~n~0)) (and (forall ((v_ArrVal_274 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_274) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296))) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) is different from false [2022-03-15 19:31:07,927 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:07,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2022-03-15 19:31:07,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-03-15 19:31:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 19:31:08,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007910617] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:08,282 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:08,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-03-15 19:31:08,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [370168121] [2022-03-15 19:31:08,282 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:08,284 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:08,288 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 36 transitions. [2022-03-15 19:31:08,288 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:08,955 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:08,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:31:08,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:08,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:31:08,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=939, Unknown=2, NotChecked=126, Total=1190 [2022-03-15 19:31:08,956 INFO L87 Difference]: Start difference. First operand 89 states and 199 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 19:31:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:09,269 INFO L93 Difference]: Finished difference Result 112 states and 237 transitions. [2022-03-15 19:31:09,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:31:09,269 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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 18 [2022-03-15 19:31:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:09,270 INFO L225 Difference]: With dead ends: 112 [2022-03-15 19:31:09,270 INFO L226 Difference]: Without dead ends: 107 [2022-03-15 19:31:09,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=1121, Unknown=2, NotChecked=138, Total=1406 [2022-03-15 19:31:09,271 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 25 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:09,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 8 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:31:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-03-15 19:31:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2022-03-15 19:31:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.193877551020408) internal successors, (215), 98 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 215 transitions. [2022-03-15 19:31:09,273 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 215 transitions. Word has length 18 [2022-03-15 19:31:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:09,274 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 215 transitions. [2022-03-15 19:31:09,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 19:31:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 215 transitions. [2022-03-15 19:31:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:31:09,274 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:09,274 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:09,304 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 19:31:09,474 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 19:31:09,475 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:09,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:09,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2137368757, now seen corresponding path program 2 times [2022-03-15 19:31:09,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:09,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685545022] [2022-03-15 19:31:09,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:09,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:09,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:09,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685545022] [2022-03-15 19:31:09,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685545022] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:09,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072057548] [2022-03-15 19:31:09,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:31:09,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:09,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:09,826 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 19:31:09,827 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 19:31:10,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:31:10,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:10,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:31:10,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:10,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:10,502 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 19:31:10,626 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 19:31:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:10,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:10,964 WARN L838 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q_back~0)) (and (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (+ c_~C~0 c_~x~0 (* (div (+ c_~C~0 c_~x~0) 4294967296) (- 4294967296))) (let ((.cse0 (* c_~C~0 2))) (+ c_~y~0 (* (div (+ c_~y~0 .cse0) 4294967296) (- 4294967296)) .cse0)))) (not (< c_~q_back~0 c_~n~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) is different from false [2022-03-15 19:31:10,986 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:10,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 73 [2022-03-15 19:31:10,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-03-15 19:31:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:11,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072057548] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:11,425 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:11,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 19:31:11,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1587922090] [2022-03-15 19:31:11,426 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:11,427 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:11,431 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 30 transitions. [2022-03-15 19:31:11,431 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:11,694 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3526#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= (+ ~x~0 (* (div ~x~0 4294967296) (- 4294967296))) (+ (* (div (+ ~y~0 ~C~0) 4294967296) (- 4294967296)) ~y~0 ~C~0))))] [2022-03-15 19:31:11,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:31:11,695 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:11,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:31:11,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=973, Unknown=1, NotChecked=64, Total=1190 [2022-03-15 19:31:11,696 INFO L87 Difference]: Start difference. First operand 99 states and 215 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 19:31:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:12,146 INFO L93 Difference]: Finished difference Result 131 states and 285 transitions. [2022-03-15 19:31:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:31:12,146 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 18 [2022-03-15 19:31:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:12,147 INFO L225 Difference]: With dead ends: 131 [2022-03-15 19:31:12,147 INFO L226 Difference]: Without dead ends: 122 [2022-03-15 19:31:12,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=180, Invalid=1229, Unknown=1, NotChecked=72, Total=1482 [2022-03-15 19:31:12,148 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:12,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 7 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:31:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-03-15 19:31:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2022-03-15 19:31:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.22) internal successors, (222), 100 states have internal predecessors, (222), 0 states have call successors, (0), 0 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 19:31:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 222 transitions. [2022-03-15 19:31:12,151 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 222 transitions. Word has length 18 [2022-03-15 19:31:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:12,151 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 222 transitions. [2022-03-15 19:31:12,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 19:31:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 222 transitions. [2022-03-15 19:31:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:31:12,152 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:12,152 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:12,161 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 19:31:12,356 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 19:31:12,357 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:12,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:12,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1278494227, now seen corresponding path program 3 times [2022-03-15 19:31:12,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:12,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439312565] [2022-03-15 19:31:12,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:12,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:12,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:12,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439312565] [2022-03-15 19:31:12,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439312565] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:12,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634332048] [2022-03-15 19:31:12,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:31:12,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:12,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:12,787 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 19:31:12,788 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 19:31:13,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:31:13,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:13,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 19:31:13,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:13,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:13,220 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 19:31:13,337 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 25 treesize of output 7 [2022-03-15 19:31:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:31:13,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:13,675 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:13,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2022-03-15 19:31:13,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-03-15 19:31:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:31:14,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634332048] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:14,070 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:14,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 30 [2022-03-15 19:31:14,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [476336328] [2022-03-15 19:31:14,070 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:14,072 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:14,076 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 45 transitions. [2022-03-15 19:31:14,076 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:15,503 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [4003#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 4004#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4)))) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 4005#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (<= ~N~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4)))) (= ~y~0 0) (<= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~N~0) (<= ~q_front~0 0) (< 0 (+ ~q_front~0 1)) (= ~q~0.offset 0)), 4002#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:31:15,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:31:15,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:31:15,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1113, Unknown=1, NotChecked=0, Total=1260 [2022-03-15 19:31:15,505 INFO L87 Difference]: Start difference. First operand 101 states and 222 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:17,001 INFO L93 Difference]: Finished difference Result 154 states and 327 transitions. [2022-03-15 19:31:17,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:31:17,001 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:31:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:17,002 INFO L225 Difference]: With dead ends: 154 [2022-03-15 19:31:17,002 INFO L226 Difference]: Without dead ends: 149 [2022-03-15 19:31:17,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=222, Invalid=1499, Unknown=1, NotChecked=0, Total=1722 [2022-03-15 19:31:17,003 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 59 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:17,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 10 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:31:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-03-15 19:31:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 101. [2022-03-15 19:31:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.22) internal successors, (222), 100 states have internal predecessors, (222), 0 states have call successors, (0), 0 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 19:31:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 222 transitions. [2022-03-15 19:31:17,007 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 222 transitions. Word has length 18 [2022-03-15 19:31:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:17,007 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 222 transitions. [2022-03-15 19:31:17,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 222 transitions. [2022-03-15 19:31:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:31:17,008 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:17,008 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:17,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 19:31:17,212 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 19:31:17,212 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1585525745, now seen corresponding path program 4 times [2022-03-15 19:31:17,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:17,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383237820] [2022-03-15 19:31:17,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:17,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:17,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:17,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383237820] [2022-03-15 19:31:17,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383237820] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:17,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776260417] [2022-03-15 19:31:17,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:31:17,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:17,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:17,522 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 19:31:17,523 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 19:31:17,831 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:31:17,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:17,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 19:31:17,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:18,109 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 19:31:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:18,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:18,422 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:18,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-03-15 19:31:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:18,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776260417] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:18,788 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:18,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-03-15 19:31:18,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2077993380] [2022-03-15 19:31:18,789 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:18,790 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:18,795 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 50 transitions. [2022-03-15 19:31:18,795 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:19,533 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [4510#(and (or (= ~q_front~0 0) (<= (+ ~n~0 ~q_front~0) (+ ~q_back~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (= ~q_front~0 0))) (or (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (not (= ~q_front~0 0))) (= ~y~0 0) (or (<= ~x~0 ~C~0) (not (= ~q_front~0 0))) (or (<= ~C~0 ~x~0) (not (= ~q_front~0 0))) (< 0 (+ ~q_front~0 1)) (= ~q~0.offset 0) (or (<= 1 ~N~0) (not (= ~q_front~0 0)))), 4508#(and (= ~x~0 0) (or (<= ~n~0 2) (<= ~q_front~0 0)) (= ~y~0 0) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), 4509#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:31:19,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:31:19,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:19,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:31:19,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:31:19,534 INFO L87 Difference]: Start difference. First operand 101 states and 222 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 19:31:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:20,058 INFO L93 Difference]: Finished difference Result 139 states and 302 transitions. [2022-03-15 19:31:20,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:31:20,059 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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 18 [2022-03-15 19:31:20,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:20,059 INFO L225 Difference]: With dead ends: 139 [2022-03-15 19:31:20,059 INFO L226 Difference]: Without dead ends: 130 [2022-03-15 19:31:20,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:31:20,060 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:20,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:31:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-03-15 19:31:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2022-03-15 19:31:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.22) internal successors, (222), 100 states have internal predecessors, (222), 0 states have call successors, (0), 0 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 19:31:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 222 transitions. [2022-03-15 19:31:20,063 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 222 transitions. Word has length 18 [2022-03-15 19:31:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:20,063 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 222 transitions. [2022-03-15 19:31:20,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 19:31:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 222 transitions. [2022-03-15 19:31:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:31:20,064 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:20,064 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:20,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 19:31:20,268 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 19:31:20,268 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash -726651215, now seen corresponding path program 5 times [2022-03-15 19:31:20,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:20,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625217554] [2022-03-15 19:31:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:20,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:20,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:20,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625217554] [2022-03-15 19:31:20,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625217554] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:20,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195764307] [2022-03-15 19:31:20,683 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:31:20,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:20,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:20,685 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 19:31:20,689 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 19:31:20,747 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:31:20,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:20,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:31:20,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:21,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-15 19:31:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:21,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:21,314 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:21,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-03-15 19:31:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:21,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195764307] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:21,674 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:21,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-03-15 19:31:21,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1208961308] [2022-03-15 19:31:21,675 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:21,676 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:21,682 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 65 transitions. [2022-03-15 19:31:21,682 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:23,509 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [5002#(and (or (not (= ~q_front~0 0)) (= ~y~0 0)) (or (= ~q_front~0 0) (<= (+ ~n~0 ~q_front~0) (+ ~q_back~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (= ~q_front~0 0))) (or (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (not (= ~q_front~0 0))) (or (<= ~x~0 ~C~0) (not (= ~q_front~0 0))) (or (<= ~C~0 ~x~0) (not (= ~q_front~0 0))) (< 0 (+ ~q_front~0 1)) (= ~q~0.offset 0) (or (<= 1 ~N~0) (not (= ~q_front~0 0)))), 4997#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 4998#(and (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 5000#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= 1 ~N~0) (= ~y~0 0) (<= ~q_front~0 0) (<= ~N~0 1) (< 0 (+ ~q_front~0 1)) (= ~q~0.offset 0)), 4999#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4)))) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 5001#(and (or (not (= ~q_front~0 0)) (= ~y~0 0)) (= (+ ~q_front~0 (* (- 1) ~q_back~0)) 0) (or (not (= ~q_front~0 0)) (= ~s~0 0)) (or (<= ~n~0 2) (<= ~q_front~0 0)) (or (= ~x~0 0) (not (= ~q_front~0 0))) (= ~q~0.offset 0))] [2022-03-15 19:31:23,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:31:23,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:23,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:31:23,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:31:23,510 INFO L87 Difference]: Start difference. First operand 101 states and 222 transitions. Second operand has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 19:31:25,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:25,166 INFO L93 Difference]: Finished difference Result 155 states and 339 transitions. [2022-03-15 19:31:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:31:25,167 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 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 18 [2022-03-15 19:31:25,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:25,168 INFO L225 Difference]: With dead ends: 155 [2022-03-15 19:31:25,168 INFO L226 Difference]: Without dead ends: 150 [2022-03-15 19:31:25,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=366, Invalid=1704, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:31:25,169 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 47 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:25,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 15 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:31:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-03-15 19:31:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 99. [2022-03-15 19:31:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.193877551020408) internal successors, (215), 98 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 215 transitions. [2022-03-15 19:31:25,172 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 215 transitions. Word has length 18 [2022-03-15 19:31:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:25,172 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 215 transitions. [2022-03-15 19:31:25,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 19:31:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 215 transitions. [2022-03-15 19:31:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:31:25,172 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:25,173 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:25,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:25,373 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 19:31:25,373 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:25,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash 977868965, now seen corresponding path program 5 times [2022-03-15 19:31:25,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:25,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190192376] [2022-03-15 19:31:25,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:25,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:25,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:25,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190192376] [2022-03-15 19:31:25,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190192376] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:25,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441432864] [2022-03-15 19:31:25,689 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:31:25,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:25,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:25,690 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 19:31:25,691 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 19:31:25,762 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:31:25,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:25,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:31:25,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:25,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:25,855 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 19:31:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:31:25,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:25,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_451 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_451) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:31:25,917 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:25,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-03-15 19:31:25,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:31:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-03-15 19:31:25,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441432864] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:25,985 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:25,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 18 [2022-03-15 19:31:25,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075359361] [2022-03-15 19:31:25,986 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:25,988 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:25,991 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 30 transitions. [2022-03-15 19:31:25,991 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:26,132 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:26,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:31:26,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:26,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:31:26,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2022-03-15 19:31:26,133 INFO L87 Difference]: Start difference. First operand 99 states and 215 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 19:31:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:26,325 INFO L93 Difference]: Finished difference Result 149 states and 322 transitions. [2022-03-15 19:31:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:31:26,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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 18 [2022-03-15 19:31:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:26,326 INFO L225 Difference]: With dead ends: 149 [2022-03-15 19:31:26,326 INFO L226 Difference]: Without dead ends: 149 [2022-03-15 19:31:26,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=355, Unknown=1, NotChecked=38, Total=462 [2022-03-15 19:31:26,327 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:26,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 8 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-03-15 19:31:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 119. [2022-03-15 19:31:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.23728813559322) internal successors, (264), 118 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 19:31:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 264 transitions. [2022-03-15 19:31:26,330 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 264 transitions. Word has length 18 [2022-03-15 19:31:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:26,330 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 264 transitions. [2022-03-15 19:31:26,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 19:31:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 264 transitions. [2022-03-15 19:31:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:31:26,331 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:26,331 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:26,353 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 19:31:26,539 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 19:31:26,540 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:26,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:26,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1454514189, now seen corresponding path program 6 times [2022-03-15 19:31:26,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:26,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670018036] [2022-03-15 19:31:26,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:26,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:26,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:26,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670018036] [2022-03-15 19:31:26,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670018036] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:26,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557772262] [2022-03-15 19:31:26,832 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:31:26,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:26,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:26,833 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 19:31:26,835 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 19:31:26,936 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:31:26,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:26,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:31:26,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:27,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:27,021 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 19:31:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:31:27,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:27,073 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_490) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:31:27,082 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:27,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-03-15 19:31:27,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:31:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:31:27,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557772262] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:27,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:31:27,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 6] total 18 [2022-03-15 19:31:27,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1443948125] [2022-03-15 19:31:27,146 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:27,148 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:27,151 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2022-03-15 19:31:27,151 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:27,172 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:27,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:31:27,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:27,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:31:27,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2022-03-15 19:31:27,176 INFO L87 Difference]: Start difference. First operand 119 states and 264 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 19:31:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:27,224 INFO L93 Difference]: Finished difference Result 138 states and 323 transitions. [2022-03-15 19:31:27,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:31:27,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 18 [2022-03-15 19:31:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:27,226 INFO L225 Difference]: With dead ends: 138 [2022-03-15 19:31:27,226 INFO L226 Difference]: Without dead ends: 138 [2022-03-15 19:31:27,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=320, Unknown=1, NotChecked=36, Total=420 [2022-03-15 19:31:27,226 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:27,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 2 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-03-15 19:31:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-03-15 19:31:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2022-03-15 19:31:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.2295081967213113) internal successors, (272), 122 states have internal predecessors, (272), 0 states have call successors, (0), 0 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 19:31:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 272 transitions. [2022-03-15 19:31:27,229 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 272 transitions. Word has length 18 [2022-03-15 19:31:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:27,229 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 272 transitions. [2022-03-15 19:31:27,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 19:31:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 272 transitions. [2022-03-15 19:31:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:31:27,230 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:27,230 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:27,250 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 19:31:27,447 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 19:31:27,448 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1776337121, now seen corresponding path program 6 times [2022-03-15 19:31:27,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:27,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068969676] [2022-03-15 19:31:27,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:27,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:31:27,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:27,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068969676] [2022-03-15 19:31:27,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068969676] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:27,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728061342] [2022-03-15 19:31:27,525 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:31:27,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:27,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:27,526 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 19:31:27,527 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 19:31:27,604 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:31:27,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:27,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:31:27,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:31:27,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:31:27,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728061342] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:27,734 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:27,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 19:31:27,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1955101722] [2022-03-15 19:31:27,734 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:27,736 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:27,740 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 37 transitions. [2022-03-15 19:31:27,741 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:27,846 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:27,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:31:27,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:27,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:31:27,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:31:27,847 INFO L87 Difference]: Start difference. First operand 123 states and 272 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 19:31:27,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:27,923 INFO L93 Difference]: Finished difference Result 151 states and 315 transitions. [2022-03-15 19:31:27,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:31:27,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-03-15 19:31:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:27,925 INFO L225 Difference]: With dead ends: 151 [2022-03-15 19:31:27,925 INFO L226 Difference]: Without dead ends: 135 [2022-03-15 19:31:27,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:31:27,926 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:27,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 5 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-03-15 19:31:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 121. [2022-03-15 19:31:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.175) internal successors, (261), 120 states have internal predecessors, (261), 0 states have call successors, (0), 0 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 19:31:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 261 transitions. [2022-03-15 19:31:27,932 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 261 transitions. Word has length 19 [2022-03-15 19:31:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:27,932 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 261 transitions. [2022-03-15 19:31:27,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 19:31:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 261 transitions. [2022-03-15 19:31:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:31:27,932 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:27,933 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:27,950 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 19:31:28,150 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 19:31:28,150 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:28,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:28,151 INFO L85 PathProgramCache]: Analyzing trace with hash 355612036, now seen corresponding path program 7 times [2022-03-15 19:31:28,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:28,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650949192] [2022-03-15 19:31:28,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:28,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:31:28,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:28,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650949192] [2022-03-15 19:31:28,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650949192] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:28,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043358059] [2022-03-15 19:31:28,208 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:31:28,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:28,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:28,210 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 19:31:28,216 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 19:31:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:28,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:31:28,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:31:28,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:31:28,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043358059] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:28,412 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:28,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2022-03-15 19:31:28,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1590302600] [2022-03-15 19:31:28,412 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:28,414 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:28,419 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 43 transitions. [2022-03-15 19:31:28,419 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:28,493 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:31:28,589 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:28,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:31:28,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:28,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:31:28,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:31:28,590 INFO L87 Difference]: Start difference. First operand 121 states and 261 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 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 19:31:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:28,647 INFO L93 Difference]: Finished difference Result 193 states and 404 transitions. [2022-03-15 19:31:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:31:28,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 19 [2022-03-15 19:31:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:28,648 INFO L225 Difference]: With dead ends: 193 [2022-03-15 19:31:28,648 INFO L226 Difference]: Without dead ends: 156 [2022-03-15 19:31:28,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:31:28,649 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:28,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-03-15 19:31:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 124. [2022-03-15 19:31:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.317073170731707) internal successors, (285), 123 states have internal predecessors, (285), 0 states have call successors, (0), 0 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 19:31:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 285 transitions. [2022-03-15 19:31:28,652 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 285 transitions. Word has length 19 [2022-03-15 19:31:28,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:28,652 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 285 transitions. [2022-03-15 19:31:28,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 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 19:31:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 285 transitions. [2022-03-15 19:31:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:31:28,653 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:28,653 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:28,670 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 19:31:28,867 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 19:31:28,867 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash 248849698, now seen corresponding path program 8 times [2022-03-15 19:31:28,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:28,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92417681] [2022-03-15 19:31:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:29,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:29,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92417681] [2022-03-15 19:31:29,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92417681] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:29,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629524863] [2022-03-15 19:31:29,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:31:29,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:29,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:29,426 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 19:31:29,470 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 19:31:29,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:31:29,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:29,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:31:29,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:30,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:30,078 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 19:31:30,195 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 25 treesize of output 7 [2022-03-15 19:31:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:31:30,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:30,424 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_597 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_597) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (= (mod c_~x~0 4294967296) (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296))) is different from false [2022-03-15 19:31:30,485 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:30,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2022-03-15 19:31:30,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-03-15 19:31:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:31:30,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629524863] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:30,842 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:30,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 32 [2022-03-15 19:31:30,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [912207766] [2022-03-15 19:31:30,842 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:30,844 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:30,849 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 37 transitions. [2022-03-15 19:31:30,849 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:31,448 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:31,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:31:31,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:31,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:31:31,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=955, Unknown=1, NotChecked=62, Total=1122 [2022-03-15 19:31:31,450 INFO L87 Difference]: Start difference. First operand 124 states and 285 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 19:31:31,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:31,829 INFO L93 Difference]: Finished difference Result 137 states and 303 transitions. [2022-03-15 19:31:31,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:31:31,830 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 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 19 [2022-03-15 19:31:31,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:31,830 INFO L225 Difference]: With dead ends: 137 [2022-03-15 19:31:31,830 INFO L226 Difference]: Without dead ends: 118 [2022-03-15 19:31:31,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=1338, Unknown=1, NotChecked=74, Total=1560 [2022-03-15 19:31:31,831 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:31,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 10 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:31:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-03-15 19:31:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-03-15 19:31:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.324786324786325) internal successors, (272), 117 states have internal predecessors, (272), 0 states have call successors, (0), 0 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 19:31:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 272 transitions. [2022-03-15 19:31:31,834 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 272 transitions. Word has length 19 [2022-03-15 19:31:31,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:31,834 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 272 transitions. [2022-03-15 19:31:31,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 19:31:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 272 transitions. [2022-03-15 19:31:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:31:31,835 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:31,835 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:31,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 19:31:32,035 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 19:31:32,036 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:32,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1840777322, now seen corresponding path program 9 times [2022-03-15 19:31:32,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:32,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075985389] [2022-03-15 19:31:32,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:32,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:32,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:32,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075985389] [2022-03-15 19:31:32,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075985389] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:32,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174774697] [2022-03-15 19:31:32,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:31:32,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:32,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:32,544 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 19:31:32,545 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 19:31:32,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:31:32,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:32,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 19:31:32,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:32,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:32,968 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 19:31:33,025 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 19:31:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:31:33,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:33,388 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:33,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2022-03-15 19:31:33,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-03-15 19:31:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:31:33,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174774697] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:33,780 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:33,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 30 [2022-03-15 19:31:33,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1618910062] [2022-03-15 19:31:33,781 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:33,782 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:33,787 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 31 transitions. [2022-03-15 19:31:33,787 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:34,349 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8150#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:31:34,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:31:34,349 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:34,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:31:34,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=935, Unknown=3, NotChecked=0, Total=1056 [2022-03-15 19:31:34,350 INFO L87 Difference]: Start difference. First operand 118 states and 272 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:34,786 INFO L93 Difference]: Finished difference Result 137 states and 314 transitions. [2022-03-15 19:31:34,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:31:34,787 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:31:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:34,787 INFO L225 Difference]: With dead ends: 137 [2022-03-15 19:31:34,787 INFO L226 Difference]: Without dead ends: 128 [2022-03-15 19:31:34,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=145, Invalid=1184, Unknown=3, NotChecked=0, Total=1332 [2022-03-15 19:31:34,788 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 34 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:34,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 6 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:31:34,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-03-15 19:31:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2022-03-15 19:31:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.330578512396694) internal successors, (282), 121 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 282 transitions. [2022-03-15 19:31:34,791 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 282 transitions. Word has length 19 [2022-03-15 19:31:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:34,791 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 282 transitions. [2022-03-15 19:31:34,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 282 transitions. [2022-03-15 19:31:34,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:31:34,792 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:34,792 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:34,811 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 19:31:34,996 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 19:31:34,996 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1595315444, now seen corresponding path program 10 times [2022-03-15 19:31:34,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:34,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007600230] [2022-03-15 19:31:34,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:34,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:35,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:35,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007600230] [2022-03-15 19:31:35,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007600230] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:35,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77485385] [2022-03-15 19:31:35,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:31:35,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:35,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:35,916 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 19:31:35,917 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 19:31:36,120 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:31:36,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:36,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 19:31:36,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:36,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:36,280 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 19:31:36,409 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 19:31:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:31:36,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:36,817 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:36,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 94 [2022-03-15 19:31:36,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2022-03-15 19:31:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:31:37,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77485385] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:37,135 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:37,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2022-03-15 19:31:37,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280515277] [2022-03-15 19:31:37,135 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:37,137 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:37,142 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2022-03-15 19:31:37,142 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:38,007 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [8680#(and (or (= (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 8682#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= 1 ~N~0) (= ~y~0 0) (or (= ~q_front~0 1) (= ~q_front~0 0)) (<= ~N~0 1) (= ~q~0.offset 0)), 8681#(and (or (= (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 8679#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= (+ ~x~0 (* (div ~x~0 4294967296) (- 4294967296))) (+ (* (div (+ ~y~0 ~C~0) 4294967296) (- 4294967296)) ~y~0 ~C~0))))] [2022-03-15 19:31:38,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:31:38,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:38,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:31:38,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1055, Unknown=2, NotChecked=0, Total=1190 [2022-03-15 19:31:38,008 INFO L87 Difference]: Start difference. First operand 122 states and 282 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 19:31:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:39,142 INFO L93 Difference]: Finished difference Result 156 states and 353 transitions. [2022-03-15 19:31:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:31:39,143 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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 19 [2022-03-15 19:31:39,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:39,144 INFO L225 Difference]: With dead ends: 156 [2022-03-15 19:31:39,144 INFO L226 Difference]: Without dead ends: 143 [2022-03-15 19:31:39,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=205, Invalid=1515, Unknown=2, NotChecked=0, Total=1722 [2022-03-15 19:31:39,145 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 63 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:39,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 8 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:31:39,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-03-15 19:31:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 122. [2022-03-15 19:31:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.3140495867768593) internal successors, (280), 121 states have internal predecessors, (280), 0 states have call successors, (0), 0 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 19:31:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 280 transitions. [2022-03-15 19:31:39,149 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 280 transitions. Word has length 19 [2022-03-15 19:31:39,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:39,149 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 280 transitions. [2022-03-15 19:31:39,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 19:31:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 280 transitions. [2022-03-15 19:31:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:31:39,149 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:39,150 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:39,170 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 19:31:39,350 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 19:31:39,350 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:39,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:39,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1902346962, now seen corresponding path program 11 times [2022-03-15 19:31:39,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:39,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281803664] [2022-03-15 19:31:39,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:39,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:39,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:39,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281803664] [2022-03-15 19:31:39,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281803664] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:39,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534491182] [2022-03-15 19:31:39,667 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:31:39,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:39,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:39,669 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 19:31:39,670 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 19:31:40,211 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:31:40,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:40,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:31:40,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:40,396 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 25 treesize of output 7 [2022-03-15 19:31:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:31:40,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:40,630 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:40,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-03-15 19:31:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:31:41,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534491182] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:41,018 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:41,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 27 [2022-03-15 19:31:41,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [554368471] [2022-03-15 19:31:41,018 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:41,020 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:41,026 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 51 transitions. [2022-03-15 19:31:41,026 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:41,831 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [9235#(and (= ~x~0 0) (or (<= (* ~n~0 4) 12) (<= ~q_front~0 0)) (= ~y~0 0) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), 9234#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~C~0 ~x~0) (<= 1 ~N~0) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1)) (<= ~x~0 ~C~0) (= ~y~0 0) (= ~q~0.offset 0)), 9236#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:31:41,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:31:41,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:41,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:31:41,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:31:41,832 INFO L87 Difference]: Start difference. First operand 122 states and 280 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 19:31:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:42,334 INFO L93 Difference]: Finished difference Result 146 states and 330 transitions. [2022-03-15 19:31:42,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:31:42,334 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 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 19 [2022-03-15 19:31:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:42,335 INFO L225 Difference]: With dead ends: 146 [2022-03-15 19:31:42,335 INFO L226 Difference]: Without dead ends: 137 [2022-03-15 19:31:42,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:31:42,336 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:42,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:31:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-03-15 19:31:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2022-03-15 19:31:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.3140495867768593) internal successors, (280), 121 states have internal predecessors, (280), 0 states have call successors, (0), 0 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 19:31:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 280 transitions. [2022-03-15 19:31:42,339 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 280 transitions. Word has length 19 [2022-03-15 19:31:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:42,339 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 280 transitions. [2022-03-15 19:31:42,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 19:31:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 280 transitions. [2022-03-15 19:31:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:31:42,340 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:42,340 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:42,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:42,540 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 19:31:42,540 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:42,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:42,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1043472432, now seen corresponding path program 12 times [2022-03-15 19:31:42,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:42,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024242202] [2022-03-15 19:31:42,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:42,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:43,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:43,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024242202] [2022-03-15 19:31:43,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024242202] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:43,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100849764] [2022-03-15 19:31:43,090 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:31:43,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:43,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:43,091 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:31:43,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 19:31:43,401 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:31:43,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:43,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:31:43,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:43,617 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 25 treesize of output 7 [2022-03-15 19:31:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:31:43,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:43,832 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:43,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-03-15 19:31:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:31:44,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100849764] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:44,036 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:44,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 27 [2022-03-15 19:31:44,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1859097449] [2022-03-15 19:31:44,037 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:44,039 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:44,045 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 66 transitions. [2022-03-15 19:31:44,045 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:46,246 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [9776#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 9780#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= ~n~0 ~q_back~0)) (<= ~C~0 ~x~0) (<= 1 ~N~0) (<= ~x~0 ~C~0) (= ~y~0 0) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (= (+ ~q~0.offset (* ~q_front~0 4)) 0))) (= ~q~0.offset 0) (<= 0 ~q_front~0) (or (<= (+ ~q_front~0 1) ~q_back~0) (= ~q_front~0 0) (<= ~n~0 ~q_back~0))), 9781#(and (= ~x~0 0) (or (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 1)) (= ~y~0 0) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), 9779#(and (<= (* 2 ~C~0) ~x~0) (or (= ~q_front~0 0) (< ~q_front~0 ~n~0)) (<= ~x~0 (* 2 ~C~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= 1 ~N~0) (= ~y~0 0) (or (= ~q_front~0 0) (< ~q_front~0 ~q_back~0)) (<= ~N~0 1) (= ~q~0.offset 0) (<= 0 ~q_front~0)), 9778#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4)))) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 9777#(and (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:31:46,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:31:46,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:46,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:31:46,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:31:46,247 INFO L87 Difference]: Start difference. First operand 122 states and 280 transitions. Second operand has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 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 19:31:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:47,743 INFO L93 Difference]: Finished difference Result 158 states and 356 transitions. [2022-03-15 19:31:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:31:47,744 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 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 19 [2022-03-15 19:31:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:47,744 INFO L225 Difference]: With dead ends: 158 [2022-03-15 19:31:47,744 INFO L226 Difference]: Without dead ends: 145 [2022-03-15 19:31:47,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=326, Invalid=1566, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:31:47,745 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 51 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:47,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 18 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:31:47,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-03-15 19:31:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2022-03-15 19:31:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.3130434782608695) internal successors, (266), 115 states have internal predecessors, (266), 0 states have call successors, (0), 0 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 19:31:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 266 transitions. [2022-03-15 19:31:47,748 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 266 transitions. Word has length 19 [2022-03-15 19:31:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:47,748 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 266 transitions. [2022-03-15 19:31:47,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 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 19:31:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 266 transitions. [2022-03-15 19:31:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:31:47,749 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:47,749 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:47,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:47,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:47,954 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:47,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:47,954 INFO L85 PathProgramCache]: Analyzing trace with hash 661047748, now seen corresponding path program 7 times [2022-03-15 19:31:47,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:47,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508128178] [2022-03-15 19:31:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:47,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:48,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:48,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508128178] [2022-03-15 19:31:48,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508128178] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:48,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522732199] [2022-03-15 19:31:48,203 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:31:48,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:48,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:48,204 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:31:48,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 19:31:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:48,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:31:48,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:48,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:48,408 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 19:31:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:31:48,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:48,462 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_794 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_794) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:31:48,474 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:48,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-03-15 19:31:48,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:31:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2022-03-15 19:31:48,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522732199] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:48,544 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:48,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 5] total 21 [2022-03-15 19:31:48,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [383728055] [2022-03-15 19:31:48,545 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:48,547 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:48,550 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 31 transitions. [2022-03-15 19:31:48,550 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:48,631 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:48,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:31:48,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:48,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:31:48,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=351, Unknown=1, NotChecked=38, Total=462 [2022-03-15 19:31:48,632 INFO L87 Difference]: Start difference. First operand 116 states and 266 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 19:31:48,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:48,857 INFO L93 Difference]: Finished difference Result 168 states and 385 transitions. [2022-03-15 19:31:48,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:31:48,857 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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 19 [2022-03-15 19:31:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:48,858 INFO L225 Difference]: With dead ends: 168 [2022-03-15 19:31:48,858 INFO L226 Difference]: Without dead ends: 168 [2022-03-15 19:31:48,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=531, Unknown=1, NotChecked=48, Total=702 [2022-03-15 19:31:48,859 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:48,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 8 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-03-15 19:31:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2022-03-15 19:31:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.268965517241379) internal successors, (329), 145 states have internal predecessors, (329), 0 states have call successors, (0), 0 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 19:31:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 329 transitions. [2022-03-15 19:31:48,862 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 329 transitions. Word has length 19 [2022-03-15 19:31:48,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:48,862 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 329 transitions. [2022-03-15 19:31:48,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 19:31:48,862 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 329 transitions. [2022-03-15 19:31:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:31:48,862 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:48,862 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:48,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:49,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 19:31:49,063 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1287107040, now seen corresponding path program 13 times [2022-03-15 19:31:49,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:49,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459400605] [2022-03-15 19:31:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:49,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:49,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:49,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459400605] [2022-03-15 19:31:49,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459400605] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:49,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326115686] [2022-03-15 19:31:49,349 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:31:49,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:49,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:49,351 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:31:49,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 19:31:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:49,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:31:49,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:49,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:49,687 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 19:31:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:49,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:49,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_833 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_833) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-03-15 19:31:49,916 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:49,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-03-15 19:31:49,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-03-15 19:31:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:50,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326115686] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:50,270 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:50,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 19:31:50,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [794113249] [2022-03-15 19:31:50,271 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:50,273 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:50,278 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2022-03-15 19:31:50,279 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:50,555 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:50,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:31:50,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:50,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:31:50,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=802, Unknown=1, NotChecked=58, Total=992 [2022-03-15 19:31:50,556 INFO L87 Difference]: Start difference. First operand 146 states and 329 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:50,885 INFO L93 Difference]: Finished difference Result 217 states and 491 transitions. [2022-03-15 19:31:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:31:50,886 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:31:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:50,887 INFO L225 Difference]: With dead ends: 217 [2022-03-15 19:31:50,887 INFO L226 Difference]: Without dead ends: 215 [2022-03-15 19:31:50,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=1135, Unknown=1, NotChecked=70, Total=1406 [2022-03-15 19:31:50,888 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:50,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 9 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:31:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-03-15 19:31:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2022-03-15 19:31:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 2.3877551020408165) internal successors, (468), 196 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 19:31:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 468 transitions. [2022-03-15 19:31:50,892 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 468 transitions. Word has length 20 [2022-03-15 19:31:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:50,892 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 468 transitions. [2022-03-15 19:31:50,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 468 transitions. [2022-03-15 19:31:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:31:50,893 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:50,893 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:50,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:51,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 19:31:51,094 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:51,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:51,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1028053812, now seen corresponding path program 14 times [2022-03-15 19:31:51,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:51,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017120003] [2022-03-15 19:31:51,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:51,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:51,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017120003] [2022-03-15 19:31:51,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017120003] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:51,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144001646] [2022-03-15 19:31:51,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:31:51,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:51,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:51,344 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:31:51,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 19:31:51,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:31:51,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:51,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:31:51,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:51,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:51,611 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 19:31:51,692 INFO L353 Elim1Store]: treesize reduction 8, result has 50.0 percent of original size [2022-03-15 19:31:51,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2022-03-15 19:31:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:51,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:51,802 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:51,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-03-15 19:31:51,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-03-15 19:31:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:52,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144001646] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:52,073 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:52,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 19:31:52,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [528101958] [2022-03-15 19:31:52,073 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:52,075 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:52,080 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 28 transitions. [2022-03-15 19:31:52,080 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:52,131 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:52,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:31:52,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:52,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:31:52,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=829, Unknown=5, NotChecked=0, Total=992 [2022-03-15 19:31:52,132 INFO L87 Difference]: Start difference. First operand 197 states and 468 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:52,325 INFO L93 Difference]: Finished difference Result 260 states and 627 transitions. [2022-03-15 19:31:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:31:52,325 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:31:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:52,326 INFO L225 Difference]: With dead ends: 260 [2022-03-15 19:31:52,327 INFO L226 Difference]: Without dead ends: 254 [2022-03-15 19:31:52,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=888, Unknown=6, NotChecked=0, Total=1056 [2022-03-15 19:31:52,327 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:52,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 9 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-03-15 19:31:52,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 219. [2022-03-15 19:31:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.4862385321100917) internal successors, (542), 218 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 19:31:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 542 transitions. [2022-03-15 19:31:52,332 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 542 transitions. Word has length 20 [2022-03-15 19:31:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:52,332 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 542 transitions. [2022-03-15 19:31:52,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 542 transitions. [2022-03-15 19:31:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:31:52,333 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:52,333 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:52,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:52,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 19:31:52,550 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1415932632, now seen corresponding path program 15 times [2022-03-15 19:31:52,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:52,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756220464] [2022-03-15 19:31:52,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:52,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:52,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:52,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756220464] [2022-03-15 19:31:52,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756220464] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:52,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447972129] [2022-03-15 19:31:52,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:31:52,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:52,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:52,891 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:31:52,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 19:31:53,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:31:53,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:53,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:31:53,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:53,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:31:53,167 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 19 treesize of output 21 [2022-03-15 19:31:53,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:31:53,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:53,251 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_911) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-03-15 19:31:53,260 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:31:53,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-03-15 19:31:53,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-03-15 19:31:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:31:53,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447972129] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:53,356 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:53,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2022-03-15 19:31:53,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [933835979] [2022-03-15 19:31:53,356 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:53,358 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:53,363 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 32 transitions. [2022-03-15 19:31:53,363 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:53,533 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12542#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:31:53,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:31:53,533 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:53,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:31:53,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=442, Unknown=1, NotChecked=42, Total=552 [2022-03-15 19:31:53,534 INFO L87 Difference]: Start difference. First operand 219 states and 542 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:54,128 INFO L93 Difference]: Finished difference Result 296 states and 687 transitions. [2022-03-15 19:31:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:31:54,128 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:31:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:54,130 INFO L225 Difference]: With dead ends: 296 [2022-03-15 19:31:54,130 INFO L226 Difference]: Without dead ends: 296 [2022-03-15 19:31:54,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=760, Unknown=1, NotChecked=56, Total=930 [2022-03-15 19:31:54,130 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:54,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 10 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:31:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-03-15 19:31:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 209. [2022-03-15 19:31:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.5) internal successors, (520), 208 states have internal predecessors, (520), 0 states have call successors, (0), 0 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 19:31:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 520 transitions. [2022-03-15 19:31:54,135 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 520 transitions. Word has length 20 [2022-03-15 19:31:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:54,135 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 520 transitions. [2022-03-15 19:31:54,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 520 transitions. [2022-03-15 19:31:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:31:54,136 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:54,136 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:54,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:54,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:54,337 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:54,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1440313816, now seen corresponding path program 16 times [2022-03-15 19:31:54,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:54,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75123278] [2022-03-15 19:31:54,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:54,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:54,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:54,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75123278] [2022-03-15 19:31:54,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75123278] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:54,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332056284] [2022-03-15 19:31:54,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:31:54,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:54,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:54,521 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:31:54,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 19:31:54,617 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:31:54,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:54,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:31:54,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:54,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:54,969 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 19:31:54,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2022-03-15 19:31:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:55,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332056284] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:55,163 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:55,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 19:31:55,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [788544406] [2022-03-15 19:31:55,163 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:55,165 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:55,172 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 56 transitions. [2022-03-15 19:31:55,172 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:56,101 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13414#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< ~q_front~0 (+ ~q_back~0 1)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (<= 0 ~q_front~0) (< ~q_back~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ 4 (* ~q_front~0 4))) 1) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (= ~q~0.offset 0) (< ~q_back~0 0))), 13415#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ 4 (* ~q_front~0 4))) 1) (< ~q_back~0 0)) (or (< ~q_front~0 (+ 2 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (= ~q~0.offset 0) (< ~q_back~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (<= 0 ~q_front~0) (< ~q_back~0 0)))] [2022-03-15 19:31:56,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:31:56,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:56,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:31:56,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:31:56,103 INFO L87 Difference]: Start difference. First operand 209 states and 520 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:56,385 INFO L93 Difference]: Finished difference Result 305 states and 745 transitions. [2022-03-15 19:31:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:31:56,385 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:31:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:56,386 INFO L225 Difference]: With dead ends: 305 [2022-03-15 19:31:56,386 INFO L226 Difference]: Without dead ends: 305 [2022-03-15 19:31:56,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:31:56,387 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:56,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:31:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-03-15 19:31:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 209. [2022-03-15 19:31:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.5) internal successors, (520), 208 states have internal predecessors, (520), 0 states have call successors, (0), 0 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 19:31:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 520 transitions. [2022-03-15 19:31:56,392 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 520 transitions. Word has length 20 [2022-03-15 19:31:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:56,392 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 520 transitions. [2022-03-15 19:31:56,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:31:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 520 transitions. [2022-03-15 19:31:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:31:56,392 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:56,392 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:56,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:56,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:31:56,593 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:56,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2089709162, now seen corresponding path program 17 times [2022-03-15 19:31:56,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:56,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781086806] [2022-03-15 19:31:56,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:56,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:56,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:56,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781086806] [2022-03-15 19:31:56,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781086806] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:56,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058715152] [2022-03-15 19:31:56,950 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:31:56,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:56,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:56,964 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:31:56,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 19:31:57,058 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:31:57,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:57,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:31:57,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:31:57,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:57,150 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:31:57,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-03-15 19:31:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:31:57,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058715152] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:57,177 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:57,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2022-03-15 19:31:57,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [797731105] [2022-03-15 19:31:57,178 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:57,180 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:57,185 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 30 transitions. [2022-03-15 19:31:57,185 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:57,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:57,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:31:57,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:57,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:31:57,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:31:57,269 INFO L87 Difference]: Start difference. First operand 209 states and 520 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 19:31:57,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:57,445 INFO L93 Difference]: Finished difference Result 229 states and 516 transitions. [2022-03-15 19:31:57,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:31:57,446 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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 20 [2022-03-15 19:31:57,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:57,447 INFO L225 Difference]: With dead ends: 229 [2022-03-15 19:31:57,447 INFO L226 Difference]: Without dead ends: 198 [2022-03-15 19:31:57,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:31:57,448 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:57,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 8 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-03-15 19:31:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 172. [2022-03-15 19:31:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.2690058479532165) internal successors, (388), 171 states have internal predecessors, (388), 0 states have call successors, (0), 0 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 19:31:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 388 transitions. [2022-03-15 19:31:57,453 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 388 transitions. Word has length 20 [2022-03-15 19:31:57,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:57,453 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 388 transitions. [2022-03-15 19:31:57,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 19:31:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 388 transitions. [2022-03-15 19:31:57,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:31:57,453 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:57,453 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:57,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:57,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:57,672 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:57,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:57,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1701830342, now seen corresponding path program 18 times [2022-03-15 19:31:57,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:57,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099532745] [2022-03-15 19:31:57,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:57,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:57,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099532745] [2022-03-15 19:31:57,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099532745] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:57,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209459992] [2022-03-15 19:31:57,889 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:31:57,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:57,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:57,908 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:31:57,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 19:31:58,027 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:31:58,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:31:58,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:31:58,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:58,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:58,319 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:31:58,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-03-15 19:31:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:31:58,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209459992] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:58,608 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:58,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-03-15 19:31:58,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [617968711] [2022-03-15 19:31:58,608 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:58,610 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:58,615 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 34 transitions. [2022-03-15 19:31:58,615 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:58,741 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [15002#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:31:58,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:31:58,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:31:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:31:58,742 INFO L87 Difference]: Start difference. First operand 172 states and 388 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 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 19:31:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:59,138 INFO L93 Difference]: Finished difference Result 233 states and 503 transitions. [2022-03-15 19:31:59,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:31:59,140 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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 20 [2022-03-15 19:31:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:59,141 INFO L225 Difference]: With dead ends: 233 [2022-03-15 19:31:59,141 INFO L226 Difference]: Without dead ends: 233 [2022-03-15 19:31:59,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=1340, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:31:59,143 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 56 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:59,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 8 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-03-15 19:31:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 164. [2022-03-15 19:31:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.233128834355828) internal successors, (364), 163 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 19:31:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 364 transitions. [2022-03-15 19:31:59,146 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 364 transitions. Word has length 20 [2022-03-15 19:31:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:59,146 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 364 transitions. [2022-03-15 19:31:59,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 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 19:31:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 364 transitions. [2022-03-15 19:31:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:31:59,147 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:59,147 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:59,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:59,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-03-15 19:31:59,364 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:31:59,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:59,364 INFO L85 PathProgramCache]: Analyzing trace with hash -982673437, now seen corresponding path program 19 times [2022-03-15 19:31:59,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:59,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340811975] [2022-03-15 19:31:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:00,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:00,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340811975] [2022-03-15 19:32:00,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340811975] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:00,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242406360] [2022-03-15 19:32:00,023 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:32:00,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:00,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:00,049 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:00,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 19:32:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:00,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:32:00,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:00,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:00,777 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 19:32:00,893 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 19:32:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:00,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:01,140 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1068 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1068) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod c_~x~0 4294967296) (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296))) is different from false [2022-03-15 19:32:01,206 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:32:01,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2022-03-15 19:32:01,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-03-15 19:32:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:32:01,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242406360] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:01,826 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:01,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 34 [2022-03-15 19:32:01,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1163130052] [2022-03-15 19:32:01,826 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:01,829 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:01,833 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2022-03-15 19:32:01,833 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:02,429 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:32:02,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:32:02,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:02,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:32:02,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1079, Unknown=1, NotChecked=66, Total=1260 [2022-03-15 19:32:02,431 INFO L87 Difference]: Start difference. First operand 164 states and 364 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:02,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:02,824 INFO L93 Difference]: Finished difference Result 198 states and 429 transitions. [2022-03-15 19:32:02,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:32:02,824 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:32:02,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:02,825 INFO L225 Difference]: With dead ends: 198 [2022-03-15 19:32:02,825 INFO L226 Difference]: Without dead ends: 179 [2022-03-15 19:32:02,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=148, Invalid=1415, Unknown=1, NotChecked=76, Total=1640 [2022-03-15 19:32:02,826 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:02,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 10 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:32:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-03-15 19:32:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2022-03-15 19:32:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.2363636363636363) internal successors, (369), 165 states have internal predecessors, (369), 0 states have call successors, (0), 0 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 19:32:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 369 transitions. [2022-03-15 19:32:02,829 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 369 transitions. Word has length 20 [2022-03-15 19:32:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:02,829 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 369 transitions. [2022-03-15 19:32:02,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 369 transitions. [2022-03-15 19:32:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:32:02,829 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:02,829 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:02,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 19:32:03,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:03,030 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:03,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:03,030 INFO L85 PathProgramCache]: Analyzing trace with hash 609254187, now seen corresponding path program 20 times [2022-03-15 19:32:03,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:03,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055224873] [2022-03-15 19:32:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:03,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:03,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055224873] [2022-03-15 19:32:03,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055224873] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:03,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721402403] [2022-03-15 19:32:03,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:32:03,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:03,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:03,629 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:03,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 19:32:04,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:32:04,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:04,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 19:32:04,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:04,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:04,260 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 19:32:04,358 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 19:32:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:04,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:04,778 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:32:04,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2022-03-15 19:32:04,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-03-15 19:32:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:32:05,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721402403] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:05,537 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:05,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 34 [2022-03-15 19:32:05,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2104190325] [2022-03-15 19:32:05,537 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:05,551 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:05,580 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 32 transitions. [2022-03-15 19:32:05,581 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:05,918 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [16424#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:32:05,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:32:05,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:05,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:32:05,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1188, Unknown=2, NotChecked=0, Total=1332 [2022-03-15 19:32:05,920 INFO L87 Difference]: Start difference. First operand 166 states and 369 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 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 19:32:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:06,388 INFO L93 Difference]: Finished difference Result 201 states and 446 transitions. [2022-03-15 19:32:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:32:06,389 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 20 [2022-03-15 19:32:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:06,392 INFO L225 Difference]: With dead ends: 201 [2022-03-15 19:32:06,392 INFO L226 Difference]: Without dead ends: 192 [2022-03-15 19:32:06,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=230, Invalid=1838, Unknown=2, NotChecked=0, Total=2070 [2022-03-15 19:32:06,393 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 63 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:06,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 9 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:32:06,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-03-15 19:32:06,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 170. [2022-03-15 19:32:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 2.242603550295858) internal successors, (379), 169 states have internal predecessors, (379), 0 states have call successors, (0), 0 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 19:32:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 379 transitions. [2022-03-15 19:32:06,421 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 379 transitions. Word has length 20 [2022-03-15 19:32:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:06,422 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 379 transitions. [2022-03-15 19:32:06,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 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 19:32:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 379 transitions. [2022-03-15 19:32:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:32:06,422 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:06,422 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:06,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 19:32:06,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:06,638 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:06,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:06,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1468128717, now seen corresponding path program 21 times [2022-03-15 19:32:06,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:06,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329458381] [2022-03-15 19:32:06,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:06,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:07,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:07,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329458381] [2022-03-15 19:32:07,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329458381] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:07,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861030859] [2022-03-15 19:32:07,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:32:07,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:07,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:07,170 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:07,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 19:32:07,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:32:07,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:07,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:32:07,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:07,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:07,467 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 19:32:07,554 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 19:32:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:32:07,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:07,906 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:32:07,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 80 [2022-03-15 19:32:07,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-03-15 19:32:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:32:08,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861030859] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:08,452 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:08,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 31 [2022-03-15 19:32:08,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [962649754] [2022-03-15 19:32:08,452 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:08,455 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:08,460 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 47 transitions. [2022-03-15 19:32:08,460 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:09,585 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [17132#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 17131#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 17134#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= 1 ~N~0) (= ~y~0 0) (<= ~N~0 1) (= ~q~0.offset 0) (<= 0 ~q_front~0)), 17133#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4)))) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:32:09,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:32:09,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:09,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:32:09,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1164, Unknown=2, NotChecked=0, Total=1332 [2022-03-15 19:32:09,586 INFO L87 Difference]: Start difference. First operand 170 states and 379 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 19:32:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:11,125 INFO L93 Difference]: Finished difference Result 223 states and 494 transitions. [2022-03-15 19:32:11,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:32:11,125 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 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 20 [2022-03-15 19:32:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:11,126 INFO L225 Difference]: With dead ends: 223 [2022-03-15 19:32:11,126 INFO L226 Difference]: Without dead ends: 205 [2022-03-15 19:32:11,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=329, Invalid=1925, Unknown=2, NotChecked=0, Total=2256 [2022-03-15 19:32:11,127 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 93 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:11,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 12 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:32:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-03-15 19:32:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 162. [2022-03-15 19:32:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.229813664596273) internal successors, (359), 161 states have internal predecessors, (359), 0 states have call successors, (0), 0 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 19:32:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 359 transitions. [2022-03-15 19:32:11,130 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 359 transitions. Word has length 20 [2022-03-15 19:32:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:11,130 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 359 transitions. [2022-03-15 19:32:11,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 19:32:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 359 transitions. [2022-03-15 19:32:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:32:11,131 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:11,131 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:11,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-15 19:32:11,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:11,335 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:11,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1161097199, now seen corresponding path program 22 times [2022-03-15 19:32:11,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:11,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567395258] [2022-03-15 19:32:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:11,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:11,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:11,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567395258] [2022-03-15 19:32:11,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567395258] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:11,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826949232] [2022-03-15 19:32:11,698 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:32:11,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:11,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:11,699 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:11,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 19:32:11,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:32:11,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:11,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 19:32:11,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:12,045 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 19:32:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:32:12,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:12,229 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:32:12,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 45 [2022-03-15 19:32:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:32:12,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826949232] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:12,503 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:12,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 7] total 28 [2022-03-15 19:32:12,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1108845319] [2022-03-15 19:32:12,503 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:12,505 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:12,511 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 52 transitions. [2022-03-15 19:32:12,512 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:13,275 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [17850#(and (= ~x~0 0) (= ~y~0 0) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), 17848#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~C~0 ~x~0) (<= 1 ~N~0) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1)) (<= ~x~0 ~C~0) (= ~y~0 0) (= ~q~0.offset 0)), 17849#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:32:13,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:32:13,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:13,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:32:13,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:32:13,276 INFO L87 Difference]: Start difference. First operand 162 states and 359 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:13,636 INFO L93 Difference]: Finished difference Result 205 states and 451 transitions. [2022-03-15 19:32:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:32:13,637 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:32:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:13,637 INFO L225 Difference]: With dead ends: 205 [2022-03-15 19:32:13,637 INFO L226 Difference]: Without dead ends: 196 [2022-03-15 19:32:13,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:32:13,638 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 48 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:13,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 10 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:32:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-03-15 19:32:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 166. [2022-03-15 19:32:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.2363636363636363) internal successors, (369), 165 states have internal predecessors, (369), 0 states have call successors, (0), 0 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 19:32:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 369 transitions. [2022-03-15 19:32:13,641 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 369 transitions. Word has length 20 [2022-03-15 19:32:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:13,641 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 369 transitions. [2022-03-15 19:32:13,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 369 transitions. [2022-03-15 19:32:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:32:13,642 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:13,642 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:13,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 19:32:13,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-15 19:32:13,859 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:13,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2019971729, now seen corresponding path program 23 times [2022-03-15 19:32:13,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:13,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525740972] [2022-03-15 19:32:13,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:13,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:14,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:14,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525740972] [2022-03-15 19:32:14,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525740972] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:14,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361269645] [2022-03-15 19:32:14,333 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:32:14,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:14,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:14,334 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:14,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 19:32:14,836 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:32:14,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:14,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 19:32:14,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:15,052 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 19:32:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:15,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:15,320 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:32:15,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 45 [2022-03-15 19:32:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:32:15,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361269645] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:15,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:15,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 7] total 29 [2022-03-15 19:32:15,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1999858192] [2022-03-15 19:32:15,611 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:15,613 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:15,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 67 transitions. [2022-03-15 19:32:15,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:17,111 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [18553#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= 1 ~N~0) (= ~y~0 0) (<= ~N~0 1) (< 0 (+ ~q_front~0 1)) (= ~q~0.offset 0)), 18551#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 18550#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 18549#(and (= ~x~0 0) (= ~y~0 0) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), 18552#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4)))) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 18554#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~C~0 ~x~0) (<= 1 ~N~0) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (< 0 (+ ~q_front~0 1))) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1)) (<= ~x~0 ~C~0) (= ~y~0 0) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (= (+ ~q~0.offset (* ~q_front~0 4)) 0))) (= ~q~0.offset 0))] [2022-03-15 19:32:17,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:32:17,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:17,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:32:17,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:32:17,113 INFO L87 Difference]: Start difference. First operand 166 states and 369 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 19:32:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:18,012 INFO L93 Difference]: Finished difference Result 221 states and 487 transitions. [2022-03-15 19:32:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:32:18,013 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 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 20 [2022-03-15 19:32:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:18,014 INFO L225 Difference]: With dead ends: 221 [2022-03-15 19:32:18,014 INFO L226 Difference]: Without dead ends: 208 [2022-03-15 19:32:18,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=383, Invalid=1779, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:32:18,014 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 66 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:18,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 11 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:32:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-03-15 19:32:18,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 164. [2022-03-15 19:32:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.2208588957055215) internal successors, (362), 163 states have internal predecessors, (362), 0 states have call successors, (0), 0 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 19:32:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 362 transitions. [2022-03-15 19:32:18,017 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 362 transitions. Word has length 20 [2022-03-15 19:32:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:18,017 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 362 transitions. [2022-03-15 19:32:18,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 19:32:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 362 transitions. [2022-03-15 19:32:18,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:32:18,018 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:18,018 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:18,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 19:32:18,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 19:32:18,219 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:18,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:18,219 INFO L85 PathProgramCache]: Analyzing trace with hash -570475387, now seen corresponding path program 8 times [2022-03-15 19:32:18,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:18,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779638304] [2022-03-15 19:32:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:18,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:18,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779638304] [2022-03-15 19:32:18,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779638304] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:18,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797819341] [2022-03-15 19:32:18,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:32:18,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:18,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:18,855 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:18,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 19:32:18,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:32:18,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:18,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:32:18,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:19,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:19,100 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 19:32:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:19,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:19,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1285 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1285) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:32:19,164 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:32:19,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-03-15 19:32:19,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:32:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 1 not checked. [2022-03-15 19:32:19,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797819341] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:19,239 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:19,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 5] total 24 [2022-03-15 19:32:19,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [105725500] [2022-03-15 19:32:19,239 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:19,241 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:19,245 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 32 transitions. [2022-03-15 19:32:19,245 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:19,375 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:32:19,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:32:19,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:32:19,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=475, Unknown=1, NotChecked=44, Total=600 [2022-03-15 19:32:19,377 INFO L87 Difference]: Start difference. First operand 164 states and 362 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:19,848 INFO L93 Difference]: Finished difference Result 224 states and 502 transitions. [2022-03-15 19:32:19,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:32:19,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:32:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:19,849 INFO L225 Difference]: With dead ends: 224 [2022-03-15 19:32:19,849 INFO L226 Difference]: Without dead ends: 224 [2022-03-15 19:32:19,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=898, Unknown=1, NotChecked=62, Total=1122 [2022-03-15 19:32:19,850 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 67 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:19,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 9 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:32:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-03-15 19:32:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 186. [2022-03-15 19:32:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.2054054054054055) internal successors, (408), 185 states have internal predecessors, (408), 0 states have call successors, (0), 0 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 19:32:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 408 transitions. [2022-03-15 19:32:19,852 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 408 transitions. Word has length 20 [2022-03-15 19:32:19,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:19,853 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 408 transitions. [2022-03-15 19:32:19,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:19,853 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 408 transitions. [2022-03-15 19:32:19,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:32:19,853 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:19,853 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:19,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 19:32:20,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:20,063 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:20,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:20,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1245295431, now seen corresponding path program 24 times [2022-03-15 19:32:20,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:20,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738516006] [2022-03-15 19:32:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:20,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:20,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738516006] [2022-03-15 19:32:20,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738516006] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:20,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347103531] [2022-03-15 19:32:20,671 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:32:20,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:20,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:20,680 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:20,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 19:32:20,814 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:32:20,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:20,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 19:32:20,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:21,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:21,129 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 30 treesize of output 30 [2022-03-15 19:32:21,323 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:32:21,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-03-15 19:32:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:21,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:21,667 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1324 (Array Int Int))) (= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q~0.offset 4)) (select .cse0 (+ .cse1 c_~q~0.offset)))))) (= (mod c_~x~0 4294967296) (mod (+ c_~y~0 (* c_~C~0 3)) 4294967296))) is different from false [2022-03-15 19:32:21,848 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:32:21,849 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 151 [2022-03-15 19:32:21,855 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:32:21,856 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 90 treesize of output 77 [2022-03-15 19:32:21,862 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:32:21,862 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 77 treesize of output 64 [2022-03-15 19:32:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:32:22,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347103531] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:22,274 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:22,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 38 [2022-03-15 19:32:22,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1868247879] [2022-03-15 19:32:22,275 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:22,277 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:22,283 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 45 transitions. [2022-03-15 19:32:22,283 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:22,987 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:32:22,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:32:22,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:22,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:32:22,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1370, Unknown=1, NotChecked=74, Total=1560 [2022-03-15 19:32:22,988 INFO L87 Difference]: Start difference. First operand 186 states and 408 transitions. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:23,706 INFO L93 Difference]: Finished difference Result 203 states and 437 transitions. [2022-03-15 19:32:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:32:23,706 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:32:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:23,707 INFO L225 Difference]: With dead ends: 203 [2022-03-15 19:32:23,707 INFO L226 Difference]: Without dead ends: 198 [2022-03-15 19:32:23,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=150, Invalid=1745, Unknown=1, NotChecked=84, Total=1980 [2022-03-15 19:32:23,708 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:23,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 11 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:32:23,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-03-15 19:32:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2022-03-15 19:32:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.195767195767196) internal successors, (415), 189 states have internal predecessors, (415), 0 states have call successors, (0), 0 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 19:32:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 415 transitions. [2022-03-15 19:32:23,711 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 415 transitions. Word has length 21 [2022-03-15 19:32:23,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:23,711 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 415 transitions. [2022-03-15 19:32:23,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 415 transitions. [2022-03-15 19:32:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:32:23,711 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:23,711 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:23,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-03-15 19:32:23,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 19:32:23,916 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:23,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2104386677, now seen corresponding path program 25 times [2022-03-15 19:32:23,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:23,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105864855] [2022-03-15 19:32:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:23,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:24,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:24,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105864855] [2022-03-15 19:32:24,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105864855] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:24,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851426150] [2022-03-15 19:32:24,422 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:32:24,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:24,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:24,424 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:24,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 19:32:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:24,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 19:32:24,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:24,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:24,701 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 30 treesize of output 30 [2022-03-15 19:32:24,810 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:32:24,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:32:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:24,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:25,340 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:32:25,341 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 165 [2022-03-15 19:32:25,346 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:32:25,347 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 104 treesize of output 91 [2022-03-15 19:32:25,353 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:32:25,354 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 91 treesize of output 78 [2022-03-15 19:32:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:32:25,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851426150] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:25,700 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:25,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 37 [2022-03-15 19:32:25,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217821644] [2022-03-15 19:32:25,700 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:25,702 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:25,708 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 35 transitions. [2022-03-15 19:32:25,708 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:26,049 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [20789#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= (+ ~x~0 (* (div ~x~0 4294967296) (- 4294967296))) (+ (* (div (+ ~y~0 ~C~0) 4294967296) (- 4294967296)) ~y~0 ~C~0))))] [2022-03-15 19:32:26,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:32:26,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:26,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:32:26,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1421, Unknown=3, NotChecked=0, Total=1560 [2022-03-15 19:32:26,050 INFO L87 Difference]: Start difference. First operand 190 states and 415 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 19:32:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:26,672 INFO L93 Difference]: Finished difference Result 224 states and 473 transitions. [2022-03-15 19:32:26,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:32:26,672 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:32:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:26,673 INFO L225 Difference]: With dead ends: 224 [2022-03-15 19:32:26,673 INFO L226 Difference]: Without dead ends: 213 [2022-03-15 19:32:26,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=165, Invalid=1812, Unknown=3, NotChecked=0, Total=1980 [2022-03-15 19:32:26,673 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:26,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 8 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:32:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-03-15 19:32:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2022-03-15 19:32:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 2.1917098445595853) internal successors, (423), 193 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 423 transitions. [2022-03-15 19:32:26,680 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 423 transitions. Word has length 21 [2022-03-15 19:32:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:26,680 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 423 transitions. [2022-03-15 19:32:26,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 19:32:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 423 transitions. [2022-03-15 19:32:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:32:26,681 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:26,681 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:26,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-03-15 19:32:26,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 19:32:26,891 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1245512147, now seen corresponding path program 26 times [2022-03-15 19:32:26,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:26,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985752096] [2022-03-15 19:32:26,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:27,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:27,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:27,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985752096] [2022-03-15 19:32:27,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985752096] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:27,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092892419] [2022-03-15 19:32:27,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:32:27,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:27,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:27,674 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:27,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 19:32:28,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:32:28,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:28,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 19:32:28,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:28,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:28,361 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 30 treesize of output 30 [2022-03-15 19:32:28,556 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:32:28,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:32:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:28,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:29,153 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:32:29,153 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 151 [2022-03-15 19:32:29,160 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:32:29,160 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 90 treesize of output 77 [2022-03-15 19:32:29,165 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:32:29,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 64 [2022-03-15 19:32:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:32:29,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092892419] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:29,549 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:29,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 38 [2022-03-15 19:32:29,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1971850232] [2022-03-15 19:32:29,549 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:29,552 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:29,557 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2022-03-15 19:32:29,558 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:30,274 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [21573#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 21572#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:32:30,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:32:30,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:30,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:32:30,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1562, Unknown=3, NotChecked=0, Total=1722 [2022-03-15 19:32:30,275 INFO L87 Difference]: Start difference. First operand 194 states and 423 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 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 19:32:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:31,191 INFO L93 Difference]: Finished difference Result 227 states and 478 transitions. [2022-03-15 19:32:31,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:32:31,191 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:32:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:31,192 INFO L225 Difference]: With dead ends: 227 [2022-03-15 19:32:31,192 INFO L226 Difference]: Without dead ends: 212 [2022-03-15 19:32:31,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=208, Invalid=1951, Unknown=3, NotChecked=0, Total=2162 [2022-03-15 19:32:31,192 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:31,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 9 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:32:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-03-15 19:32:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 192. [2022-03-15 19:32:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.18848167539267) internal successors, (418), 191 states have internal predecessors, (418), 0 states have call successors, (0), 0 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 19:32:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 418 transitions. [2022-03-15 19:32:31,195 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 418 transitions. Word has length 21 [2022-03-15 19:32:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:31,195 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 418 transitions. [2022-03-15 19:32:31,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 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 19:32:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 418 transitions. [2022-03-15 19:32:31,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:32:31,196 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:31,196 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:31,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-03-15 19:32:31,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 19:32:31,414 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:31,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:31,414 INFO L85 PathProgramCache]: Analyzing trace with hash -390205493, now seen corresponding path program 27 times [2022-03-15 19:32:31,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:31,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930928643] [2022-03-15 19:32:31,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:31,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:32,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:32,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930928643] [2022-03-15 19:32:32,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930928643] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:32,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822021651] [2022-03-15 19:32:32,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:32:32,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:32,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:32,013 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:32,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 19:32:32,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:32:32,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:32,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:32:32,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:32,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:32,381 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 30 treesize of output 30 [2022-03-15 19:32:32,579 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:32:32,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 22 [2022-03-15 19:32:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:32:32,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:33,198 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:32:33,199 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 173 [2022-03-15 19:32:33,204 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:32:33,204 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 105 treesize of output 72 [2022-03-15 19:32:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:32:33,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822021651] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:33,523 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:33,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 36 [2022-03-15 19:32:33,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1773226121] [2022-03-15 19:32:33,523 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:33,525 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:33,532 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 54 transitions. [2022-03-15 19:32:33,532 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:35,501 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [22353#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 22357#(and (= (+ ~q~0.offset (* ~q_front~0 4)) 0) (<= (* 3 ~C~0) ~x~0) (= ~y~0 0) (<= ~x~0 (* 3 ~C~0)) (= (select (select |#memory_int| ~q~0.base) (+ 4 (* ~q_front~0 4))) 1) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1)) (= ~q~0.offset 0)), 22356#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4)))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))))) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 22355#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 22354#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:32:35,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:32:35,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:35,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:32:35,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1641, Unknown=2, NotChecked=0, Total=1806 [2022-03-15 19:32:35,505 INFO L87 Difference]: Start difference. First operand 192 states and 418 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 19:32:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:36,817 INFO L93 Difference]: Finished difference Result 241 states and 505 transitions. [2022-03-15 19:32:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:32:36,817 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:32:36,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:36,818 INFO L225 Difference]: With dead ends: 241 [2022-03-15 19:32:36,818 INFO L226 Difference]: Without dead ends: 236 [2022-03-15 19:32:36,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=191, Invalid=2063, Unknown=2, NotChecked=0, Total=2256 [2022-03-15 19:32:36,818 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:36,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 13 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:32:36,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-03-15 19:32:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 192. [2022-03-15 19:32:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.18848167539267) internal successors, (418), 191 states have internal predecessors, (418), 0 states have call successors, (0), 0 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 19:32:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 418 transitions. [2022-03-15 19:32:36,821 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 418 transitions. Word has length 21 [2022-03-15 19:32:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:36,821 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 418 transitions. [2022-03-15 19:32:36,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 19:32:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 418 transitions. [2022-03-15 19:32:36,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:32:36,822 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:36,822 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:36,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 19:32:37,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:37,029 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2117844807, now seen corresponding path program 28 times [2022-03-15 19:32:37,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:37,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801085023] [2022-03-15 19:32:37,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:37,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:37,556 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:37,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801085023] [2022-03-15 19:32:37,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801085023] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:37,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647213407] [2022-03-15 19:32:37,556 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:32:37,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:37,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:37,557 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:37,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 19:32:37,724 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:32:37,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:37,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 87 conjunts are in the unsatisfiable core [2022-03-15 19:32:37,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:37,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:37,926 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 19 treesize of output 21 [2022-03-15 19:32:38,141 INFO L353 Elim1Store]: treesize reduction 52, result has 5.5 percent of original size [2022-03-15 19:32:38,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 19 [2022-03-15 19:32:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:38,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:39,050 INFO L353 Elim1Store]: treesize reduction 61, result has 39.0 percent of original size [2022-03-15 19:32:39,050 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 196 treesize of output 177 [2022-03-15 19:32:39,065 INFO L353 Elim1Store]: treesize reduction 37, result has 27.5 percent of original size [2022-03-15 19:32:39,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 104 [2022-03-15 19:32:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:39,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647213407] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:39,581 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:39,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-03-15 19:32:39,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [860468592] [2022-03-15 19:32:39,581 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:39,583 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:39,589 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 44 transitions. [2022-03-15 19:32:39,590 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:40,332 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [23158#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 23157#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (<= 0 ~q_front~0)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1)) (= ~y~0 0) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (= (select (select |#memory_int| ~q~0.base) 4) 1)) (<= 2 ~N~0) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (<= (+ ~n~0 ~q_front~0) (+ ~q_back~0 1))) (= ~q~0.offset 0) (<= |thread1Thread1of1ForFork0_~i~0#1| 2))] [2022-03-15 19:32:40,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:32:40,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:32:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1728, Unknown=2, NotChecked=0, Total=2070 [2022-03-15 19:32:40,333 INFO L87 Difference]: Start difference. First operand 192 states and 418 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:41,063 INFO L93 Difference]: Finished difference Result 247 states and 515 transitions. [2022-03-15 19:32:41,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:32:41,064 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:32:41,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:41,064 INFO L225 Difference]: With dead ends: 247 [2022-03-15 19:32:41,064 INFO L226 Difference]: Without dead ends: 236 [2022-03-15 19:32:41,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=408, Invalid=2140, Unknown=2, NotChecked=0, Total=2550 [2022-03-15 19:32:41,065 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:41,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 8 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:32:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-03-15 19:32:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 198. [2022-03-15 19:32:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.1878172588832485) internal successors, (431), 197 states have internal predecessors, (431), 0 states have call successors, (0), 0 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 19:32:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 431 transitions. [2022-03-15 19:32:41,084 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 431 transitions. Word has length 21 [2022-03-15 19:32:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:41,085 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 431 transitions. [2022-03-15 19:32:41,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 431 transitions. [2022-03-15 19:32:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:32:41,085 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:41,085 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:41,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 19:32:41,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:41,307 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:41,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:41,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1318247959, now seen corresponding path program 29 times [2022-03-15 19:32:41,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:41,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193628113] [2022-03-15 19:32:41,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:41,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:41,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:41,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193628113] [2022-03-15 19:32:41,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193628113] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:41,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758975848] [2022-03-15 19:32:41,849 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:32:41,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:41,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:41,850 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:41,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 19:32:41,975 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:32:41,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:41,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 83 conjunts are in the unsatisfiable core [2022-03-15 19:32:41,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:41,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-03-15 19:32:42,177 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 19:32:42,419 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:32:42,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-03-15 19:32:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:42,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:43,084 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:32:43,085 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 245 treesize of output 229 [2022-03-15 19:32:43,100 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:32:43,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 137 [2022-03-15 19:32:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:46,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758975848] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:46,177 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:46,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2022-03-15 19:32:46,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1131787502] [2022-03-15 19:32:46,177 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:46,179 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:46,186 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 19:32:46,186 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:47,278 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [23976#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0)) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= (+ ~x~0 (* (div ~x~0 4294967296) (- 4294967296))) (+ (* (div (+ ~y~0 ~C~0) 4294967296) (- 4294967296)) ~y~0 ~C~0)))), 23977#(and (or (= (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0))), 23975#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (<= 0 ~q_front~0)) (or (< (* ~n~0 4) (+ (* ~q_back~0 4) 4)) (= (select (select |#memory_int| ~q~0.base) (+ 4 (* ~q_front~0 4))) 1)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1)) (= ~y~0 0) (<= 2 ~N~0) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (<= (+ ~n~0 ~q_front~0) (+ ~q_back~0 1))) (= ~q~0.offset 0) (<= |thread1Thread1of1ForFork0_~i~0#1| 2))] [2022-03-15 19:32:47,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:32:47,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:47,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:32:47,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1772, Unknown=9, NotChecked=0, Total=2070 [2022-03-15 19:32:47,279 INFO L87 Difference]: Start difference. First operand 198 states and 431 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 19:32:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:48,181 INFO L93 Difference]: Finished difference Result 245 states and 512 transitions. [2022-03-15 19:32:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:32:48,182 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:32:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:48,182 INFO L225 Difference]: With dead ends: 245 [2022-03-15 19:32:48,183 INFO L226 Difference]: Without dead ends: 230 [2022-03-15 19:32:48,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=380, Invalid=2263, Unknown=9, NotChecked=0, Total=2652 [2022-03-15 19:32:48,184 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:48,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 9 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:32:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-03-15 19:32:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 196. [2022-03-15 19:32:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.1846153846153844) internal successors, (426), 195 states have internal predecessors, (426), 0 states have call successors, (0), 0 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 19:32:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 426 transitions. [2022-03-15 19:32:48,201 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 426 transitions. Word has length 21 [2022-03-15 19:32:48,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:48,202 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 426 transitions. [2022-03-15 19:32:48,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 19:32:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 426 transitions. [2022-03-15 19:32:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:32:48,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:48,202 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:48,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 19:32:48,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 19:32:48,419 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:48,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash -462941305, now seen corresponding path program 30 times [2022-03-15 19:32:48,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:48,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857322156] [2022-03-15 19:32:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:48,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:49,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:49,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857322156] [2022-03-15 19:32:49,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857322156] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:49,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063079138] [2022-03-15 19:32:49,022 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:32:49,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:49,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:49,024 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:49,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 19:32:49,231 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:32:49,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:49,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 19:32:49,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:49,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:49,462 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 19:32:49,700 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:32:49,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-03-15 19:32:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:49,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:50,177 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1560 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1560) c_~q~0.base))) (or (let ((.cse1 (let ((.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ .cse3 c_~q~0.offset)) (select .cse2 (+ .cse3 c_~q~0.offset 4))))) (.cse0 (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (= (mod (+ c_~y~0 (* c_~C~0 3)) 4294967296) (mod (+ (* c_~C~0 2) c_~x~0) 4294967296)))) (not (= (select .cse2 (+ c_~q~0.offset (* 4 c_~q_back~0))) 1))))) is different from false [2022-03-15 19:32:50,208 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:32:50,208 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 172 [2022-03-15 19:32:50,222 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:32:50,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 109 [2022-03-15 19:32:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:32:50,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063079138] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:50,945 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:50,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 38 [2022-03-15 19:32:50,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [263139168] [2022-03-15 19:32:50,945 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:50,947 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:50,954 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 63 transitions. [2022-03-15 19:32:50,954 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:53,771 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [24789#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 24792#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (<= 0 ~q_front~0)) (or (< (* ~n~0 4) (+ (* ~q_back~0 4) 4)) (= (select (select |#memory_int| ~q~0.base) (+ 4 (* ~q_front~0 4))) 1)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1)) (= ~y~0 0) (<= 2 ~N~0) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (<= (+ ~n~0 ~q_front~0) (+ ~q_back~0 1))) (= ~q~0.offset 0) (<= |thread1Thread1of1ForFork0_~i~0#1| 2)), 24790#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4)))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 24791#(and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (= (+ ~q~0.offset (* ~q_front~0 4)) 0) (<= (* 3 ~C~0) ~x~0) (= ~y~0 0) (<= ~x~0 (* 3 ~C~0)) (<= 2 ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ 4 (* ~q_front~0 4))) 1) (<= ~N~0 2) (= ~q~0.offset 0)), 24787#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 24788#(and (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:32:53,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:32:53,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:53,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:32:53,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1769, Unknown=1, NotChecked=86, Total=2070 [2022-03-15 19:32:53,772 INFO L87 Difference]: Start difference. First operand 196 states and 426 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 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 19:32:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:56,632 INFO L93 Difference]: Finished difference Result 255 states and 533 transitions. [2022-03-15 19:32:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:32:56,637 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:32:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:56,637 INFO L225 Difference]: With dead ends: 255 [2022-03-15 19:32:56,638 INFO L226 Difference]: Without dead ends: 250 [2022-03-15 19:32:56,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=316, Invalid=2443, Unknown=1, NotChecked=102, Total=2862 [2022-03-15 19:32:56,638 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:56,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 10 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:32:56,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-03-15 19:32:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 194. [2022-03-15 19:32:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 2.1917098445595853) internal successors, (423), 193 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 423 transitions. [2022-03-15 19:32:56,641 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 423 transitions. Word has length 21 [2022-03-15 19:32:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:56,641 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 423 transitions. [2022-03-15 19:32:56,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 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 19:32:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 423 transitions. [2022-03-15 19:32:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:32:56,642 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:56,642 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:56,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 19:32:56,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 19:32:56,851 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:32:56,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash 56985005, now seen corresponding path program 31 times [2022-03-15 19:32:56,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:56,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23541697] [2022-03-15 19:32:56,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:56,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:57,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:57,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23541697] [2022-03-15 19:32:57,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23541697] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:57,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906568351] [2022-03-15 19:32:57,529 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:32:57,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:57,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:57,530 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:32:57,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 19:32:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:57,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-15 19:32:57,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:57,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:57,966 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 19:32:58,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:58,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:58,226 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:32:58,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 26 [2022-03-15 19:32:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:32:58,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:59,068 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:32:59,069 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 171 [2022-03-15 19:32:59,090 INFO L353 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2022-03-15 19:32:59,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 109 [2022-03-15 19:33:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:00,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906568351] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:00,672 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:00,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-03-15 19:33:00,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1190552645] [2022-03-15 19:33:00,675 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:00,678 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:00,684 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2022-03-15 19:33:00,684 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:01,134 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [25616#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:33:01,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:33:01,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:01,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:33:01,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1717, Unknown=8, NotChecked=0, Total=1980 [2022-03-15 19:33:01,135 INFO L87 Difference]: Start difference. First operand 194 states and 423 transitions. Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:01,911 INFO L93 Difference]: Finished difference Result 265 states and 552 transitions. [2022-03-15 19:33:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:33:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:01,912 INFO L225 Difference]: With dead ends: 265 [2022-03-15 19:33:01,912 INFO L226 Difference]: Without dead ends: 256 [2022-03-15 19:33:01,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=363, Invalid=2385, Unknown=8, NotChecked=0, Total=2756 [2022-03-15 19:33:01,913 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 53 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:01,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 7 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:33:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-15 19:33:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 203. [2022-03-15 19:33:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 2.202970297029703) internal successors, (445), 202 states have internal predecessors, (445), 0 states have call successors, (0), 0 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 19:33:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 445 transitions. [2022-03-15 19:33:01,936 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 445 transitions. Word has length 21 [2022-03-15 19:33:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:01,936 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 445 transitions. [2022-03-15 19:33:01,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 445 transitions. [2022-03-15 19:33:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:01,937 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:01,937 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:01,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:02,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 19:33:02,138 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:02,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:02,138 INFO L85 PathProgramCache]: Analyzing trace with hash 915859535, now seen corresponding path program 32 times [2022-03-15 19:33:02,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:02,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497325158] [2022-03-15 19:33:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:02,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:02,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497325158] [2022-03-15 19:33:02,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497325158] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:02,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168113618] [2022-03-15 19:33:02,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:33:02,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:02,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:02,908 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:02,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 19:33:03,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:33:03,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:03,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-15 19:33:03,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:03,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:33:03,219 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 19:33:03,431 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:33:03,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-03-15 19:33:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:33:03,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:04,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1638 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1638) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (let ((.cse2 (select .cse3 (+ .cse4 c_~q~0.offset 4)))) (or (let ((.cse1 (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1)) (.cse0 (+ .cse2 (select .cse3 (+ .cse4 c_~q~0.offset))))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (= (mod (+ c_~y~0 (* c_~C~0 3)) 4294967296) (mod (+ (* c_~C~0 2) c_~x~0) 4294967296)))) (not (= (select .cse3 (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (= .cse2 0))))) is different from false [2022-03-15 19:33:04,071 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:33:04,072 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 194 [2022-03-15 19:33:04,093 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:33:04,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 116 [2022-03-15 19:33:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:33:05,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168113618] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:05,837 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:05,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 38 [2022-03-15 19:33:05,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [592156316] [2022-03-15 19:33:05,837 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:05,840 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:05,846 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2022-03-15 19:33:05,846 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:06,951 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [26464#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 26465#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:33:06,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:33:06,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:06,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:33:06,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1481, Unknown=1, NotChecked=78, Total=1722 [2022-03-15 19:33:06,952 INFO L87 Difference]: Start difference. First operand 203 states and 445 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:09,148 INFO L93 Difference]: Finished difference Result 250 states and 531 transitions. [2022-03-15 19:33:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:33:09,149 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:09,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:09,150 INFO L225 Difference]: With dead ends: 250 [2022-03-15 19:33:09,150 INFO L226 Difference]: Without dead ends: 237 [2022-03-15 19:33:09,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=266, Invalid=2389, Unknown=1, NotChecked=100, Total=2756 [2022-03-15 19:33:09,150 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:09,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 9 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:33:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-03-15 19:33:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 203. [2022-03-15 19:33:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 2.1930693069306932) internal successors, (443), 202 states have internal predecessors, (443), 0 states have call successors, (0), 0 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 19:33:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 443 transitions. [2022-03-15 19:33:09,153 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 443 transitions. Word has length 21 [2022-03-15 19:33:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:09,153 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 443 transitions. [2022-03-15 19:33:09,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 443 transitions. [2022-03-15 19:33:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:09,154 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:09,154 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:09,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:09,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 19:33:09,367 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:09,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1329918713, now seen corresponding path program 33 times [2022-03-15 19:33:09,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:09,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708616010] [2022-03-15 19:33:09,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:09,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:09,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:09,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708616010] [2022-03-15 19:33:09,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708616010] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:09,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994178020] [2022-03-15 19:33:09,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:33:09,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:09,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:09,824 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:09,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 19:33:09,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:33:09,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:09,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:33:09,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:10,269 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:33:10,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:33:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:33:10,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:10,803 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:33:10,803 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 105 [2022-03-15 19:33:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:33:11,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994178020] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:11,038 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:11,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 31 [2022-03-15 19:33:11,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [44664998] [2022-03-15 19:33:11,038 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:11,040 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:11,047 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 57 transitions. [2022-03-15 19:33:11,048 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:13,633 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [27297#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~x~0 0) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (< ~q_back~0 ~n~0))) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 11)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (= (+ 4 (* ~q_front~0 4)) (+ (* ~q_back~0 4) ~q~0.offset 4)) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (= ~q~0.offset 0) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< ~q_back~0 ~n~0)) (= ~s~0 0)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 11)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= (+ ~n~0 ~q_front~0) (+ 3 ~q_back~0)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< ~q_back~0 ~n~0))) (or (<= 0 ~x~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (= ~y~0 0) (not (< ~q_back~0 ~n~0)))), 27298#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (= ~y~0 0) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0))) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 11)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= (+ ~n~0 ~q_front~0) (+ 3 ~q_back~0)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (= ~q~0.offset 0) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~x~0 0) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0))) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 11)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (= (+ 4 (* ~q_front~0 4)) (+ (* ~q_back~0 4) ~q~0.offset 4)) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0))) (or (<= 0 ~x~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0)) (= ~s~0 0))), 27301#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0)) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= (+ ~x~0 (* (div ~x~0 4294967296) (- 4294967296))) (+ (* (div (+ ~y~0 ~C~0) 4294967296) (- 4294967296)) ~y~0 ~C~0)))), 27299#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~x~0 0) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (< ~q_back~0 ~n~0))) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 11)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (= (+ 4 (* ~q_front~0 4)) (+ (* ~q_back~0 4) ~q~0.offset 4)) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (= ~q~0.offset 0) (not (< ~q_back~0 ~n~0))) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 11)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= (+ ~n~0 ~q_front~0) (+ 3 ~q_back~0)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< ~q_back~0 ~n~0))) (or (<= 0 ~x~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (= ~y~0 0) (not (< ~q_back~0 ~n~0)))), 27300#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (= ~y~0 0) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0))) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 11)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= (+ ~n~0 ~q_front~0) (+ 3 ~q_back~0)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (= ~q~0.offset 0) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~x~0 0) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0))) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 11)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (= (+ 4 (* ~q_front~0 4)) (+ (* ~q_back~0 4) ~q~0.offset 4)) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0))) (or (<= 0 ~x~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0)) (not (< 0 ~N~0))))] [2022-03-15 19:33:13,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:33:13,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:13,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:33:13,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:33:13,634 INFO L87 Difference]: Start difference. First operand 203 states and 443 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 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 19:33:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:15,024 INFO L93 Difference]: Finished difference Result 290 states and 598 transitions. [2022-03-15 19:33:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:33:15,025 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:15,026 INFO L225 Difference]: With dead ends: 290 [2022-03-15 19:33:15,026 INFO L226 Difference]: Without dead ends: 281 [2022-03-15 19:33:15,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=247, Invalid=2203, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:33:15,026 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:15,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 13 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:33:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-03-15 19:33:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 198. [2022-03-15 19:33:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.197969543147208) internal successors, (433), 197 states have internal predecessors, (433), 0 states have call successors, (0), 0 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 19:33:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 433 transitions. [2022-03-15 19:33:15,044 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 433 transitions. Word has length 21 [2022-03-15 19:33:15,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:15,044 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 433 transitions. [2022-03-15 19:33:15,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 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 19:33:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 433 transitions. [2022-03-15 19:33:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:15,045 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:15,045 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:15,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:15,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:15,245 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash -136965365, now seen corresponding path program 34 times [2022-03-15 19:33:15,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:15,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006836350] [2022-03-15 19:33:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:15,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:15,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006836350] [2022-03-15 19:33:15,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006836350] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:15,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56894560] [2022-03-15 19:33:15,716 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:33:15,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:15,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:15,740 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:15,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 19:33:15,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:33:15,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:15,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 19:33:15,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:16,340 INFO L353 Elim1Store]: treesize reduction 39, result has 23.5 percent of original size [2022-03-15 19:33:16,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 26 [2022-03-15 19:33:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:16,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:16,855 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:33:16,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 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 107 [2022-03-15 19:33:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:17,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56894560] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:17,532 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:17,532 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-03-15 19:33:17,532 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1707069911] [2022-03-15 19:33:17,533 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:17,535 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:17,543 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 64 transitions. [2022-03-15 19:33:17,543 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:18,387 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [28172#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (<= 0 ~q_front~0)) (or (< (* ~n~0 4) (+ (* ~q_back~0 4) 4)) (= (select (select |#memory_int| ~q~0.base) (+ 4 (* ~q_front~0 4))) 1)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1)) (= ~y~0 0) (<= 2 ~N~0) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (<= (+ ~n~0 ~q_front~0) (+ ~q_back~0 1))) (= ~q~0.offset 0) (<= |thread1Thread1of1ForFork0_~i~0#1| 2)), 28173#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (* ~n~0 4) (+ (* ~q_back~0 4) 7 ~q~0.offset))) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) 7 ~q~0.offset)) (= (+ 4 (* ~q_front~0 4)) (+ (* ~q_back~0 4) ~q~0.offset))) (<= ~C~0 ~x~0) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) 7 ~q~0.offset)) (<= 0 ~q_front~0)) (<= ~x~0 ~C~0) (= ~y~0 0) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (* ~n~0 4) (+ (* ~q_back~0 4) 7 ~q~0.offset))) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|) (= ~q~0.offset 0)), 28175#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= (+ ~x~0 (* (div ~x~0 4294967296) (- 4294967296))) (+ (* (div (+ ~y~0 ~C~0) 4294967296) (- 4294967296)) ~y~0 ~C~0)))), 28174#(and (= ~x~0 0) (= ~y~0 0) (<= (* ~n~0 4) 12) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0))] [2022-03-15 19:33:18,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:33:18,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:18,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:33:18,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1599, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:33:18,388 INFO L87 Difference]: Start difference. First operand 198 states and 433 transitions. Second operand has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 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 19:33:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:19,047 INFO L93 Difference]: Finished difference Result 234 states and 495 transitions. [2022-03-15 19:33:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:33:19,048 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:19,049 INFO L225 Difference]: With dead ends: 234 [2022-03-15 19:33:19,049 INFO L226 Difference]: Without dead ends: 223 [2022-03-15 19:33:19,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=394, Invalid=2156, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:33:19,050 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:19,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 12 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:33:19,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-03-15 19:33:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2022-03-15 19:33:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.194871794871795) internal successors, (428), 195 states have internal predecessors, (428), 0 states have call successors, (0), 0 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 19:33:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 428 transitions. [2022-03-15 19:33:19,053 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 428 transitions. Word has length 21 [2022-03-15 19:33:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:19,054 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 428 transitions. [2022-03-15 19:33:19,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 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 19:33:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 428 transitions. [2022-03-15 19:33:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:19,054 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:19,054 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:19,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:19,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 19:33:19,261 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:19,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:19,261 INFO L85 PathProgramCache]: Analyzing trace with hash 721909165, now seen corresponding path program 35 times [2022-03-15 19:33:19,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:19,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557453710] [2022-03-15 19:33:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:19,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:19,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:19,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557453710] [2022-03-15 19:33:19,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557453710] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:19,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337108841] [2022-03-15 19:33:19,667 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:33:19,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:19,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:19,684 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:19,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 19:33:19,854 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:33:19,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:19,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 19:33:19,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:20,409 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-15 19:33:20,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 17 [2022-03-15 19:33:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:20,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:20,925 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:33:20,926 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 93 [2022-03-15 19:33:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:21,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337108841] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:21,801 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:21,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-03-15 19:33:21,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1902468364] [2022-03-15 19:33:21,802 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:21,804 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:21,812 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 68 transitions. [2022-03-15 19:33:21,812 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:24,064 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [28979#(and (or (not (= ~q_front~0 0)) (= ~y~0 0)) (or (not (= ~q_front~0 0)) (= (+ (* ~q_back~0 4) ~q~0.offset) 4)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (= ~q_front~0 0))) (or (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (not (= ~q_front~0 0))) (or (not (= ~q_front~0 0)) (= ~q~0.offset 0)) (or (not (= ~q_front~0 0)) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)) (or (<= ~x~0 ~C~0) (not (= ~q_front~0 0))) (or (<= ~C~0 ~x~0) (not (= ~q_front~0 0))) (< 0 (+ ~q_front~0 1)) (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (= ~q_front~0 0))), 28980#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 28977#(and (or (not (= ~q_front~0 0)) (= ~y~0 0)) (or (= ~q_front~0 0) (<= (+ ~n~0 ~q_front~0) (+ ~q_back~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (= ~q_front~0 0))) (or (<= ~x~0 (* 2 ~C~0)) (not (= ~q_front~0 0))) (or (not (= ~q_front~0 0)) (<= 2 ~N~0)) (or (not (= ~q_front~0 0)) (<= |thread1Thread1of1ForFork0_~i~0#1| 2)) (or (<= (* 2 ~C~0) ~x~0) (not (= ~q_front~0 0))) (or (not (= ~q_front~0 0)) (= ~q~0.offset 0)) (< 0 (+ ~q_front~0 1)) (or (not (= ~q_front~0 0)) (= (select (select |#memory_int| ~q~0.base) 4) 1))), 28981#(and (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 28978#(and (or (not (= ~q_front~0 0)) (= ~y~0 0)) (= (+ ~q_front~0 (* (- 1) ~q_back~0)) 0) (or (not (= ~q_front~0 0)) (= ~s~0 0)) (or (not (= ~q_front~0 0)) (= ~q~0.offset 0)) (or (<= ~n~0 3) (<= ~q_front~0 0)) (or (= ~x~0 0) (not (= ~q_front~0 0))))] [2022-03-15 19:33:24,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:33:24,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:33:24,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1835, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:33:24,065 INFO L87 Difference]: Start difference. First operand 196 states and 428 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 19:33:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:25,541 INFO L93 Difference]: Finished difference Result 240 states and 504 transitions. [2022-03-15 19:33:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:33:25,542 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:25,543 INFO L225 Difference]: With dead ends: 240 [2022-03-15 19:33:25,543 INFO L226 Difference]: Without dead ends: 225 [2022-03-15 19:33:25,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 22 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=309, Invalid=2447, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:33:25,543 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 36 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:25,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 13 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:33:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-03-15 19:33:25,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 194. [2022-03-15 19:33:25,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 2.1917098445595853) internal successors, (423), 193 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 423 transitions. [2022-03-15 19:33:25,546 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 423 transitions. Word has length 21 [2022-03-15 19:33:25,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:25,546 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 423 transitions. [2022-03-15 19:33:25,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 19:33:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 423 transitions. [2022-03-15 19:33:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:25,546 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:25,547 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:25,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-03-15 19:33:25,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 19:33:25,755 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:25,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1577215819, now seen corresponding path program 36 times [2022-03-15 19:33:25,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:25,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791845360] [2022-03-15 19:33:25,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:25,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:26,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:26,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791845360] [2022-03-15 19:33:26,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791845360] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:26,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596499238] [2022-03-15 19:33:26,342 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:33:26,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:26,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:26,343 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:26,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 19:33:26,525 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:33:26,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:26,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 19:33:26,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:26,825 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:33:26,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-03-15 19:33:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:33:26,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:27,257 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:33:27,257 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 93 [2022-03-15 19:33:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:33:27,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596499238] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:27,548 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:27,548 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 33 [2022-03-15 19:33:27,548 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [214946417] [2022-03-15 19:33:27,549 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:27,551 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:27,560 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 83 transitions. [2022-03-15 19:33:27,560 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:30,499 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [29786#(and (or (not (= ~q_front~0 0)) (= ~y~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (= ~q_front~0 0))) (or (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (not (= ~q_front~0 0))) (or (not (= ~q_front~0 0)) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|)) (or (<= ~x~0 ~C~0) (not (= ~q_front~0 0))) (or (<= ~C~0 ~x~0) (not (= ~q_front~0 0))) (< 0 (+ ~q_front~0 1)) (= ~q~0.offset 0) (or (not (= ~q_front~0 0)) (= (+ 4 (* ~q_front~0 4)) (+ (* ~q_back~0 4) ~q~0.offset))) (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (= ~q_front~0 0))), 29780#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 29782#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4)))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))))) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 29781#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 29785#(and (or (not (= ~q_front~0 0)) (= ~y~0 0)) (or (= ~q_front~0 0) (<= (+ ~n~0 ~q_front~0) (+ ~q_back~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (= ~q_front~0 0))) (or (<= ~x~0 (* 2 ~C~0)) (not (= ~q_front~0 0))) (or (not (= ~q_front~0 0)) (<= 2 ~N~0)) (or (not (= ~q_front~0 0)) (<= |thread1Thread1of1ForFork0_~i~0#1| 2)) (or (<= (* 2 ~C~0) ~x~0) (not (= ~q_front~0 0))) (< 0 (+ ~q_front~0 1)) (= ~q~0.offset 0) (or (not (= ~q_front~0 0)) (= (select (select |#memory_int| ~q~0.base) (+ 4 (* ~q_front~0 4))) 1))), 29779#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 29784#(and (or (not (= ~q_front~0 0)) (= ~y~0 0)) (= (+ ~q_front~0 (* (- 1) ~q_back~0)) 0) (or (<= ~n~0 3) (<= ~q_front~0 0)) (or (= ~x~0 0) (not (= ~q_front~0 0))) (= ~q~0.offset 0) (= ~s~0 0)), 29783#(and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (* 3 ~C~0) ~x~0) (= ~y~0 0) (<= ~x~0 (* 3 ~C~0)) (<= ~q_front~0 0) (<= 2 ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ 4 (* ~q_front~0 4))) 1) (< 0 (+ ~q_front~0 1)) (<= ~N~0 2) (= ~q~0.offset 0))] [2022-03-15 19:33:30,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:33:30,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:30,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:33:30,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1595, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:33:30,500 INFO L87 Difference]: Start difference. First operand 194 states and 423 transitions. Second operand has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 19:33:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:32,783 INFO L93 Difference]: Finished difference Result 240 states and 506 transitions. [2022-03-15 19:33:32,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:33:32,784 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:32,784 INFO L225 Difference]: With dead ends: 240 [2022-03-15 19:33:32,784 INFO L226 Difference]: Without dead ends: 235 [2022-03-15 19:33:32,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=341, Invalid=2311, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:33:32,785 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 76 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:32,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 17 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:33:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-03-15 19:33:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 192. [2022-03-15 19:33:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.1989528795811517) internal successors, (420), 191 states have internal predecessors, (420), 0 states have call successors, (0), 0 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 19:33:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 420 transitions. [2022-03-15 19:33:32,788 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 420 transitions. Word has length 21 [2022-03-15 19:33:32,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:32,788 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 420 transitions. [2022-03-15 19:33:32,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 19:33:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 420 transitions. [2022-03-15 19:33:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:32,788 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:32,788 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:32,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:32,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 19:33:32,993 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:32,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1338950637, now seen corresponding path program 37 times [2022-03-15 19:33:32,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:32,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558993043] [2022-03-15 19:33:32,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:32,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:33,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:33,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558993043] [2022-03-15 19:33:33,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558993043] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:33,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539942624] [2022-03-15 19:33:33,365 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:33:33,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:33,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:33,366 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:33,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 19:33:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:33,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 19:33:33,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:33,996 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-15 19:33:33,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 17 [2022-03-15 19:33:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:34,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:34,484 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:33:34,485 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 93 [2022-03-15 19:33:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:35,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539942624] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:35,406 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:35,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-03-15 19:33:35,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [114349864] [2022-03-15 19:33:35,406 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:35,408 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:35,416 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions. [2022-03-15 19:33:35,416 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:36,535 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [30593#(and (= ~x~0 0) (<= ~n~0 3) (= ~y~0 0) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), 30591#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 30590#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~C~0 ~x~0) (or (not (= (+ (* ~q_back~0 4) ~q~0.offset) 4)) (<= 0 ~q_front~0)) (<= ~n~0 3) (<= ~x~0 ~C~0) (= ~y~0 0) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (* ~n~0 4) (+ (* ~q_back~0 4) 7 ~q~0.offset))) (<= 1 ~q_back~0) (<= 1 |thread1Thread1of1ForFork0_~i~0#1|) (or (not (= (+ (* ~q_back~0 4) ~q~0.offset) 4)) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0))) (= ~q~0.offset 0)), 30592#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:33:36,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:33:36,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:36,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:33:36,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1691, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:33:36,536 INFO L87 Difference]: Start difference. First operand 192 states and 420 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 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 19:33:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:38,240 INFO L93 Difference]: Finished difference Result 226 states and 485 transitions. [2022-03-15 19:33:38,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:33:38,241 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:38,242 INFO L225 Difference]: With dead ends: 226 [2022-03-15 19:33:38,242 INFO L226 Difference]: Without dead ends: 213 [2022-03-15 19:33:38,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=427, Invalid=2543, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:33:38,242 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:38,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 15 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:33:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-03-15 19:33:38,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 186. [2022-03-15 19:33:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.189189189189189) internal successors, (405), 185 states have internal predecessors, (405), 0 states have call successors, (0), 0 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 19:33:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 405 transitions. [2022-03-15 19:33:38,245 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 405 transitions. Word has length 21 [2022-03-15 19:33:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:38,245 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 405 transitions. [2022-03-15 19:33:38,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 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 19:33:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 405 transitions. [2022-03-15 19:33:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:38,245 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:38,245 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:38,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:38,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:38,452 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:38,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:38,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1764595519, now seen corresponding path program 38 times [2022-03-15 19:33:38,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:38,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847844670] [2022-03-15 19:33:38,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:38,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:38,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:38,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847844670] [2022-03-15 19:33:38,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847844670] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:38,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756420041] [2022-03-15 19:33:38,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:33:38,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:38,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:38,868 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:38,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 19:33:38,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:33:38,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:38,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:33:38,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:39,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:33:39,163 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 19 treesize of output 21 [2022-03-15 19:33:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:33:39,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:39,260 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1871 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1871) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-03-15 19:33:39,270 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:33:39,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-03-15 19:33:39,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-03-15 19:33:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-03-15 19:33:39,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756420041] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:39,379 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:39,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 28 [2022-03-15 19:33:39,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [375508972] [2022-03-15 19:33:39,379 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:39,381 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:39,386 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2022-03-15 19:33:39,387 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:39,692 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:33:39,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:33:39,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:39,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:33:39,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=676, Unknown=1, NotChecked=52, Total=812 [2022-03-15 19:33:39,692 INFO L87 Difference]: Start difference. First operand 186 states and 405 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 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 19:33:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:40,123 INFO L93 Difference]: Finished difference Result 218 states and 483 transitions. [2022-03-15 19:33:40,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:33:40,123 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:40,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:40,124 INFO L225 Difference]: With dead ends: 218 [2022-03-15 19:33:40,124 INFO L226 Difference]: Without dead ends: 218 [2022-03-15 19:33:40,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=1066, Unknown=1, NotChecked=66, Total=1260 [2022-03-15 19:33:40,125 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 51 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:40,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 10 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:33:40,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-03-15 19:33:40,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 208. [2022-03-15 19:33:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.2318840579710146) internal successors, (462), 207 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 19:33:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 462 transitions. [2022-03-15 19:33:40,127 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 462 transitions. Word has length 21 [2022-03-15 19:33:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:40,127 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 462 transitions. [2022-03-15 19:33:40,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 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 19:33:40,128 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 462 transitions. [2022-03-15 19:33:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:40,128 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:40,128 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:40,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:40,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:40,344 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:40,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:40,344 INFO L85 PathProgramCache]: Analyzing trace with hash -550565333, now seen corresponding path program 39 times [2022-03-15 19:33:40,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:40,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199921530] [2022-03-15 19:33:40,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:40,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:40,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:40,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199921530] [2022-03-15 19:33:40,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199921530] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:40,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557313905] [2022-03-15 19:33:40,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:33:40,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:40,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:40,732 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:40,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 19:33:40,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:33:40,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:40,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:33:40,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:40,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:33:40,977 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 19:33:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:33:41,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:41,204 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:33:41,204 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-03-15 19:33:41,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:33:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:33:41,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557313905] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:41,385 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:41,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 24 [2022-03-15 19:33:41,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [862284330] [2022-03-15 19:33:41,385 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:41,387 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:41,392 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 29 transitions. [2022-03-15 19:33:41,392 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:41,478 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:33:41,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:33:41,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:41,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:33:41,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=482, Unknown=1, NotChecked=0, Total=600 [2022-03-15 19:33:41,479 INFO L87 Difference]: Start difference. First operand 208 states and 462 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 19:33:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:41,753 INFO L93 Difference]: Finished difference Result 240 states and 538 transitions. [2022-03-15 19:33:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:33:41,753 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:41,754 INFO L225 Difference]: With dead ends: 240 [2022-03-15 19:33:41,754 INFO L226 Difference]: Without dead ends: 238 [2022-03-15 19:33:41,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=665, Unknown=1, NotChecked=0, Total=812 [2022-03-15 19:33:41,755 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:41,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 10 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:33:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-03-15 19:33:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 214. [2022-03-15 19:33:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.267605633802817) internal successors, (483), 213 states have internal predecessors, (483), 0 states have call successors, (0), 0 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 19:33:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 483 transitions. [2022-03-15 19:33:41,758 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 483 transitions. Word has length 21 [2022-03-15 19:33:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:41,758 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 483 transitions. [2022-03-15 19:33:41,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 19:33:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 483 transitions. [2022-03-15 19:33:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:41,758 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:41,758 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:41,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:41,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:41,967 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:41,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:41,968 INFO L85 PathProgramCache]: Analyzing trace with hash -938444153, now seen corresponding path program 40 times [2022-03-15 19:33:41,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:41,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616951233] [2022-03-15 19:33:41,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:42,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:42,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616951233] [2022-03-15 19:33:42,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616951233] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:42,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036165046] [2022-03-15 19:33:42,473 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:33:42,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:42,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:42,474 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:42,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 19:33:42,637 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:33:42,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:42,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:33:42,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:42,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:33:42,758 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 19 treesize of output 21 [2022-03-15 19:33:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:33:42,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:42,837 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1957 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1957) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-03-15 19:33:42,843 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:33:42,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-03-15 19:33:42,845 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-03-15 19:33:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:33:42,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036165046] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:42,933 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:42,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 7] total 26 [2022-03-15 19:33:42,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [957565003] [2022-03-15 19:33:42,933 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:42,936 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:42,941 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 33 transitions. [2022-03-15 19:33:42,941 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:43,082 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [32977#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:33:43,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:33:43,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:43,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:33:43,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=612, Unknown=1, NotChecked=50, Total=756 [2022-03-15 19:33:43,083 INFO L87 Difference]: Start difference. First operand 214 states and 483 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 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 19:33:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:43,356 INFO L93 Difference]: Finished difference Result 238 states and 532 transitions. [2022-03-15 19:33:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:33:43,356 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:43,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:43,357 INFO L225 Difference]: With dead ends: 238 [2022-03-15 19:33:43,357 INFO L226 Difference]: Without dead ends: 238 [2022-03-15 19:33:43,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=811, Unknown=1, NotChecked=58, Total=992 [2022-03-15 19:33:43,357 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 51 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:43,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 10 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:33:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-03-15 19:33:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 208. [2022-03-15 19:33:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.2318840579710146) internal successors, (462), 207 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 19:33:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 462 transitions. [2022-03-15 19:33:43,360 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 462 transitions. Word has length 21 [2022-03-15 19:33:43,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:43,360 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 462 transitions. [2022-03-15 19:33:43,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 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 19:33:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 462 transitions. [2022-03-15 19:33:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:43,361 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:43,361 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:43,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:43,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 19:33:43,580 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1727769655, now seen corresponding path program 41 times [2022-03-15 19:33:43,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:43,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197459882] [2022-03-15 19:33:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:43,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:43,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:43,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197459882] [2022-03-15 19:33:43,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197459882] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:43,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941559902] [2022-03-15 19:33:43,910 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:33:43,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:43,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:43,911 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:43,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 19:33:44,042 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:33:44,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:44,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:33:44,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:33:44,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:44,157 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:33:44,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-03-15 19:33:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 19:33:44,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941559902] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:44,200 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:44,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 17 [2022-03-15 19:33:44,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [20749942] [2022-03-15 19:33:44,200 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:44,202 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:44,207 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 31 transitions. [2022-03-15 19:33:44,207 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:44,336 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:33:44,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:33:44,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:44,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:33:44,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:33:44,337 INFO L87 Difference]: Start difference. First operand 208 states and 462 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 19:33:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:44,617 INFO L93 Difference]: Finished difference Result 283 states and 639 transitions. [2022-03-15 19:33:44,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:33:44,618 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:44,619 INFO L225 Difference]: With dead ends: 283 [2022-03-15 19:33:44,619 INFO L226 Difference]: Without dead ends: 281 [2022-03-15 19:33:44,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:33:44,619 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 51 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:44,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 9 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:33:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-03-15 19:33:44,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 216. [2022-03-15 19:33:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 2.26046511627907) internal successors, (486), 215 states have internal predecessors, (486), 0 states have call successors, (0), 0 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 19:33:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 486 transitions. [2022-03-15 19:33:44,622 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 486 transitions. Word has length 21 [2022-03-15 19:33:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:44,622 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 486 transitions. [2022-03-15 19:33:44,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 19:33:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 486 transitions. [2022-03-15 19:33:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:44,624 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:44,624 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:44,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:44,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-15 19:33:44,825 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:44,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2115648475, now seen corresponding path program 42 times [2022-03-15 19:33:44,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:44,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322842838] [2022-03-15 19:33:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:45,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:45,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322842838] [2022-03-15 19:33:45,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322842838] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:45,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389636295] [2022-03-15 19:33:45,126 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:33:45,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:45,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:45,127 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:45,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 19:33:45,267 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:33:45,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:45,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:33:45,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:33:45,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:45,410 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:33:45,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-03-15 19:33:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 19:33:45,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389636295] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:45,453 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:45,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 4] total 18 [2022-03-15 19:33:45,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [176378608] [2022-03-15 19:33:45,453 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:45,455 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:45,460 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 35 transitions. [2022-03-15 19:33:45,460 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:45,613 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [34648#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:33:45,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:33:45,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:45,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:33:45,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:33:45,614 INFO L87 Difference]: Start difference. First operand 216 states and 486 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 19:33:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:45,980 INFO L93 Difference]: Finished difference Result 275 states and 619 transitions. [2022-03-15 19:33:45,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:33:45,980 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:45,981 INFO L225 Difference]: With dead ends: 275 [2022-03-15 19:33:45,981 INFO L226 Difference]: Without dead ends: 275 [2022-03-15 19:33:45,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:33:45,982 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:45,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 11 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:33:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-03-15 19:33:45,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 208. [2022-03-15 19:33:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.2318840579710146) internal successors, (462), 207 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 19:33:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 462 transitions. [2022-03-15 19:33:45,985 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 462 transitions. Word has length 21 [2022-03-15 19:33:45,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:45,985 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 462 transitions. [2022-03-15 19:33:45,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 19:33:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 462 transitions. [2022-03-15 19:33:45,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:45,985 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:45,985 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:46,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:46,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-15 19:33:46,186 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:46,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:46,186 INFO L85 PathProgramCache]: Analyzing trace with hash -505184958, now seen corresponding path program 43 times [2022-03-15 19:33:46,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:46,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116860475] [2022-03-15 19:33:46,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:46,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:46,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:46,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116860475] [2022-03-15 19:33:46,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116860475] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:46,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847552028] [2022-03-15 19:33:46,877 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:33:46,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:46,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:46,879 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:46,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 19:33:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:47,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:33:47,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:47,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:33:47,252 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 19:33:47,356 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 25 treesize of output 7 [2022-03-15 19:33:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:33:47,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:47,625 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2088 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2088) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (or (and (= c_~N~0 .cse0) (= (mod c_~x~0 4294967296) (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296))) (= .cse0 0)))) is different from false [2022-03-15 19:33:47,695 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:33:47,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 80 [2022-03-15 19:33:47,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-03-15 19:33:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:33:48,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847552028] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:48,014 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:48,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 9] total 36 [2022-03-15 19:33:48,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [658889221] [2022-03-15 19:33:48,015 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:48,016 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:48,021 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2022-03-15 19:33:48,021 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:48,603 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:33:48,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:33:48,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:48,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:33:48,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1209, Unknown=1, NotChecked=70, Total=1406 [2022-03-15 19:33:48,604 INFO L87 Difference]: Start difference. First operand 208 states and 462 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:49,187 INFO L93 Difference]: Finished difference Result 229 states and 497 transitions. [2022-03-15 19:33:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:33:49,188 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:49,188 INFO L225 Difference]: With dead ends: 229 [2022-03-15 19:33:49,188 INFO L226 Difference]: Without dead ends: 210 [2022-03-15 19:33:49,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=224, Invalid=1941, Unknown=1, NotChecked=90, Total=2256 [2022-03-15 19:33:49,189 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 60 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:49,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 13 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:33:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-03-15 19:33:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 202. [2022-03-15 19:33:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 2.2338308457711444) internal successors, (449), 201 states have internal predecessors, (449), 0 states have call successors, (0), 0 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 19:33:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 449 transitions. [2022-03-15 19:33:49,191 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 449 transitions. Word has length 21 [2022-03-15 19:33:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:49,192 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 449 transitions. [2022-03-15 19:33:49,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 449 transitions. [2022-03-15 19:33:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:49,192 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:49,192 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:49,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:49,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-03-15 19:33:49,409 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:49,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1086742666, now seen corresponding path program 44 times [2022-03-15 19:33:49,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:49,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021217242] [2022-03-15 19:33:49,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:49,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:50,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:50,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021217242] [2022-03-15 19:33:50,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021217242] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:50,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116150220] [2022-03-15 19:33:50,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:33:50,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:50,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:50,478 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:50,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 19:33:50,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:33:50,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:50,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 19:33:50,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:50,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-03-15 19:33:50,869 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 19:33:50,943 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 25 treesize of output 7 [2022-03-15 19:33:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:33:51,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:51,309 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:33:51,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2022-03-15 19:33:51,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-03-15 19:33:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:33:51,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116150220] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:51,750 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:51,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 9] total 36 [2022-03-15 19:33:51,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1413654482] [2022-03-15 19:33:51,751 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:51,752 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:51,757 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 33 transitions. [2022-03-15 19:33:51,757 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:52,377 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [36327#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:33:52,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:33:52,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:52,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:33:52,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1320, Unknown=1, NotChecked=0, Total=1482 [2022-03-15 19:33:52,378 INFO L87 Difference]: Start difference. First operand 202 states and 449 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 19:33:53,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:53,389 INFO L93 Difference]: Finished difference Result 227 states and 498 transitions. [2022-03-15 19:33:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:33:53,390 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:53,390 INFO L225 Difference]: With dead ends: 227 [2022-03-15 19:33:53,391 INFO L226 Difference]: Without dead ends: 218 [2022-03-15 19:33:53,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=288, Invalid=2161, Unknown=1, NotChecked=0, Total=2450 [2022-03-15 19:33:53,391 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 66 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:53,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 11 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:33:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-03-15 19:33:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 204. [2022-03-15 19:33:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.2463054187192117) internal successors, (456), 203 states have internal predecessors, (456), 0 states have call successors, (0), 0 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 19:33:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 456 transitions. [2022-03-15 19:33:53,394 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 456 transitions. Word has length 21 [2022-03-15 19:33:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:53,394 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 456 transitions. [2022-03-15 19:33:53,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 19:33:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 456 transitions. [2022-03-15 19:33:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:53,394 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:53,394 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:53,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-15 19:33:53,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-03-15 19:33:53,595 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:53,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1945617196, now seen corresponding path program 45 times [2022-03-15 19:33:53,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:53,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838571128] [2022-03-15 19:33:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:33:54,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:54,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838571128] [2022-03-15 19:33:54,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838571128] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:54,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716970043] [2022-03-15 19:33:54,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:33:54,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:54,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:54,093 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:54,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 19:33:54,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:33:54,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:54,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:33:54,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:54,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:33:54,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:33:54,871 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 19:33:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:33:54,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:55,227 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:33:55,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2022-03-15 19:33:55,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-03-15 19:33:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:33:55,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716970043] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:55,528 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:55,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 31 [2022-03-15 19:33:55,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [640517040] [2022-03-15 19:33:55,529 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:55,530 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:55,536 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 19:33:55,536 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:33:56,974 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [37140#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4)))) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 37138#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 37139#(and (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 37141#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= 1 ~N~0) (= ~y~0 0) (<= ~N~0 1) (= ~q~0.offset 0))] [2022-03-15 19:33:56,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:33:56,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:33:56,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:33:56,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1170, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:33:56,975 INFO L87 Difference]: Start difference. First operand 204 states and 456 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:33:58,188 INFO L93 Difference]: Finished difference Result 290 states and 658 transitions. [2022-03-15 19:33:58,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:33:58,188 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:33:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:33:58,189 INFO L225 Difference]: With dead ends: 290 [2022-03-15 19:33:58,189 INFO L226 Difference]: Without dead ends: 268 [2022-03-15 19:33:58,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=318, Invalid=1938, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:33:58,189 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 78 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:33:58,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 7 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:33:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-03-15 19:33:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 204. [2022-03-15 19:33:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.2216748768472905) internal successors, (451), 203 states have internal predecessors, (451), 0 states have call successors, (0), 0 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 19:33:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 451 transitions. [2022-03-15 19:33:58,192 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 451 transitions. Word has length 21 [2022-03-15 19:33:58,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:33:58,192 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 451 transitions. [2022-03-15 19:33:58,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:33:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 451 transitions. [2022-03-15 19:33:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:33:58,193 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:33:58,193 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:33:58,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-03-15 19:33:58,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-03-15 19:33:58,398 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:33:58,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:33:58,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1638585678, now seen corresponding path program 46 times [2022-03-15 19:33:58,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:33:58,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358741120] [2022-03-15 19:33:58,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:33:58,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:33:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:33:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:33:58,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:33:58,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358741120] [2022-03-15 19:33:58,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358741120] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:33:58,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283251155] [2022-03-15 19:33:58,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:33:58,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:33:58,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:33:58,856 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:33:58,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 19:33:59,036 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:33:59,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:33:59,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:33:59,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:33:59,226 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-15 19:33:59,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2022-03-15 19:33:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:33:59,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:33:59,503 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:33:59,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-03-15 19:33:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:33:59,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283251155] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:33:59,780 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:33:59,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 27 [2022-03-15 19:33:59,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1901294288] [2022-03-15 19:33:59,781 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:33:59,782 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:33:59,789 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 53 transitions. [2022-03-15 19:33:59,789 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:00,472 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [38011#(and (= ~x~0 0) (= ~y~0 0) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), 38012#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~C~0 ~x~0) (<= 1 ~N~0) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1)) (<= ~x~0 ~C~0) (= ~y~0 0) (= ~q~0.offset 0)), 38013#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:34:00,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:34:00,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:00,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:34:00,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:34:00,472 INFO L87 Difference]: Start difference. First operand 204 states and 451 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 19:34:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:00,963 INFO L93 Difference]: Finished difference Result 259 states and 573 transitions. [2022-03-15 19:34:00,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:34:00,963 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:34:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:00,964 INFO L225 Difference]: With dead ends: 259 [2022-03-15 19:34:00,964 INFO L226 Difference]: Without dead ends: 250 [2022-03-15 19:34:00,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:34:00,965 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 70 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:00,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 11 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:34:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-03-15 19:34:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 208. [2022-03-15 19:34:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.2270531400966185) internal successors, (461), 207 states have internal predecessors, (461), 0 states have call successors, (0), 0 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 19:34:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 461 transitions. [2022-03-15 19:34:00,982 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 461 transitions. Word has length 21 [2022-03-15 19:34:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:00,982 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 461 transitions. [2022-03-15 19:34:00,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 19:34:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 461 transitions. [2022-03-15 19:34:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:34:00,983 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:00,983 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:01,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:01,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:01,205 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:01,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:01,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1797507088, now seen corresponding path program 47 times [2022-03-15 19:34:01,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:01,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921146152] [2022-03-15 19:34:01,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:01,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:01,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921146152] [2022-03-15 19:34:01,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921146152] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:01,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990068050] [2022-03-15 19:34:01,738 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:34:01,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:01,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:01,739 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:01,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 19:34:01,982 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:34:01,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:01,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 19:34:01,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:02,240 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 19:34:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:34:02,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:02,502 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:34:02,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 45 [2022-03-15 19:34:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:34:02,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990068050] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:02,841 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:02,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 30 [2022-03-15 19:34:02,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1144737741] [2022-03-15 19:34:02,841 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:02,843 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:02,850 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 68 transitions. [2022-03-15 19:34:02,850 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:04,595 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [38866#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= ~C~0 ~x~0) (<= 1 ~N~0) (<= ~x~0 ~C~0) (= ~y~0 0) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (< (+ (* ~n~0 4) (* ~q_front~0 4)) (+ (* ~q_back~0 4) (* (div (+ 7 ~q~0.offset (* ~q_front~0 4)) 4) 4)))) (= ~q~0.offset 0)), 38862#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 38865#(and (= ~x~0 0) (= ~y~0 0) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), 38863#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4)))) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 38864#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= 1 ~N~0) (= ~y~0 0) (<= ~N~0 1) (= ~q~0.offset 0)), 38861#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:34:04,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:34:04,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:34:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1190, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:34:04,596 INFO L87 Difference]: Start difference. First operand 208 states and 461 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 19:34:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:05,790 INFO L93 Difference]: Finished difference Result 277 states and 616 transitions. [2022-03-15 19:34:05,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:34:05,790 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:34:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:05,791 INFO L225 Difference]: With dead ends: 277 [2022-03-15 19:34:05,791 INFO L226 Difference]: Without dead ends: 264 [2022-03-15 19:34:05,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=446, Invalid=2004, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:34:05,792 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 97 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:05,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 13 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:34:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-03-15 19:34:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 204. [2022-03-15 19:34:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.2216748768472905) internal successors, (451), 203 states have internal predecessors, (451), 0 states have call successors, (0), 0 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 19:34:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 451 transitions. [2022-03-15 19:34:05,795 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 451 transitions. Word has length 21 [2022-03-15 19:34:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:05,795 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 451 transitions. [2022-03-15 19:34:05,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 19:34:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 451 transitions. [2022-03-15 19:34:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:34:05,805 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:05,805 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:05,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:06,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:06,005 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:06,006 INFO L85 PathProgramCache]: Analyzing trace with hash -92986908, now seen corresponding path program 9 times [2022-03-15 19:34:06,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:06,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431563273] [2022-03-15 19:34:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:06,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:06,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431563273] [2022-03-15 19:34:06,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431563273] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:06,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440869317] [2022-03-15 19:34:06,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:34:06,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:06,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:06,639 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:06,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 19:34:06,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:34:06,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:06,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:34:06,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:06,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:34:06,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 19:34:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:34:06,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:06,897 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2327 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2327) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:34:06,904 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:34:06,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-03-15 19:34:06,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:34:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 1 not checked. [2022-03-15 19:34:06,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440869317] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:06,958 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:06,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 21 [2022-03-15 19:34:06,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [218271356] [2022-03-15 19:34:06,958 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:06,959 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:06,964 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 33 transitions. [2022-03-15 19:34:06,964 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:07,053 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:34:07,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:34:07,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:07,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:34:07,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=348, Unknown=1, NotChecked=38, Total=462 [2022-03-15 19:34:07,054 INFO L87 Difference]: Start difference. First operand 204 states and 451 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 19:34:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:07,424 INFO L93 Difference]: Finished difference Result 278 states and 615 transitions. [2022-03-15 19:34:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:34:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:34:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:07,426 INFO L225 Difference]: With dead ends: 278 [2022-03-15 19:34:07,426 INFO L226 Difference]: Without dead ends: 278 [2022-03-15 19:34:07,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=798, Unknown=1, NotChecked=60, Total=1056 [2022-03-15 19:34:07,426 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 82 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:07,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 11 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:34:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-03-15 19:34:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 228. [2022-03-15 19:34:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.198237885462555) internal successors, (499), 227 states have internal predecessors, (499), 0 states have call successors, (0), 0 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 19:34:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 499 transitions. [2022-03-15 19:34:07,439 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 499 transitions. Word has length 21 [2022-03-15 19:34:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:07,439 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 499 transitions. [2022-03-15 19:34:07,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 19:34:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 499 transitions. [2022-03-15 19:34:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:34:07,440 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:07,440 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:07,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:07,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:07,655 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:07,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:07,656 INFO L85 PathProgramCache]: Analyzing trace with hash -50864448, now seen corresponding path program 48 times [2022-03-15 19:34:07,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:07,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759471336] [2022-03-15 19:34:07,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:34:07,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:07,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759471336] [2022-03-15 19:34:07,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759471336] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:07,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220505978] [2022-03-15 19:34:07,736 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:34:07,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:07,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:07,737 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:07,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-15 19:34:07,987 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:34:07,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:07,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:34:07,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:34:08,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:34:08,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220505978] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:08,092 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:08,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 8] total 14 [2022-03-15 19:34:08,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [522398125] [2022-03-15 19:34:08,092 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:08,094 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:08,101 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 52 transitions. [2022-03-15 19:34:08,101 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:08,163 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:34:08,261 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:34:08,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:34:08,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:08,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:34:08,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:34:08,262 INFO L87 Difference]: Start difference. First operand 228 states and 499 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 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 19:34:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:08,309 INFO L93 Difference]: Finished difference Result 340 states and 729 transitions. [2022-03-15 19:34:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:34:08,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:34:08,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:08,310 INFO L225 Difference]: With dead ends: 340 [2022-03-15 19:34:08,310 INFO L226 Difference]: Without dead ends: 312 [2022-03-15 19:34:08,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:34:08,310 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:08,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 1 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:34:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-03-15 19:34:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 260. [2022-03-15 19:34:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 2.2355212355212357) internal successors, (579), 259 states have internal predecessors, (579), 0 states have call successors, (0), 0 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 19:34:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 579 transitions. [2022-03-15 19:34:08,314 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 579 transitions. Word has length 22 [2022-03-15 19:34:08,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:08,314 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 579 transitions. [2022-03-15 19:34:08,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 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 19:34:08,314 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 579 transitions. [2022-03-15 19:34:08,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:34:08,314 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:08,314 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:08,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:08,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-03-15 19:34:08,533 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:08,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:08,533 INFO L85 PathProgramCache]: Analyzing trace with hash 60802221, now seen corresponding path program 49 times [2022-03-15 19:34:08,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:08,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907248899] [2022-03-15 19:34:08,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:08,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:08,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:08,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907248899] [2022-03-15 19:34:08,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907248899] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:08,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936634347] [2022-03-15 19:34:08,591 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:34:08,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:08,592 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:08,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-15 19:34:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:08,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:34:08,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:08,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:09,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936634347] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:09,043 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:09,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 19:34:09,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [883408421] [2022-03-15 19:34:09,043 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:09,045 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:09,051 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2022-03-15 19:34:09,051 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:09,088 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:34:09,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:34:09,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:09,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:34:09,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:34:09,092 INFO L87 Difference]: Start difference. First operand 260 states and 579 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 19:34:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:09,215 INFO L93 Difference]: Finished difference Result 274 states and 600 transitions. [2022-03-15 19:34:09,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:34:09,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:34:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:09,217 INFO L225 Difference]: With dead ends: 274 [2022-03-15 19:34:09,217 INFO L226 Difference]: Without dead ends: 241 [2022-03-15 19:34:09,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:34:09,217 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:09,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 6 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:34:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-03-15 19:34:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-03-15 19:34:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.2708333333333335) internal successors, (545), 240 states have internal predecessors, (545), 0 states have call successors, (0), 0 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 19:34:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 545 transitions. [2022-03-15 19:34:09,222 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 545 transitions. Word has length 22 [2022-03-15 19:34:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:09,222 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 545 transitions. [2022-03-15 19:34:09,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 19:34:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 545 transitions. [2022-03-15 19:34:09,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:34:09,223 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:09,223 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:09,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:09,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-03-15 19:34:09,435 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1132430904, now seen corresponding path program 50 times [2022-03-15 19:34:09,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:09,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070090249] [2022-03-15 19:34:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:09,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:10,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:10,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070090249] [2022-03-15 19:34:10,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070090249] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:10,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515913269] [2022-03-15 19:34:10,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:34:10,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:10,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:10,291 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:10,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-03-15 19:34:10,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:34:10,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:10,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-15 19:34:10,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:10,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:34:10,961 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 30 treesize of output 30 [2022-03-15 19:34:11,175 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:34:11,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-03-15 19:34:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:11,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:11,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2446 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2446) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (let ((.cse0 (select .cse1 (+ .cse2 c_~q~0.offset 4)))) (or (= .cse0 0) (and (= (+ .cse0 (select .cse1 (+ .cse2 c_~q~0.offset))) c_~N~0) (= (mod c_~x~0 4294967296) (mod (+ c_~y~0 (* c_~C~0 3)) 4294967296))))))) is different from false [2022-03-15 19:34:11,809 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:34:11,809 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 173 [2022-03-15 19:34:11,816 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:34:11,816 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 105 treesize of output 72 [2022-03-15 19:34:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:34:12,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515913269] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:12,214 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:12,214 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 40 [2022-03-15 19:34:12,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1988777638] [2022-03-15 19:34:12,215 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:12,216 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:12,223 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 46 transitions. [2022-03-15 19:34:12,223 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:13,133 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:34:13,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:34:13,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:13,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:34:13,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1514, Unknown=1, NotChecked=78, Total=1722 [2022-03-15 19:34:13,134 INFO L87 Difference]: Start difference. First operand 241 states and 545 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:13,663 INFO L93 Difference]: Finished difference Result 258 states and 570 transitions. [2022-03-15 19:34:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:34:13,663 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:34:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:13,664 INFO L225 Difference]: With dead ends: 258 [2022-03-15 19:34:13,664 INFO L226 Difference]: Without dead ends: 235 [2022-03-15 19:34:13,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=1747, Unknown=1, NotChecked=84, Total=1980 [2022-03-15 19:34:13,665 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:13,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 12 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:34:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-03-15 19:34:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2022-03-15 19:34:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 2.2735042735042734) internal successors, (532), 234 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 532 transitions. [2022-03-15 19:34:13,668 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 532 transitions. Word has length 22 [2022-03-15 19:34:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:13,668 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 532 transitions. [2022-03-15 19:34:13,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 532 transitions. [2022-03-15 19:34:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:34:13,668 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:13,668 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:13,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:13,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:13,869 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:13,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:13,869 INFO L85 PathProgramCache]: Analyzing trace with hash -187145716, now seen corresponding path program 51 times [2022-03-15 19:34:13,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:13,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233528234] [2022-03-15 19:34:13,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:13,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:15,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:15,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233528234] [2022-03-15 19:34:15,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233528234] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:15,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468151551] [2022-03-15 19:34:15,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:34:15,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:15,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:15,028 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:15,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-03-15 19:34:15,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:34:15,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:15,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-15 19:34:15,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:15,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:34:15,807 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 30 treesize of output 30 [2022-03-15 19:34:16,006 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:34:16,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-03-15 19:34:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:34:18,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:18,865 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ c_~q_front~0 1) 0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (and (forall ((v_ArrVal_2489 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2489) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q~0.offset)) (select .cse0 (+ .cse1 c_~q~0.offset 4)))))) (forall ((v_ArrVal_2489 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2489) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ .cse3 c_~q~0.offset)) (select .cse2 (+ .cse3 c_~q~0.offset 4)))) (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1))) (= (mod (+ c_~y~0 (* c_~C~0 3)) 4294967296) (mod (+ (* c_~C~0 2) c_~x~0) 4294967296))) (<= c_~q_back~0 c_~q_front~0)) is different from false [2022-03-15 19:34:18,900 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-03-15 19:34:18,900 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 137 [2022-03-15 19:34:18,905 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:34:18,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 77 [2022-03-15 19:34:18,910 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:34:18,910 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 77 treesize of output 64 [2022-03-15 19:34:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-03-15 19:34:19,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468151551] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:19,268 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:19,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 39 [2022-03-15 19:34:19,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1870728975] [2022-03-15 19:34:19,269 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:19,270 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:19,291 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2022-03-15 19:34:19,291 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:19,842 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [43458#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:34:19,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:34:19,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:19,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:34:19,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1433, Unknown=17, NotChecked=78, Total=1722 [2022-03-15 19:34:19,843 INFO L87 Difference]: Start difference. First operand 235 states and 532 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:20,699 INFO L93 Difference]: Finished difference Result 259 states and 583 transitions. [2022-03-15 19:34:20,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:34:20,699 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:34:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:20,700 INFO L225 Difference]: With dead ends: 259 [2022-03-15 19:34:20,700 INFO L226 Difference]: Without dead ends: 250 [2022-03-15 19:34:20,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=223, Invalid=1744, Unknown=17, NotChecked=86, Total=2070 [2022-03-15 19:34:20,701 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:20,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:34:20,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-03-15 19:34:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2022-03-15 19:34:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.2946058091286305) internal successors, (553), 241 states have internal predecessors, (553), 0 states have call successors, (0), 0 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 19:34:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 553 transitions. [2022-03-15 19:34:20,704 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 553 transitions. Word has length 22 [2022-03-15 19:34:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:20,704 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 553 transitions. [2022-03-15 19:34:20,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 553 transitions. [2022-03-15 19:34:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:34:20,704 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:20,704 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:20,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:20,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:20,905 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:20,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:20,905 INFO L85 PathProgramCache]: Analyzing trace with hash 671728814, now seen corresponding path program 52 times [2022-03-15 19:34:20,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:20,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270140524] [2022-03-15 19:34:20,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:20,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:21,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:21,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270140524] [2022-03-15 19:34:21,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270140524] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:21,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776032564] [2022-03-15 19:34:21,725 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:34:21,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:21,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:21,727 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:21,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-03-15 19:34:21,997 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:34:21,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:21,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-15 19:34:22,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:22,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:34:22,252 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 30 treesize of output 30 [2022-03-15 19:34:22,466 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:34:22,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 12 [2022-03-15 19:34:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:22,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:23,268 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:34:23,269 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 173 [2022-03-15 19:34:23,277 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:34:23,278 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 105 treesize of output 72 [2022-03-15 19:34:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:34:23,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776032564] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:23,803 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:23,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 40 [2022-03-15 19:34:23,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1577280244] [2022-03-15 19:34:23,803 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:23,805 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:23,812 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2022-03-15 19:34:23,812 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:24,773 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [44378#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 44379#(and (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:34:24,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:34:24,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:24,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:34:24,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1712, Unknown=2, NotChecked=0, Total=1892 [2022-03-15 19:34:24,774 INFO L87 Difference]: Start difference. First operand 242 states and 553 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:26,037 INFO L93 Difference]: Finished difference Result 278 states and 638 transitions. [2022-03-15 19:34:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:34:26,037 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:34:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:26,038 INFO L225 Difference]: With dead ends: 278 [2022-03-15 19:34:26,038 INFO L226 Difference]: Without dead ends: 265 [2022-03-15 19:34:26,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=241, Invalid=2207, Unknown=2, NotChecked=0, Total=2450 [2022-03-15 19:34:26,038 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:26,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 11 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:34:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-03-15 19:34:26,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 242. [2022-03-15 19:34:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.2946058091286305) internal successors, (553), 241 states have internal predecessors, (553), 0 states have call successors, (0), 0 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 19:34:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 553 transitions. [2022-03-15 19:34:26,041 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 553 transitions. Word has length 22 [2022-03-15 19:34:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:26,041 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 553 transitions. [2022-03-15 19:34:26,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 553 transitions. [2022-03-15 19:34:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:34:26,042 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:26,042 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:26,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:26,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-03-15 19:34:26,259 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:26,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1527035468, now seen corresponding path program 53 times [2022-03-15 19:34:26,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:26,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98664070] [2022-03-15 19:34:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:27,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:27,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98664070] [2022-03-15 19:34:27,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98664070] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:27,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844248087] [2022-03-15 19:34:27,146 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:34:27,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:27,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:27,148 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:27,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-03-15 19:34:27,353 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:34:27,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:27,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-15 19:34:27,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:27,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:34:27,628 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 30 treesize of output 30 [2022-03-15 19:34:27,830 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:34:27,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:34:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:27,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:28,525 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:34:28,526 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 172 [2022-03-15 19:34:28,533 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:34:28,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 72 [2022-03-15 19:34:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:34:29,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844248087] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:29,024 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:29,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 40 [2022-03-15 19:34:29,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [740290121] [2022-03-15 19:34:29,024 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:29,026 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:29,033 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 55 transitions. [2022-03-15 19:34:29,033 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:30,928 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [45324#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 45326#(and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (* 3 ~C~0) ~x~0) (= ~y~0 0) (<= ~x~0 (* 3 ~C~0)) (<= 2 ~N~0) (<= ~N~0 2) (= ~q~0.offset 0) (<= 0 ~q_front~0) (<= ~q_front~0 1) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 1)), 45325#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4)))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 45323#(and (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 45322#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:34:30,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:34:30,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:30,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:34:30,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1931, Unknown=2, NotChecked=0, Total=2162 [2022-03-15 19:34:30,929 INFO L87 Difference]: Start difference. First operand 242 states and 553 transitions. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 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 19:34:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:33,151 INFO L93 Difference]: Finished difference Result 280 states and 634 transitions. [2022-03-15 19:34:33,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:34:33,151 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:34:33,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:33,152 INFO L225 Difference]: With dead ends: 280 [2022-03-15 19:34:33,152 INFO L226 Difference]: Without dead ends: 263 [2022-03-15 19:34:33,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=334, Invalid=2634, Unknown=2, NotChecked=0, Total=2970 [2022-03-15 19:34:33,156 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 60 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:33,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 12 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:34:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-03-15 19:34:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 242. [2022-03-15 19:34:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.2780082987551866) internal successors, (549), 241 states have internal predecessors, (549), 0 states have call successors, (0), 0 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 19:34:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 549 transitions. [2022-03-15 19:34:33,159 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 549 transitions. Word has length 22 [2022-03-15 19:34:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:33,159 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 549 transitions. [2022-03-15 19:34:33,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 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 19:34:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 549 transitions. [2022-03-15 19:34:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:34:33,159 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:33,159 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:33,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:33,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-03-15 19:34:33,386 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:33,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1947198656, now seen corresponding path program 54 times [2022-03-15 19:34:33,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:33,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212273] [2022-03-15 19:34:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:33,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:34,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:34,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212273] [2022-03-15 19:34:34,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212273] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:34,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360057381] [2022-03-15 19:34:34,171 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:34:34,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:34,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:34,172 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:34,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-03-15 19:34:34,436 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:34:34,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:34,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 84 conjunts are in the unsatisfiable core [2022-03-15 19:34:34,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:34,455 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:34:34,456 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 19:34:34,627 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 19 treesize of output 21 [2022-03-15 19:34:34,792 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:34:34,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:34:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:34,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:35,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2621 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2621) c_~q~0.base))) (or (not (= (select .cse0 (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (let ((.cse2 (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1)) (.cse1 (let ((.cse3 (* c_~q_front~0 4))) (+ (select .cse0 (+ .cse3 c_~q~0.offset 4)) (select .cse0 (+ .cse3 c_~q~0.offset)))))) (and (<= .cse1 .cse2) (<= .cse2 .cse1) (= (mod (+ c_~y~0 (* c_~C~0 3)) 4294967296) (mod (+ (* c_~C~0 2) c_~x~0) 4294967296))))))) is different from false [2022-03-15 19:34:35,315 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:34:35,315 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 172 [2022-03-15 19:34:35,330 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:34:35,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 109 [2022-03-15 19:34:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:34:35,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360057381] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:35,907 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:35,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 40 [2022-03-15 19:34:35,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1992873984] [2022-03-15 19:34:35,907 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:35,909 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:35,916 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 45 transitions. [2022-03-15 19:34:35,916 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:37,987 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [46276#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (* ~n~0 4) (+ (* ~q_back~0 4) 7 ~q~0.offset)) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= ~q_front~0 1)) (<= 2 ~N~0) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= 0 (* ~q_front~0 4)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (= (select (select |#memory_int| ~q~0.base) (+ 4 (* ~q_front~0 4))) 1) (not (< ~q_back~0 ~n~0)) (<= 1 (+ ~q~0.offset (* ~q_front~0 4)))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (= ~q~0.offset 0) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= ~x~0 ~C~0) (not (<= ~q_front~0 1)) (not (< ~q_back~0 ~n~0))) (or (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= ~q_front~0 1)) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (= ~y~0 0) (not (<= ~q_front~0 1)) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< ~q_back~0 ~n~0)) (not (= (+ ~q~0.offset (* ~q_front~0 4)) 0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= (+ ~n~0 ~q_front~0) (+ 3 ~q_back~0)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< ~q_back~0 ~n~0)) (<= ~q_front~0 1)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~C~0 ~x~0) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= ~q_front~0 1)) (not (< ~q_back~0 ~n~0))) (or (not (= ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< (+ (* ~n~0 4) (* ~q_front~0 4)) (+ (* ~q_back~0 4) 12)) (= (select (select |#memory_int| ~q~0.base) 8) 1) (< ~q_back~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= ~q_front~0 1)) (not (< ~q_back~0 ~n~0)) (= ~s~0 0)) (or (not (= ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= (+ (* ~n~0 4) (* ~q_front~0 4)) (+ (* ~q_back~0 4) 12)) (< ~q_back~0 0))), 46277#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (* ~n~0 4) (+ (* ~q_back~0 4) 7 ~q~0.offset)) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= ~q_front~0 1)) (<= 2 ~N~0) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= 0 (* ~q_front~0 4)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (= (select (select |#memory_int| ~q~0.base) (+ 4 (* ~q_front~0 4))) 1) (not (< ~q_back~0 ~n~0)) (<= 1 (+ ~q~0.offset (* ~q_front~0 4)))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (= ~q~0.offset 0) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= ~x~0 ~C~0) (not (<= ~q_front~0 1)) (not (< ~q_back~0 ~n~0))) (or (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= ~q_front~0 1)) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (= ~y~0 0) (not (<= ~q_front~0 1)) (not (< ~q_back~0 ~n~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< ~q_back~0 ~n~0)) (not (= (+ ~q~0.offset (* ~q_front~0 4)) 0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= (+ ~n~0 ~q_front~0) (+ 3 ~q_back~0)) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< ~q_back~0 ~n~0)) (<= ~q_front~0 1)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~C~0 ~x~0) (not (<= 0 ~q_back~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= ~q_front~0 1)) (not (< ~q_back~0 ~n~0))) (or (not (= ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< (+ (* ~n~0 4) (* ~q_front~0 4)) (+ (* ~q_back~0 4) 12)) (= (select (select |#memory_int| ~q~0.base) 8) 1) (< ~q_back~0 0)) (or (not (= ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= (+ (* ~n~0 4) (* ~q_front~0 4)) (+ (* ~q_back~0 4) 12)) (< ~q_back~0 0))), 46275#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0))))] [2022-03-15 19:34:37,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:34:37,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:37,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:34:37,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1740, Unknown=1, NotChecked=84, Total=1980 [2022-03-15 19:34:37,988 INFO L87 Difference]: Start difference. First operand 242 states and 549 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 19:34:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:39,213 INFO L93 Difference]: Finished difference Result 338 states and 740 transitions. [2022-03-15 19:34:39,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:34:39,214 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:34:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:39,215 INFO L225 Difference]: With dead ends: 338 [2022-03-15 19:34:39,215 INFO L226 Difference]: Without dead ends: 329 [2022-03-15 19:34:39,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=192, Invalid=2261, Unknown=1, NotChecked=96, Total=2550 [2022-03-15 19:34:39,215 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:39,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 8 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:34:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-03-15 19:34:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 243. [2022-03-15 19:34:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 2.2975206611570247) internal successors, (556), 242 states have internal predecessors, (556), 0 states have call successors, (0), 0 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 19:34:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 556 transitions. [2022-03-15 19:34:39,219 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 556 transitions. Word has length 22 [2022-03-15 19:34:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:39,219 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 556 transitions. [2022-03-15 19:34:39,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 19:34:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 556 transitions. [2022-03-15 19:34:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:34:39,220 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:39,220 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:39,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-03-15 19:34:39,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:39,435 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash 598993002, now seen corresponding path program 55 times [2022-03-15 19:34:39,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:39,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109505559] [2022-03-15 19:34:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:40,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:40,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109505559] [2022-03-15 19:34:40,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109505559] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:40,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83037227] [2022-03-15 19:34:40,437 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:34:40,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:40,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:40,438 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:40,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-03-15 19:34:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:40,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-15 19:34:40,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:40,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:34:40,853 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 19 treesize of output 21 [2022-03-15 19:34:41,083 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:34:41,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 22 [2022-03-15 19:34:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:41,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:41,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2664 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2664) c_~q~0.base)) (.cse5 (* c_~q_front~0 4))) (let ((.cse1 (select .cse0 (+ .cse5 c_~q~0.offset))) (.cse2 (select .cse0 (+ .cse5 c_~q~0.offset 4)))) (or (not (= (select .cse0 (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (= .cse1 0) (= .cse2 0) (let ((.cse4 (+ .cse1 .cse2)) (.cse3 (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1))) (and (<= .cse3 .cse4) (= (mod (+ c_~y~0 (* c_~C~0 3)) 4294967296) (mod (+ (* c_~C~0 2) c_~x~0) 4294967296)) (<= .cse4 .cse3))))))) is different from false [2022-03-15 19:34:41,674 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:34:41,674 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 231 treesize of output 215 [2022-03-15 19:34:41,693 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:34:41,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 123 [2022-03-15 19:34:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:34:42,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83037227] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:42,202 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:42,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 40 [2022-03-15 19:34:42,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [326235917] [2022-03-15 19:34:42,202 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:42,204 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:42,211 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 49 transitions. [2022-03-15 19:34:42,211 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:43,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [47283#(and (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 47282#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 47284#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (= (select (select |#memory_int| ~q~0.base) (+ 4 (* ~q_front~0 4))) 1)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (= ~q_front~0 1) (= ~q_front~0 0)) (or (= ~q_front~0 0) (<= (* ~n~0 4) (+ (* ~q_back~0 4) 4))) (= ~y~0 0) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) ~N~0)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (= (select (select |#memory_int| ~q~0.base) 4) 1)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 3)) (<= |thread1Thread1of1ForFork0_~i~0#1| (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1))) (= ~q~0.offset 0))] [2022-03-15 19:34:43,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:34:43,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:43,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:34:43,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1723, Unknown=1, NotChecked=84, Total=1980 [2022-03-15 19:34:43,396 INFO L87 Difference]: Start difference. First operand 243 states and 556 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:44,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:44,788 INFO L93 Difference]: Finished difference Result 284 states and 646 transitions. [2022-03-15 19:34:44,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:34:44,789 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:34:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:44,790 INFO L225 Difference]: With dead ends: 284 [2022-03-15 19:34:44,790 INFO L226 Difference]: Without dead ends: 271 [2022-03-15 19:34:44,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=230, Invalid=2223, Unknown=1, NotChecked=96, Total=2550 [2022-03-15 19:34:44,790 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:44,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 10 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:34:44,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-03-15 19:34:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 241. [2022-03-15 19:34:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.2875) internal successors, (549), 240 states have internal predecessors, (549), 0 states have call successors, (0), 0 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 19:34:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 549 transitions. [2022-03-15 19:34:44,794 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 549 transitions. Word has length 22 [2022-03-15 19:34:44,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:44,794 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 549 transitions. [2022-03-15 19:34:44,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 549 transitions. [2022-03-15 19:34:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:34:44,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:44,794 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:44,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:45,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-03-15 19:34:45,000 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:45,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:45,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1454299656, now seen corresponding path program 56 times [2022-03-15 19:34:45,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:45,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028095745] [2022-03-15 19:34:45,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:45,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:45,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:45,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028095745] [2022-03-15 19:34:45,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028095745] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:45,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156403248] [2022-03-15 19:34:45,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:34:45,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:45,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:45,925 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:45,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-03-15 19:34:46,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:34:46,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:46,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-15 19:34:46,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:46,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:34:46,390 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 19 treesize of output 21 [2022-03-15 19:34:46,609 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:34:46,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-03-15 19:34:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:46,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:47,192 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2707 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2707) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (let ((.cse1 (select .cse0 (+ .cse4 c_~q~0.offset 4)))) (or (not (= (select .cse0 (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (= .cse1 0) (let ((.cse3 (+ .cse1 (select .cse0 (+ .cse4 c_~q~0.offset)))) (.cse2 (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1))) (and (<= .cse2 .cse3) (<= .cse3 .cse2) (= (mod (+ c_~y~0 (* c_~C~0 3)) 4294967296) (mod (+ (* c_~C~0 2) c_~x~0) 4294967296)))))))) is different from false [2022-03-15 19:34:47,233 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:34:47,233 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 194 [2022-03-15 19:34:47,249 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:34:47,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 116 [2022-03-15 19:34:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:34:50,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156403248] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:50,040 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:50,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 40 [2022-03-15 19:34:50,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1749975008] [2022-03-15 19:34:50,041 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:50,042 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:50,050 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 64 transitions. [2022-03-15 19:34:50,050 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:52,290 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [48231#(and (or (not (<= (+ (div (+ ~y~0 ~C~0) 4294967296) 1) (div ~x~0 4294967296))) (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0) (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (<= (+ (* (div (+ ~y~0 ~C~0) 4294967296) 4294967296) ~x~0) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 ~C~0)))), 48234#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4)))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 48233#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 3 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 3 ~C~0)) 4294967296) 4294967296) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 48235#(and (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (* 3 ~C~0) ~x~0) (= ~y~0 0) (<= ~x~0 (* 3 ~C~0)) (<= 2 ~N~0) (<= ~N~0 2) (= ~q~0.offset 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 1)), 48236#(and (<= (* 2 ~C~0) ~x~0) (<= ~x~0 (* 2 ~C~0)) (<= (* ~n~0 4) (+ (* ~q_back~0 4) 8)) (or (< (* ~n~0 4) (+ (* ~q_back~0 4) 4)) (<= 2 ~N~0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (< (* ~n~0 4) (+ (* ~q_back~0 4) 4))) (= ~y~0 0) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 4)) (<= 0 ~q_front~0)) (= ~q~0.offset 0) (or (< (* ~n~0 4) (+ (* ~q_back~0 4) 4)) (<= |thread1Thread1of1ForFork0_~i~0#1| 2)) (or (< (* ~n~0 4) (+ (* ~q_back~0 4) 4)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 1)) (or (<= (* ~n~0 4) (+ (* ~q_back~0 4) ~q~0.offset 4)) (<= (* ~q_front~0 4) 0))), 48232#(and (or (<= (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296)) (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0))) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (div ~x~0 4294967296) (+ (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (* (div ~x~0 4294967296) 4294967296) ~y~0 (* 2 ~C~0)) (+ ~x~0 (* (div (+ ~y~0 (* 2 ~C~0)) 4294967296) 4294967296) 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:34:52,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:34:52,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:52,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:34:52,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1938, Unknown=2, NotChecked=90, Total=2256 [2022-03-15 19:34:52,291 INFO L87 Difference]: Start difference. First operand 241 states and 549 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 19:34:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:54,737 INFO L93 Difference]: Finished difference Result 288 states and 649 transitions. [2022-03-15 19:34:54,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:34:54,738 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:34:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:54,738 INFO L225 Difference]: With dead ends: 288 [2022-03-15 19:34:54,739 INFO L226 Difference]: Without dead ends: 271 [2022-03-15 19:34:54,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=332, Invalid=2640, Unknown=2, NotChecked=106, Total=3080 [2022-03-15 19:34:54,739 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 84 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:54,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 13 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:34:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-03-15 19:34:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 239. [2022-03-15 19:34:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 2.277310924369748) internal successors, (542), 238 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 19:34:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 542 transitions. [2022-03-15 19:34:54,742 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 542 transitions. Word has length 22 [2022-03-15 19:34:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:54,742 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 542 transitions. [2022-03-15 19:34:54,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 19:34:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 542 transitions. [2022-03-15 19:34:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:34:54,743 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:54,743 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:54,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:54,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:54,961 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:54,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:54,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1974225966, now seen corresponding path program 57 times [2022-03-15 19:34:54,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:54,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826668533] [2022-03-15 19:34:54,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:55,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:55,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826668533] [2022-03-15 19:34:55,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826668533] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:55,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518039619] [2022-03-15 19:34:55,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:34:55,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:55,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:55,721 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:34:55,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-03-15 19:34:55,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:34:55,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:55,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-15 19:34:55,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:56,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:34:56,116 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 19 treesize of output 21 [2022-03-15 19:34:56,296 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:34:56,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 12 [2022-03-15 19:34:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:34:56,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:56,949 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2750 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2750) c_~q~0.base))) (or (not (= (select .cse0 (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (let ((.cse2 (let ((.cse3 (* c_~q_front~0 4))) (+ (select .cse0 (+ .cse3 c_~q~0.offset)) (select .cse0 (+ .cse3 c_~q~0.offset 4))))) (.cse1 (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1))) (and (<= .cse1 .cse2) (= (mod (+ c_~y~0 (* c_~C~0 3)) 4294967296) (mod (+ (* c_~C~0 2) c_~x~0) 4294967296)) (<= .cse2 .cse1)))))) is different from false [2022-03-15 19:34:56,987 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:34:56,987 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 172 [2022-03-15 19:34:57,005 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:34:57,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 109 Received shutdown request... [2022-03-15 19:45:06,265 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 19:45:06,267 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 19:45:06,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-03-15 19:45:06,300 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:45:06,313 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:45:06,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:06,479 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 23 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 11 for 10ms.. [2022-03-15 19:45:06,481 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 19:45:06,481 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 19:45:06,482 INFO L732 BasicCegarLoop]: Path program histogram: [57, 9, 3, 2, 1] [2022-03-15 19:45:06,483 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:45:06,483 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:45:06,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:45:06 BasicIcfg [2022-03-15 19:45:06,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:45:06,485 INFO L158 Benchmark]: Toolchain (without parser) took 853677.44ms. Allocated memory was 215.0MB in the beginning and 574.6MB in the end (delta: 359.7MB). Free memory was 162.1MB in the beginning and 384.1MB in the end (delta: -221.9MB). Peak memory consumption was 338.1MB. Max. memory is 8.0GB. [2022-03-15 19:45:06,485 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 215.0MB. Free memory is still 178.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:45:06,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.93ms. Allocated memory was 215.0MB in the beginning and 275.8MB in the end (delta: 60.8MB). Free memory was 162.0MB in the beginning and 250.0MB in the end (delta: -88.1MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-03-15 19:45:06,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.23ms. Allocated memory is still 275.8MB. Free memory was 250.0MB in the beginning and 247.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:45:06,485 INFO L158 Benchmark]: Boogie Preprocessor took 25.31ms. Allocated memory is still 275.8MB. Free memory was 247.9MB in the beginning and 246.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:45:06,485 INFO L158 Benchmark]: RCFGBuilder took 355.27ms. Allocated memory is still 275.8MB. Free memory was 246.3MB in the beginning and 225.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-03-15 19:45:06,485 INFO L158 Benchmark]: TraceAbstraction took 853036.73ms. Allocated memory was 275.8MB in the beginning and 574.6MB in the end (delta: 298.8MB). Free memory was 224.9MB in the beginning and 384.1MB in the end (delta: -159.2MB). Peak memory consumption was 339.5MB. Max. memory is 8.0GB. [2022-03-15 19:45:06,485 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 215.0MB. Free memory is still 178.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.93ms. Allocated memory was 215.0MB in the beginning and 275.8MB in the end (delta: 60.8MB). Free memory was 162.0MB in the beginning and 250.0MB in the end (delta: -88.1MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.23ms. Allocated memory is still 275.8MB. Free memory was 250.0MB in the beginning and 247.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.31ms. Allocated memory is still 275.8MB. Free memory was 247.9MB in the beginning and 246.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 355.27ms. Allocated memory is still 275.8MB. Free memory was 246.3MB in the beginning and 225.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 853036.73ms. Allocated memory was 275.8MB in the beginning and 574.6MB in the end (delta: 298.8MB). Free memory was 224.9MB in the beginning and 384.1MB in the end (delta: -159.2MB). Peak memory consumption was 339.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 141 PlacesBefore, 24 PlacesAfterwards, 145 TransitionsBefore, 20 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 7 FixpointIterations, 93 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 149 TotalNumberOfCompositions, 815 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 714, positive: 688, positive conditional: 0, positive unconditional: 688, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 393, positive: 384, positive conditional: 0, positive unconditional: 384, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 714, positive: 304, positive conditional: 0, positive unconditional: 304, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 393, unknown conditional: 0, unknown unconditional: 393] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 23 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 11 for 10ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 23 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 11 for 10ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 23 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 11 for 10ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 159 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 852.9s, OverallIterations: 72, TraceHistogramMax: 6, PathProgramHistogramMax: 57, EmptinessCheckTime: 0.0s, AutomataDifference: 51.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2943 SdHoareTripleChecker+Valid, 17.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2943 mSDsluCounter, 648 SdHoareTripleChecker+Invalid, 15.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 26 IncrementalHoareTripleChecker+Unchecked, 8972 mSDsCounter, 1420 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28198 IncrementalHoareTripleChecker+Invalid, 29644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1420 mSolverCounterUnsat, 81 mSDtfsCounter, 28198 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4532 GetRequests, 1845 SyntacticMatches, 201 SemanticMatches, 2486 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 22486 ImplicationChecksByTransitivity, 98.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=63, InterpolantAutomatonStates: 1060, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 71 MinimizatonAttempts, 2205 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 9.0s SatisfiabilityAnalysisTime, 100.1s InterpolantComputationTime, 2724 NumberOfCodeBlocks, 2712 NumberOfCodeBlocksAsserted, 212 NumberOfCheckSat, 3845 ConstructedInterpolants, 464 QuantifiedInterpolants, 104838 SizeOfPredicates, 1161 NumberOfNonLiveVariables, 16384 ConjunctsInSsa, 3191 ConjunctsInUnsatCore, 203 InterpolantComputations, 6 PerfectInterpolantSequences, 662/2236 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown